Latest revision as of 17:05, 21 January 2021

Abstract

Constraint-based routing (CR-LDP) extends the features of MPLS Label Distribution Protocol (LDP) working in conjunction with a wide variety of QoS scenarios and services including IP differentiated services, integrated services, traffic engineering, Asynchronous Transfer Mode (ATM) service classes and frame relay. When a large number of CR-LSPs are required a lot of CR-LDP signalling is needed: this paper proposes two techniques — caching and aggregation — to reduce the number of CR-LDP messages by dynamically increasing the number of flows served by each single CR-LSP. The results of a simulation are also used to discuss the performance of such mechanisms.

Original document

The different versions of the original document can be found in:

• https://link.springer.com/content/pdf/10.1007%2F978-0-387-35620-4_22.pdf

• http://link.springer.com/content/pdf/10.1007/978-0-387-35620-4_22,

http://dx.doi.org/10.1007/978-0-387-35620-4_22 under the license http://www.springer.com/tdm

• https://link.springer.com/chapter/10.1007/978-0-387-35620-4_22,

https://www.scipedia.com/public/Tommasi_et_al_2013a,

https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2002.html#TommasiMT02,

https://www.researchgate.net/profile/Franco_Tommasi/publication/2898155_Improvement_of_performance_in_MPLS_domains_by_Using_Caching_and_Aggregation_of_CR-LSP/links/0deec5203d6308d7c5000000.pdf?origin=publication_detail,

https://academic.microsoft.com/#/detail/1541542112