New stability results for adversarial queuing

Zvi Lotker, Boaz Patt-Shamir, Adi Rosén

Research output: Contribution to conferencePaperpeer-review

Abstract

We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [6]. We show that the scheduling protocol First-In-First-Out (FIFO) can be unstable at any injection rate larger than 1/2, and that it is always stable if the injection rate is no more than 1/d, where d is the length of the longest route used by any packet. We further show that every work-conserving (i.e., greedy) scheduling policy is stable if the injection rate is no more than 1/(d+1).

Original languageEnglish
Pages192-199
Number of pages8
DOIs
StatePublished - 2002
EventFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada
Duration: 10 Aug 200213 Aug 2002

Conference

ConferenceFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures
Country/TerritoryCanada
CityWinnipeg, MAN.
Period10/08/0213/08/02

Keywords

  • Adversarial queuing theory

Fingerprint

Dive into the research topics of 'New stability results for adversarial queuing'. Together they form a unique fingerprint.

Cite this