Abstract
FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FIFO protocol, even at arbitrarily low rate. On the other hand there are networks that are universally stable, i.e., they are stable under every greedy protocol at any rate r < 1.
The question as to which networks are stable under the FIFO protocol arises naturally. We offer the first polynomial time algorithm for deciding FIFO stability and simple-path FIFO stability of a directed network, answering an open question posed in [1, 4]. It turns out, that there are networks, that are FIFO stable but not universally stable, hence FIFO is not a worst case protocol in this sense. Our characterization of FIFO stability is constructive and disproves an open characterization in [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Àlvarez, C., Blesa, M., Serna, M.: A Characterization of Universal Stability in the Adversarial Queuing Model. SIAM J. Comput. 34(1), 41–66 (2004)
Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z.: Universal-Stability Results and Performance Bounds for Greedy Contention-Resolution Protocols. Journal of the ACM 48(1), 39–69 (2001)
Bhattacharjee, R., Goel, A.: Instability of FIFO at arbitrarily low rates in the adversarial queueing model. In: Proc. of the 44th Symposium on Foundations of Computer Science, pp. 160–167 (2003)
Blesa, M.J.: Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 429–441. Springer, Heidelberg (2005)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queueing theory. J. of the ACM 48(1), 13–38 (2001)
Koukopoulos, D., Mavronicolas, M., Spirakis, P.: FIFO is Unstable at Arbitrarily Low Rates (Even in Planar Networks). Electronic Colloq. on Computational Complexity (2003)
Weinard, M.: Deciding the FIFO Stability of Networks in Polynomial Time (full version), Technical report: Frankfurter Informatik-Berichte, No 3/2005, ISSN 1616-9107
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weinard, M. (2006). Deciding the FIFO Stability of Networks in Polynomial Time. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_11
Download citation
DOI: https://doi.org/10.1007/11758471_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)