Abstract
We present a novel distributed algorithm which provides QoS by only enabling free-of-cycles routes which are known to ensure network stability. Network stability is synonymous of QoS as allows to deterministically bound maximum delays and backlogs. Cycles are avoided by disabling the use of pair of input-output links around a node (turns). This method improves network utilization compared to previous solutions, which avoids cycles by forbidding the use of whole links.
The algorithm can be applied in joint with any routing algorithm as does not require knowledge of the whole network topology, reducing the communication overhead compared to centralized approaches.
The performance of the proposed algorithm has been compared against a centralized optimization solution. Even though the centralized solution exhibits a lower percentage of prohibited turns, the difference is quite moderate. We have also shown how our protocol can be enhanced to be able to tolerate fail-stop node crashes without the necessity of having to start from the beginning.
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
Andrews, M., Awerbuch, B., Fernandez, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contentionresolution protocols. Journal of the ACM, 39–69 (2001)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queueing theory. Journal of the ACM, 13–38 (2001)
Bhattacharjee, R., Goel, A.: Instability of fifo arbitrarily low rates in the adversarial queueing model. Technical Report Technical Report No. 02–776, Department of Computer Science, University of Southern California (2002)
Koukopoulos, D., Mavronicolas, M., Spirakis, P.: Fifo is unstable at arbitrarily low rates (even in planar networks). Technical Report Revision 1 of ECCC Report TR03–016, Electronic Colloquium on Computational Complexity (2003)
Echagüe, J., Cholvi, V., Fernández., A.: Universal stability results for low rate adversaries in packet switched networks. IEEE Communication Letters 7 (2003)
Andrews, M.: Instability of FIFO in session-oriented networks. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, N.Y., pp. 440–447. ACM Press, New York (2000)
Cruz, R.: A calculus for network delay. Parts i and ii. IEEE Trans. Inform. Theory 37-1, 114–131 & 131–141 (1991)
Shoreder, M.: Autonet: A high-spedd, self-configuring local area network using point-to-point links. IEEE JSAC 9, 1318–1335 (1991)
Starobinski, D., Karpovsky, M., Zakrevski, L.A.: Application of network calculus to general topologies using turn-prohibition. IEEE/ACM Transactions on Networking (TON) 11, 411–421 (2003)
Tel, G.: Introduction to Distributed Algorithms. Ed. Cambridge Press, Cambridge (1994)
Ken Calvert, M.D., Zegura, E.W.: Modeling internet topology. IEEE Communications Magazine (1997)
Ellen, W., Zegura, K.C., Donahoo, M.J.: A quantitative comparison of graph-based models for internet topology. IEEE/ACM Transactions on Networking (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Echagüe, J., Prieto, M., Villadangos, J., Cholvi, V. (2004). A Distributed Algorithm to Provide QoS by Avoiding Cycles in Routes. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-30193-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23238-4
Online ISBN: 978-3-540-30193-6
eBook Packages: Springer Book Archive