Abstract
In this paper, we investigate and analyze the stability properties of heterogeneous networks, which use a combination of different universally stable queueing policies for packet routing, in the Adversarial Queueing model. We interestingly prove that the combination of SIS and LIS policies, LIS and NTS policies, and LIS and FTG policies leads to instability for specific networks and injection rates that are presented. It is also proved that the combination of SIS and FTG policies, SIS and NTS policies, and FTG and NTS policies is universally stable. Furthermore, we prove that FIFOis non-stable for any r ≥ 0.749, improving significantly the previous best known bounds of [2],[10], by using new techniques for adversary construction and tight analysis of the packet flow time evolution. We also show a graph for which FIFOis stable for any adversary with injection rate r≤0.1428, and, by generalizing, we present upper bounds for stability of any network under the FIFOprotocol, answering partially an open question raised by Andrews et al. in [2]. The work presented here combines new and recent results of the authors.
The work of all the authors was partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT)
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
M. Andrews. Instability of FIFOin session-oriented networks. In 11th. ACMSIAMSymposium on Discrete Algorithms (SODA 2000), pages 440–447, 2000.
M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton, and Z. Liu.Universal stability results for greedy contention-resolution protocols. Journal ofthe ACM, 48(1):39–69, January 2001.
A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Williamson. Adversarialqueueing theory. Journal of the ACM, 48(1):13–38, January 2001.
M. Bramson. Instability of FIFOqueuing networks. Annals of Applied Probability,4:414–431, 1994.
M. Bramson. Instability of FIFOqueueing networks with quick service times.Annals of Applied Probability, 4(3):693–718, 1994.
R. Cruz. A calculus for network delay. Part I: Network elements in isolation. IEEE Transactions on Information Theory, 37:114–131), 1991.
R. Cruz. A calculus for network delay. Part II: Network analysis. IEEE Transactionson Information Theory, 37:132–141, 1991.
D. Gamarnik. Stability of adversarial queues via models. In 39th. IEEE Symposiumon Foundations of Computer Science (FOCS 1998), pages 60–76,1998.
A. Goel. Stability of networks and protocols in the adversarial queueing modelfor packet routing. In the 10th ACM-SIAM Symposium on Discrete Algorithms(SODA 1999) (short abstract), pages 315–324, 1999. Accepted for publication in Networks.
J. Diaz, D. Koukopoulos, S. Nikoletseas, M. Serna, P. Spirakis and D. Thilikos.Stability and non-stability of the FIFOproto col. In Proc. of the 13th AnnualACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pages48–52, Crete, Greece, July 2001.
D. Koukopoulos, S. Nikoletseas and P. Spirakis. Stability Issues in Heterogeneousand FIFONet works under the Adversarial Queueing Model (full paper), CTI Technical Report, July 2001, available at http://www.cti.gr/RD1/nikole/stability.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koukopoulos, D.K., Nikoletseas, S.E., Spirakis, P.G. (2001). Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-45307-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43009-4
Online ISBN: 978-3-540-45307-9
eBook Packages: Springer Book Archive