Online packet-routing in grids with bounded buffers

Guy Even, Moti Medina

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

4 Scopus citations

Abstract

We present the first online algorithm with a polylogarithmic competitive ratio for the problem of online routing of packets in unidirectional grids. The goal is to maximize the throughput, i.e., the number of delivered packets. Our online algorithm is deterministic, centralized, handles packets with deadlines, allows bounded buffers, uses adaptive routing, and may drop packets before they reach their destination. All previous online algorithms for packet routing on a unidirectional line with polylogarithmic competitive ratios are randomized [AZ05, AKK09, EM10]. Our algorithm is the first deterministic online algorithm with a polylogarithmic competitive ratio.

Original languageEnglish
Title of host publicationSPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures
Pages215-224
Number of pages10
DOIs
StatePublished - 1 Jul 2011
Externally publishedYes
Event23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11 - San Jose, CA, United States
Duration: 4 Jun 20116 Jun 2011

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11
Country/TerritoryUnited States
CitySan Jose, CA
Period4/06/116/06/11

Keywords

  • admission control
  • bounded buffers
  • online algorithms
  • packet routing

Fingerprint

Dive into the research topics of 'Online packet-routing in grids with bounded buffers'. Together they form a unique fingerprint.

Cite this