An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An optimal service policy for buffer systems
Journal of the ACM (JACM)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of Algorithms - Special issue on SODA '95 papers
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the performance of greedy algorithms in packet buffering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Polynomial end-to-end communication
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On-line bipartite matching made simple
ACM SIGACT News
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
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 $\frac{e}{e-1} \approx 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.