research-article

Instability of FIFO in the permanent sessions model at arbitrarily small network loads

Author:

Matthew AndrewsAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 5, Issue 3

Article No.: 33, Pages 1 - 29

https://doi.org/10.1145/1541885.1541894

Published: 04 July 2009 Publication History

Get Access

Abstract

We show that for any r > 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that:

—The network load is r with respect to the permanent sessions model with bounded arrivals.

—The network can be made unstable.

References

[1]

]]Alvarez, C., Blesa, M., and Serna, M. 2004. A characterization of universal stability in the adversarial queueing model. SIAM J. Comput. 34, 1, 41--66.

Digital Library

Google Scholar

[2]

]]Andrews, M. 2004. Instability of FIFO in session-oriented networks. J. Algor. 50, 2, 232--245.

Digital Library

Google Scholar

[3]

]]Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., and Liu, Z. 2001. Universal stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48, 1, 39--69.

Digital Library

Google Scholar

[4]

]]Andrews, M., Fernández, A., Harchol-Balter, M., Leighton, T., and Zhang, L. 2000. General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate). SIAM J. Comput. 30, 5, 1594--1623.

Digital Library

Google Scholar

[5]

]]Bhattacharjee, R., Goel, A., and Lotker, Z. 2004. Instability of FIFO at arbitrarily low rates in the adversarial queueing model. SIAM J. Comput. 34, 2, 318--332.

Digital Library

Google Scholar

[6]

]]Boudec, J.-Y. L., and Thiran, P. 2001. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer.

Digital Library

Google Scholar

[7]

]]Bramson, M. 1994a. Instability of FIFO queueing networks. Ann. Appl. Probab. 4, 2, 414--431.

Crossref

Google Scholar

[8]

]]Bramson, M. 1994b. Instability of FIFO queueing networks with quick service times. Ann. Appl. Probab. 4, 3, 693--718.

Crossref

Google Scholar

[9]

]]Bramson, M. 1996. Convergence to equilibria for fluid models of FIFO queueing networks. Queue. Syst. 22, 5--45.

Google Scholar

[10]

]]Charny, A., and Boudec, J.-Y. L. 2000. Delay bounds in a network with aggregate scheduling. In Proceedings of the 1st International Workshop on Quality of Future Internet Services.

Digital Library

Google Scholar

[11]

]]Clark, D., Shenker, S., and Zhang, L. 1992. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In Proceedings of ACM SIGCOMM. 14--26.

Digital Library

Google Scholar

[12]

]]Cruz, R. L. 1991. A calculus for network delay, Part II: Network analysis. IEEE Trans. Inf. Theory 37, 132--141.

Digital Library

Google Scholar

[13]

]]Diaz, J., Koukopoulos, D., Nikoletseas, S., Serna, M., Spirakis, P., and Thilikos, D. 2001. Stability and nonstability of the FIFO protocol. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures. 48--52.

Digital Library

Google Scholar

[14]

]]Echague, J., Cholvi, V., and Fernandez, A. 2003. Universal stability results for low rate adversaries in packet switched networks. IEEE Commun. Lett. 7, 12.

Crossref

Google Scholar

[15]

]]Elwalid, A., and Mitra, D. 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proceedings of IEEE INFOCOM, 1220--1230.

Google Scholar

[16]

]]Gamarnik, D. 1998. Stability of adversarial queues via fluid models. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. 60--70.

Digital Library

Google Scholar

[17]

]]Georgiadis, L., Guérin, R., and Parekh, A. 1997. Optimal multiplexing on a single link: Delay and buffer requirements. IEEE Trans. Inf. Theory 43, 5, 1518--1535.

Digital Library

Google Scholar

[18]

]]Georgiadis, L., Guérin, R., Peris, V., and Sivarajan, K. 1996. Efficient network QoS provisioning based on per node traffic shaping. In Proceedings of IEEE INFOCOM, 102--110.

Digital Library

Google Scholar

[19]

]]Koupoulos, D., Nikoletseas, N., and Spirakis, P. 2001. The range of stability for heterogeneous and FIFO queueing networks. In Electronic Colloquium on Computational Complexity.

Google Scholar

[20]

]]Liebeherr, J., Wrege, D., and Ferrari, D. 1996. Exact admission control for networks with a bounded delay service. IEEE/ACM Trans. Netw. 4, 6, 885--901.

Digital Library

Google Scholar

[21]

]]Lotker, Z., Patt-Shamir, B., and Rosen, A. 2002. New stability results for adversarial queueing. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures. 192--199.

Digital Library

Google Scholar

[22]

]]Parekh, A. K., and Gallager, R. G. 1994. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Trans. Netw. 2, 2, 137--150.

Digital Library

Google Scholar

[23]

]]Seidman, T. I. 1994. ‘First come, first served’ can be unstable&excl; IEEE Trans. Autom. Control 39, 2166--2171.

Crossref

Google Scholar

[24]

]]Stiliadis, D. 1996. Traffic scheduling in packet-switched networks: Analysis design and implementation. Ph.D. thesis, UCSC.

Digital Library

Google Scholar

[25]

]]Wrege, D., and Liebeherr, J. 1997. A near-optimal packet scheduler for QoS networks. In Proceedings of IEEE INFOCOM.

Digital Library

Google Scholar

[26]

]]Zhang, H. 1995. Service disciplines for guaranteed performance service in packet-switching networks. Proc. IEEE.

Crossref

Google Scholar

[27]

]]Zhang, Z.-L., Duan, Z., and Hou, T. 2001. Fundamental tradeoffs in aggregate packet scheduling. In Proceedings of the 9th International Conference on Network Protocols.

Digital Library

Google Scholar

Cited By

View all

Joung JKwon JRyoo JCheung T(2022)Asynchronous Deterministic Network Based on the DiffServ ArchitectureIEEE Access10.1109/ACCESS.2022.314639810(15068-15083)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3146398
Thomas LLe Boudec J(2020)On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal ClocksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33921454:2(1-41)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3392145
Thomas LLe Boudec JMifdaoui A(2019)On Cyclic Dependencies and Regulators in Time-Sensitive Networks2019 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS46320.2019.00035(299-311)Online publication date: Dec-2019
https://doi.org/10.1109/RTSS46320.2019.00035
Show More Cited By

Index Terms

Instability of FIFO in the permanent sessions model at arbitrarily small network loads

Recommendations

Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

We show that for any r > 0, there is a network of First-In-First-Out servers and a fixed set of sessions such that,

• The network load is r with respect to the Permanent Sessions Model with Bounded Arrivals.

• The network can be made unstable.
Stability of FIFO networks under adversarial models: State of the art

Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs for an arbitrarily length of time, no server will suffer an unbounded ...
Instability of FIFO in a simple queueing system with arbitrarily low loads

We show, using a simple example, that the First-In-First-Out (FIFO) policy can be unstable in a system with arbitrarily low load. Our proof is based on the observation that the special structure of the example we use allows us to establish stability ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 5, Issue 3

July 2009

222 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1541885

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 July 2009

Accepted: 01 March 2008

Received: 01 February 2007

Published in TALG Volume 5, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Joung JKwon JRyoo JCheung T(2022)Asynchronous Deterministic Network Based on the DiffServ ArchitectureIEEE Access10.1109/ACCESS.2022.314639810(15068-15083)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3146398
Thomas LLe Boudec J(2020)On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal ClocksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33921454:2(1-41)Online publication date: 12-Jun-2020
https://dl.acm.org/doi/10.1145/3392145
Thomas LLe Boudec JMifdaoui A(2019)On Cyclic Dependencies and Regulators in Time-Sensitive Networks2019 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS46320.2019.00035(299-311)Online publication date: Dec-2019
https://doi.org/10.1109/RTSS46320.2019.00035
Koukopoulos D(2015)Stability in Heterogeneous Dynamic Multimedia NetworksAlgorithms, Probability, Networks, and Games10.1007/978-3-319-24024-4_16(261-280)Online publication date: 22-Nov-2015
https://doi.org/10.1007/978-3-319-24024-4_16
Antoniadis ABarcelo NCole DFox KMoseley BNugent MPruhs K(2014)Packet Forwarding Algorithms in a Line NetworkLATIN 2014: Theoretical Informatics10.1007/978-3-642-54423-1_53(610-621)Online publication date: 2014
https://doi.org/10.1007/978-3-642-54423-1_53
Koukopoulos D(2013)Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacksMathematical and Computer Modelling10.1016/j.mcm.2011.05.05657:11-12(2671-2684)Online publication date: Jun-2013
https://doi.org/10.1016/j.mcm.2011.05.056
Jayachandran PAndrews M(2010)Minimizing end-to-end delay in wireless networks using a coordinated EDF scheduleProceedings of the 29th conference on Information communications10.5555/1833515.1833774(1909-1917)Online publication date: 14-Mar-2010
https://dl.acm.org/doi/10.5555/1833515.1833774
Jayachandran PAndrews M(2010)Minimizing End-to-End Delay in Wireless Networks Using a Coordinated EDF Schedule2010 Proceedings IEEE INFOCOM10.1109/INFCOM.2010.5462012(1-9)Online publication date: Mar-2010
https://doi.org/10.1109/INFCOM.2010.5462012

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations