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 number of CR-LSPs are required a lot of CR- LDP signalling is needed: this paper proposes then 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. A simulation is also used to discuss the performance of such mechanisms.

Improvement of performance in MPLS domains by using Caching and Aggregation of CR-LSP

TOMMASI, Francesco;MOLENDINI, Simone;TRICCO, ANDREA
2002-01-01

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 number of CR-LSPs are required a lot of CR- LDP signalling is needed: this paper proposes then 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. A simulation is also used to discuss the performance of such mechanisms.
2002
1402072686
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11587/368737
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact