Abstract
The rapid growth of real-time and multimedia traffic over IP networks makes not only QoS guarantees but also network survivability more critical. This paper proposes an efficient algorithm which supports end-to-end path-based connection restoration in MPLS networks. We review previous related work. This includes SPR (Shortest Path Restoration), PIR (Partial Information Restoration) and CIR (Complete Information Restoration). The objective of backup path selection algorithms is to minimize the total network bandwidth consumed due to backup paths. Backup path bandwidth usage can be reduced by sharing backup paths among disjoint service paths. In CIR, since a path selection algorithm uses per-LSP information, backup path sharing can be optimized. However, the large amount of information, which each node advertises and maintains, makes it impractical. In the case of PIR, some sharing of backup paths is possible while using the aggregated service bandwidth and backup bandwidth used on each link. We think it is reasonable to increase backup path sharing using aggregated information as with PIR. In this paper we propose an efficient backup path selection algorithm to outperform PIR while using aggregated information. Simulation results show that our algorithm uses less total backup bandwidth compared to PIR.
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
Li, G., Wang, D.: Efficient distributed path selection for shared restoration connections. In: IEEE INFOCOM (2002)
Norden, S., Buddhikot, M.M.: Routing bandwidth guaranteed paths with restoration label switched networks. In: ICNP (2001)
Kodialam, M., Lakshman, T.V.: Restorable dynamic quality of service routing. IEEE Communication Magazine (June 2002)
Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: IEEE INFOCOM (2000)
Sharma, V., Hellstrand, F.: Framework for MPLS-based recovery, July 2002. Internet Draft (2002)
Bhandari, R.: Survivable networks: algorithms for diverse routing. Kluwer Academic Publishers, Dordrecht (1999)
Qiao, C., Xu, D.: Distributed partial information management (DPIM) schemes for survivable networks. In: IEEE INFOCOM (2002)
Kodialam, M., Lakshman, T.V.: Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information. In: IEEE INFOCOM (2001)
Doverspike, R., Yates, J.: Challenges for MPLS in optical network restoration. IEEE Communication Magazine (February 2001)
Huang, C., Sharma, V.: Building reliable MPLS networks using a path protection mechanism. IEEE Communication Magazine (March 2002)
Iannaccone, G., Chuah, C.-N.: Analysis of link failures in an IP backbone. In: Internet Measurement Workshop (2002)
Autenrieth, A., Kirstadter, A.: RD-QoS: The integrated provisioning of resilience and QoS in MPLS-based networks. In: ICC (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeong, W., Kim, G., Kim, C. (2005). An Efficient Backup Path Selection Algorithm in MPLS Networks. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30573-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24557-5
Online ISBN: 978-3-540-30573-6
eBook Packages: Computer ScienceComputer Science (R0)