Stability and non-stability of the FIFO protocol

  • Authors:
  • Josep Díaz;Dimitrios Koukopoulos;Sotiris Nikoletseas;Maria Serna;Paul Spirakis;Dimitrios M. Thilikos

  • Affiliations:
  • Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3, 08034-Barcelona;Computer Technology Institute and Patras University, P.O. Box 1122-26 110, Patras;Computer Technology Institute and Patras University, P.O. Box 1122-26 110, Patras;Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona Salgado 1-3, 08034-Barcelona;Computer Technology Institute and Patras University, P.O.Box 1122-26 110, Patras;Departament de Llenguatges i Sistemes Informàtics, Universitat Polit`ecnica de Catalunya, Jordi Girona Salgado 1-3, 08034-Barcelona

  • Venue:
  • Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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 bound 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].