Tommasi et al 2013a - Revision history

Scipediacontent at 15:05, 21 January 2021

2021-01-21T15:05:12Z

Scipediacontent: Scipediacontent moved page Draft Content 305207058 to Tommasi et al 2013a

2020-10-14T12:08:23Z

Scipediacontent moved page Draft Content 305207058 to Tommasi et al 2013a

Scipediacontent: 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..."

2020-10-14T12:08:20Z

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..."

New page

== 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 ==
<pdf>Media:Draft_Content_305207058-beopen471-7829-document.pdf</pdf>

== 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 https://link.springer.com/content/pdf/10.1007%2F978-0-387-35620-4_22.pdf]

@@ Line 2: / Line 2: @@
 == 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.
+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 ==
-<pdf>Media:Draft_Content_305207058-beopen471-7829-document.pdf</pdf>
@@ Line 15: / Line 10: @@
 * [https://link.springer.com/content/pdf/10.1007%2F978-0-387-35620-4_22.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-35620-4_22.pdf]

← Older revision	Revision as of 12:08, 14 October 2020
(No difference)