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. Document type: Part of book or chapter of book