Abstract
Merging of Label Switched Paths (LSPs) saves label space and reduces processing time in routers. We introduce two distributed merging algorithms for online LSP merging.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture, IETF, RFC-3031 (January 2001)
Hummel, H., Grimminger, J.: Hierarchical LSP, IETF Internet Draft (March 2002) (work in progress), draft-hummel-mpls-hierarchical-lsp-00.txt
Lei, L., Sampalli, S.: Backward connection preemption in multiclass QoS-aware networks. In: Proceeding of 12th IEEE IWQOS, June 2004, pp. 153–160 (2004)
Saito, H., Miyao, Y., Yoshida, M.: Traffic Engineering using Multiple Multipoint-to-Point LSPs. In: Proceeding of IEEE INFOCOM 2000, March 2000, vol. 2, pp. 894–901 (2000)
Bhatnagar, S., Ganguly, S., Nath, B.: Creating Multipoint-to-point LSPs for Traffic Engineering. In: Proceeding of IEEE HPSR Workshop 2003, June 2003, pp. 201–207 (2003)
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
Lei, L., Sampalli, S. (2005). Distributed Online LSP Merging Algorithms for MPLS-TE. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_34
Download citation
DOI: https://doi.org/10.1007/11499169_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)