New stability results for adversarial queuing

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

doi:10.1145/564870.564904

New stability results for adversarial queuing

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

Research output: Contribution to conference › Paper › peer-review

13 Scopus citations

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 language	English
Pages	192-199
Number of pages	8
DOIs	https://doi.org/10.1145/564870.564904
State	Published - 2002
Externally published	Yes
Event	Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada Duration: 10 Aug 2002 → 13 Aug 2002

Conference

Conference	Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures
Country/Territory	Canada
City	Winnipeg, MAN.
Period	10/08/02 → 13/08/02

Keywords

Adversarial queuing theory

Access to Document

10.1145/564870.564904

Cite this

@conference{1b52b2db45a0411192dfd19df9d57f98,

title = "New stability results for adversarial queuing",

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).",

keywords = "Adversarial queuing theory",

author = "Zvi Lotker and Boaz Patt-Shamir and Adi Ros{\'e}n",

year = "2002",

doi = "10.1145/564870.564904",

language = "אנגלית",

pages = "192--199",

note = "Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures ; Conference date: 10-08-2002 Through 13-08-2002",

}

TY - CONF

T1 - New stability results for adversarial queuing

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Rosén, Adi

PY - 2002

Y1 - 2002

N2 - 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).

AB - 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).

KW - Adversarial queuing theory

UR - https://www.scopus.com/pages/publications/0036948640

U2 - 10.1145/564870.564904

DO - 10.1145/564870.564904

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0036948640

SP - 192

EP - 199

T2 - Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures

Y2 - 10 August 2002 through 13 August 2002

ER -

New stability results for adversarial queuing

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this