(Created page with " == 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 a...") |
m (Scipediacontent moved page Draft Content 305207058 to Tommasi et al 2013a) |
(No difference)
| |
Revision as of 14:08, 14 October 2020
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
Full document
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2013
Volume 2013, 2013
DOI: 10.1007/978-0-387-35620-4_22
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?