Abstract
MPLS can be used to provide network robustness to faults through path protection techniques. In this paper we present a dynamic model supporting different classes of end-to-end protection, including protection against Single Fault and Dual Fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against Shared Risk Link Group (SLRG) failure. An interesting feature of the proposed scheme is the ability to offer service differentiation with respect to the recovery probability, by coupling the differentiation on the number of backup paths with bandwidth assignment policy. In this paper we describe the underlying algorithms for route selection and backup bandwidth sharing. The route selection is based on explicit load-dependent routing of service and backup paths. We show by simulation that the proposed route selection algorithm is effective in improving the network utilization. We discuss two alternative implementations of our model: distributed and partially centralized. The primary concern with the distributed approach is the message overhead implied by link-load dissemination, e.g. by flooding. However we show by simulation that message overhead can be taken under control by adopting a well-tuned adaptive overhead reduction algorithm. Our conclusion is that both distributed and partially-centralized implementation are feasible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Luciani et al., IP over Optical Networks A Framework, Internet Draft, Work in progress, http://draft-ietf-ipo-framework-03.txt.
D. Zhou, S. Subramaniam, “Survivability in Optical Networks”, IEEE Network, Dec. 2000.
K. Kompella et al. “OSPF Extensions in Support of Generalized MPLS”, http://draft-ietf-ccamp-ospf-gmpls-extensions-07.txt>, work in progress.
F. Ricciato “An Architecture for Dynamic Differentiated End-to-End Protection for Connection-oriented Networks”, CoRiTeL report (available at ftp://ftp.coritel.it/pub/Publications/DynamicDifferentiated.pdf).
J. W. Suurballe, R. E. Tarjan. A Quick Method for Finding ShortestPairs of Disjoint Paths. Networks, 14:325–336, 1984
G. Ellinas, E. Bouillet, R. Ramamurthy, J.F. Labourdette, S. Chaudhuri, K. Bala “Routing and Restoration Architectures in Mesh Optical Networks”, to appear in Optical Networks Magazine.
A. Shaikh, J. Rexford, K. G. Shin, “Evaluating the Overheads of Source-Directed Quality-of-Service Routing”, Proceedings of IEEE International Conference on Network Protocols, October 1998.
R. R. Irashko, W. D. Grover, M. H. MacGregor, “Optimal Capacity Placement for Path Restoration in STM or ATM Mesh-Survivable Networks”, IEEE/ACM Transactions on Networking, June 1998.
A. Botta, M. Intermite, P. Iovanna, S. Salsano, “Traffic Engineering with OSPF-TE and RSVP-TE: flooding reduction techniques and evaluation of processing cost”, CoRiTeL report, available at ftp://ftp.coritel.it/pub/Publications/thresholds.pdf.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ricciato, F., Listanti, M., Belmonte, A., Perla, D. (2003). Performance Evaluation of a Distributed Scheme for Protection against Single and Double Faults for MPLS. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive