Better deterministic online packet routing on grids

Guy Even, Moti Medina, Boaz Patt-Shamir

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

6 Scopus citations


We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as many packets as possible to their destination. Our main result is an O (log n)-competitive deterministic algorithm for an n-node uni-directional line network (i.e., 1-dimensional grid), requiring only that buffers can store at least 5 packets, and that links can deliver at least 5 packets per step. We note that O(log n) is the best ratio known, even for randomized algorithms, even when allowed large buffers and wide links. The best previous deterministic algorithm for this problem with constant-size buffers and constant-capacity links was O(log5 n)-competitive. Our algorithm works like admission-control algorithms in the sense that if a packet is not dropped immediately upon arrival, then it is "accepted" and guaranteed to be delivered. We also show how to extend our algorithm to a polylog-competitive algorithm for any constant-dimension uni-directional grid.

Original languageEnglish
Title of host publicationSPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)9781450335881
StatePublished - 13 Jun 2015
Externally publishedYes
Event27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 - Portland, United States
Duration: 13 Jun 201515 Jun 2015

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures


Conference27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015
Country/TerritoryUnited States


  • Admission control
  • Bounded buffers
  • Grid networks
  • Online algorithms
  • Packet routing


Dive into the research topics of 'Better deterministic online packet routing on grids'. Together they form a unique fingerprint.

Cite this