Abstract
Many network routing situations commonly require backup paths that satisfy various constraints on bandwidth, link or node selection, and ease of configuration. In this paper, we attempt to validate whether it is beneficial to have distinct algorithmic treatments of normal and backup path calculation, configuration, and maintenance. We present a modular suite of algorithms that enable us to manage normal and protection paths differently. In the process, we develop a simple extension of Minimum Interference Routing Algorithm for shared protection paths. We incorporate a distributed algorithm to separately calculate normal and backup paths in the network, using link state information, and present an evaluation of asynchronous dynamic reorganization of backup paths to reduce congestion in the network. Simulations demonstrate nontrivial quantitative reductions in blocking probabilities under certain conditions. We conclude that in order to choose an optimal algorithm for a protected QoS routing application, it is recommended to also consider a combination of two different algorithms for normal and backup paths.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Awduche, J. Malcom, J. Agogbua, M. O’Dell, and J. McManus, Requirements for Traffic Engineering over MPLS, RFC 2702, September 1999.
L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, RSVP: A New Resource Reservation Protocol, IEEE Communications Magazine, Vol. 31, No. 9, pp. 8–18, September 1993.
R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufman, San Francisco, 1998.
D. Bertsekas and R. Gallager, Data Networks, 2nd edn., Prentice-Hall, Englewood Cliffs, NJ, 1992.
J. Walrand and P. Varaiya, High-Performance Communication Networks, 2nd edn., Morgan-Kaufman, 2000.
E. Karasan and E. Ayanoglu, Effects of Wavelength Routing and Selection Algorithms on Wavelength Conversion Gain in WDN Optical Networks, IEEE/ACM Transactions on Networking, Vol. 6, No. 2, pp. 186–197, April 1998.
E. W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, Vol. 1, No. 269–271, 1959.
M. Kodialam and T. Lakshman, Minimum Interference Routing with Applications to MPLS Traffic Engineering, Proceedings IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
M. Kodialam and T. Lakshman, Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration, Proceedings IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
Y. Liu, D. Tipper, and P. Siripongwutikorn, Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing, Proceedings IEEE INFOCOM 2001, Anchorage, Alaska, USA, April 2001.
C. Qiao and D. Xu, Distributed Partial Information Management (DPIM) Schemes for Survivable Networks – Part I, Proceedings IEEE INFOCOM 2002, New York, New York, USA, June 2002.
R. Gupta, E. Chi, and J. Walrand, Sharing Normal Bandwidth During a Failure, Proceedings Seventh INFORMS Telecommunications Conference 2004, Boca Raton, Florida, USA, March 2004.
J. Moy. OSPF Version 2. RFC 1583, March 1994.
Y. Rekhter and T. Li, A Border Gateway Protocol 4 (bgp-4), RFC 1771, March 1995.
E. Bouillet, P. Mishra, J. F. Labourdette, K. Perlove, and S. French, Lightpath Re-optimization in Mesh Optical Networks, Proceedings 7th European Conference on Networks & Optical Communications (NOC 2002), Darmstadt, Germany, June 2002.
P. Charalambous, C. Dennis, G. Ellinas, E. Bouillet, J. F. Labourdette, S. Chaudburi, M. Mo-rokhovich, and D. Shales, Dynegy’s National Long-haul Optical Mesh Network Utilizing Intelligent Optical Switches, IEEE/LEOS Annual Meeting Conference Proceedings, Piscataway, NJ, USA, 2002.
UC Berkeley EECS 290Q Course website (Fall 2001): http://photonics.eecs.berkeley.edu/ee290q/jls/JLS%200911.pdf, Slide 37.
AT & T CERFnet OC/12 Network Backbone website: http://www.cerf.net/about/Bbone-map.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Rajarshi Gupta is a PhD candidate in Electrical Engineering and Computer Sciences at the University of California at Berkeley and will graduate in May 2005. Prior to this, he completed hisMS degree in 1999 at Berkeley and his BS degree in 1997 from the University of Maryland. From 1999 to 2003, Rajarshi worked with Extreme Networks as a Senior Designer, where he has been the author of 8 patents. He is interested in algorithms to ensure quality in networks–both wired and ad-hoc. This includes: analysis of network capacity; switching and scheduling mechanisms for efficient utilization of resources; and, routing algorithms to guarantee quality of service.
Eric Chi received his MS degree in Electrical Engineering and Computer Sciences from the University of California at Berkeley in 2001 and his BAdegree in physics in 1999 from Rice University. Hiswork focused on distributed network capacity management.He hasworked on inventory restocking problems and protection path resource allocation in wired communication networks.
Jean Walrand received the PhD degree from the Department of Electrical Engineering and Computer Sciences of the University of California at Berkeley where he is now Professor. His research interests include decision theory, stochastic processes, and communication networks. He is the author of An Introduction to Queueing Networks (Prentice Hall, 1988) and of Communication Networks: A First Course (2nd ed. McGraw-Hill, 1998) and coauthor of High-Performance Communication Networks (2nd ed, Morgan Kaufman, 2000). He is a Fellow of the Belgian American Education Foundation and of the IEEE and a recipient of the Lanchester Prize and of the Stephen O. Rice Prize.
Rights and permissions
About this article
Cite this article
Gupta, R., Chi, E. & Walrand, J. Different Algorithms for Normal and Protection Paths. J Netw Syst Manage 13, 13–33 (2005). https://doi.org/10.1007/s10922-005-1845-6
Issue Date:
DOI: https://doi.org/10.1007/s10922-005-1845-6