Abstract
In this paper, we analyze the stability properties of the FIFO protocol in the Adversarial Queueing model for packet routing. We show a graph for which FIFO is stable for any adversary with injection rate r ≤ 0.1428. We generalize this results to show upper bounds for stability of any network under FIFO protocol, answering partially an open question raised by Andrews et al. in [2]. We also design a network and an adversary for which FIFO is non-stable for any r ≥ 0.8357, improving the previous known bounds of [2].
Original language | English (US) |
---|---|
Pages | 48-52 |
Number of pages | 5 |
DOIs | |
State | Published - 2001 |
Event | 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece Duration: Jul 3 2001 → Jul 6 2001 |
Conference
Conference | 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) |
---|---|
Country/Territory | Greece |
City | Crete Island |
Period | 7/3/01 → 7/6/01 |
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality