A hierarchical LSP management architecture for MPLS traffic engineering

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a scalable Label Switched Path (LSP) management architecture for Multiprotocol Label Switching (MPLS) traffic engineering using a hierarchical network model. MPLS introduces the concept of a label hierarchy to support scalability by lessening the complexity of transit routers for the computation of complete routing tables. However, this hierarchical network model creates a critical disadvantage in providing a globally-optimal route because of topology abstraction or aggregation. This paper proposes a hierarchical routing scheme that can provide a globally-optimal route in hierarchical MPLS networks using propagation from the Condensed Subordinate Route Information (CSRI). CSRI is summarized route information among border nodes in the lower layer network and is reflected in the process of the LSP path computation in the higher layer network. We also propose the algorithms for generation of CSRI, for reflection CSRI to higher layer network topology, and for computation of an optimal LSP in a higher layer. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Hong, D. W. K., Hong, C. S., & Yun, D. (2004). A hierarchical LSP management architecture for MPLS traffic engineering. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3090, 689–698. https://doi.org/10.1007/978-3-540-25978-7_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free