Abstract
A distinguishing feature of today’s large-scale platforms for distributed computation and communication, such as the Internet, is their heterogeneity, predominantly manifested by the fact that a wide variety of communication protocols are simultaneously running over different distributed hosts. A fundamental question that naturally poses itself for such common settings of heterogeneous distributed systems concerns their ability to preserve or restore an acceptable level of performance during link failures. In this work, we address this question for the specific case of stability properties of greedy, contention-resolution protocols operating over a packet-switched communication network that suffers from link slowdowns. We focus on the Adversarial Queueing Theory framework, where an adversary controls the rates of packet injections and determines packet paths. In addition, the power of the adversary is enhanced to include the manipulation of link slowdowns. Within this framework, we show that the composition of LIS (Longest-in-System) with any of SIS (Shortest-in-System), NTS (Nearest-to-Source) and FTG (Furthest-to-Go) protocols is unstable at rates ρ > 0 when the network size and the link slowdown take large values. These results represent the current record for instability bounds on injection rate for compositions of greedy protocols over dynamic adversarial models, and also suggest that the potential for instability incurred by the composition of two greedy protocols may be worse than that of some single protocol.
This research was co-funded by the European Union in the framework of the program “Pythagoras II” of the “Operational Program for Education and Initial Vocational Training” of the 3rd Community Support Framework of the Hellenic Ministry of Education, funded by national sources and the European Social Fund (ESF).
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.J., Díaz, J., Fernández, A., Serna, M.: Adversarial Models for Priority-Based Networks. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 142–151. Springer, Heidelberg (2003)
Alvarez, C., Blesa, M., Serna, M.: A Characterization of Universal Stability in the Adversarial Queuing model. SIAM Journal on Computing 34, 41–66 (2004)
Alvarez, C., Blesa, M., Serna, M.: The Impact of Failure Management on the Stability of Communication Networks. In: Proc. of the 10th Int’l Conference on Parallel and Distributed Systems, pp. 153–160 (2004)
Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal Stability Results for Greedy Contention-Resolution Protocols. Journal of the ACM 48, 39–69 (2001)
Barlow, R., Proschan, F.: Statistical Analysis of Reliability and LifeTesting Models. Holt, Rinehart and Winston, New York (1975)
Blesa, M., Calzada, D., Fernández, A., López, L., Martínez, A., Santos, A., Serna, M.: Adversarial Queueing Model for Continuous Network Dynamics. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 144–155. Springer, Heidelberg (2005)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial Queueing Theory. Journal of the ACM 48, 13–38 (2001)
Borodin, A., Ostrovsky, R., Rabani, Y.: Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. In: Proc. of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 601–610 (2001)
Clark, D.: The Design Philosophy of the DARPA Internet Protocols. ACM Computer Communication Reviews 18, 106–114 (1988)
Diaz, J., Koukopoulos, D., Nikoletseas, S., Serna, M., Spirakis, P., Thilikos, D.: Stability and Non-Stability of the FIFO Protocol. In: Proc. of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 48–52 (2001)
Floyd, S., Paxson, V.: Difficulties in Simulating the Internet. IEEE/ACM Transactions on Networking 9, 392–403 (2001)
Gary, J.: Why do computers stop and what can be done about it? In: Symposium on Reliability in Distributed Software and Database Systems (1986)
Herlihy, M.P., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. Proc. of the ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)
Koukopoulos, D.: The Impact of Dynamic Link Slowdowns on Network Stability. In: Proc. of the 8th Int’l Symposium on Parallel Architectures, Algorithms and Networks, pp. 340–345 (2005)
Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: On the Stability of Compositions of Universally Stable, Greedy, Contention-Resolution Protocols. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 88–102. Springer, Heidelberg (2002)
Koukopoulos, D., Mavronicolas, M., Nikoletseas, S., Spirakis, P.: The Impact of Network Structure on the Stability of Greedy Protocols. Theory of Computing Systems 38, 425–460 (2005)
Koukopoulos, D., Nikoletseas, S., Spirakis, P.: Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds.) HiPC 2001. LNCS, vol. 2228, pp. 3–14. Springer, Heidelberg (2001)
Koukopoulos, D., Mavronicolas, M., Spirakis, P.: Instability of Networks with Quasi-Static Link Capacities. In: Proc. of the 10th Int’l Colloquium on Structural Information and Communication Complexity, Carleton Scientific, pp. 179–194 (2003)
Lotker, Z., Patt-Shamir, B., Rosén, A.: New Stability Results for Adversarial Queuing. SIAM Journal on Computing 33, 286–303 (2004)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Tsaparas, P.: Stability in Adversarial Queueing Theory, M.Sc. Thesis, Computer Science Department, University of Toronto (1997)
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
Koukopoulos, D., Nikolopoulos, S.D. (2006). Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. 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_12
Download citation
DOI: https://doi.org/10.1007/11758471_12
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)