Optimal node routing

Yossi Azar, Yoel Chaiutin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study route selection for packet switching in the competitive throughput model. In contrast to previous papers which considered competitive algorithms for packet scheduling, we consider the packet routing problem (output port selection in a node). We model the node routing problem as follows: a node has an arbitrary number of input ports and an arbitrary number of output queues. At each time unit, an arbitrary number of new packets may arrive, each packet is associated with a subset of the output ports (which correspond to the next edges on the allowed paths for the packet). Each output queue transmits packets in some arbitrary manner. Arrival and transmission are arbitrary and controlled by an adversary. The node routing algorithm has to route each packet to one of the allowed output ports, without exceeding the size of the queues. The goal is to maximize the number of the transmitted packets. In this paper, we show that all non-refusal algorithms are 2-competitive. Our main result is an almost optimal e/e-1 ≈1.58-competitive algorithm, for a large enough queue size. For packets with arbitrary values (allowing preemption) we present a 2-competitive algorithm for any queue size.

Original languageEnglish
Title of host publicationSTACS 2006
Subtitle of host publication23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Pages596-607
Number of pages12
DOIs
StatePublished - 2006
EventSTACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings - Marseille, France
Duration: 23 Feb 200625 Feb 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3884 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSTACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
Country/TerritoryFrance
CityMarseille
Period23/02/0625/02/06

Fingerprint

Dive into the research topics of 'Optimal node routing'. Together they form a unique fingerprint.

Cite this