Abstract
We consider the problem of precomputing constrained widest paths in a communication network. Precomputing and storing of all relevant paths minimizes the computational overhead required to determine an optimal path when a new connection request arrives. We present three algorithms that precompute paths with maximal bandwidth (widest paths), which in addition satisfy given end-to-end delay constraints. We analyze and compare the algorithms both in worst case and through simulations using a wide variety of networks.
Chapter PDF
Similar content being viewed by others
References
Claude Berge, Graphs, North-Holland Mathematical Library, 1991.
D. Blokh, G. Gutin, ”An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters”, IMADA preprint PP-1995–14, May 1995.
K. Deb, Multi-Objective Optimization using Evolutionary Algorithms, Wiley, 2001.
S. Chen, K. Nahrstedt, ”On Finding Multi-Constrained Paths”, in Proc. of IEEE International Conference on Communications (ICC’98), pp. 874–879, Atlanta, GA, June 1998.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Mc Graw Hill, 1990.
Yong Cui, Ke Xu, Jianping Wu, ”Precomputation for Multi-Constrained QoS Routing in High Speed Networks”, IEEE INFOCOM 2003.
L. Georgiadis, ”Bottleneck Multicast Trees in Linear Time”, to be published in IEEE Communications Letters.
R. Guerin, A. Orda, “Computing Shortest Paths for Any Number of Hops”, IEEE/ACM Transactions on Networking, vol. 10, no. 5, October 2002.
R. Guerin, A. Orda and Williams D., “QoS Routing Mechanisms and OSPF Extensions”, 2nd IEEE Global Internet Mini-Conference, Phoenix, AZ, November 1997.
T. Korkmaz, M. Krunz and S. Tragoudas, ”An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints”, Computer Communications Journal, vol. 25, no. 3, pp. 225–238, Feb. 2002.
K. Mehlhorn, S. Naher, Leda:A Platform for Combinatorial and Geometric Computing, Cambridge University Press, 2000.
P. Van Mieghem, H. De Neve and F.A. Kuipers, “Hop-by-hop Quality of Service Routing”, Computer Networks, vol. 37/3–4, pp. 407–423, November 2001.
P. Narvaez, Kai-Yeung Siu, and Hong-Yi Tzeng, “New Dynamic Algorithms for Shortest Path Tree Computation“, IEEE/A CM Transactions on Networking, vol. 8, no. 6, December 2000.
A. Orda and A. Sprintson, “QoS Routing: The Precomputation Perspective”, IEEE INFOCOM 2000, vol. 1, pp. 128–136, 2000.
J. L. Sobrino, “Algebra and Algorithms for QoS Path Computation and Hop-by-Hop Routing in the Internet”, IEEE INFOCOM 2001, Anchorage, Alaska, April 22–26, 2001.
A. Orda and A. Sprintson, “A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast”, IEEE INFOCOM 2002.
S. Siachalou, L. Georgiadis, “Efficient QoS Routing”, Computer Networks Journal,vol.43/3, pp 351–367, October 2003.
The Power Law Simulator, http://www.cs.bu.edu/brite.
The Real Networks, http://moat.nlanr.net/Routing/raw-data.
http://genesis.ee.auth.gr/georgiadis/english/public/networking04full.pdf
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
Siachalou, S., Georgiadis, L. (2004). Precomputation of Constrained Widest Paths in Communication Networks. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive