Distributed PLR-Based Backup Path Computation in MPLS Networks - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Distributed PLR-Based Backup Path Computation in MPLS Networks

Résumé

In this article, we provide mechanisms enabling the backup path computation to be performed on-line and locally by the Points of Local Repair (PLRs), in the context of the MPLS-TE fast reroute. To achieve a high degree of bandwidth sharing, the Backup Path Computation Entities (BPCEs), running on PLRs, require the knowledge and maintenance of a great quantity of bandwidth information (non aggre-gated link information or per path information) which is undesirable in distributed environments. To get around this problem, we propose a distributed PLR (Point of Local Repair)-based heuristic (DPLRH) which aggregates and noticeably decreases the size of the bandwidth information advertised in the network while maintaining the bandwidth sharing high. DPLRH is scalable, easy to be deployed and balances equitably computations on the network routers. Simulations show that with the transmission of a small quantity of aggregated information per link, the ratio of rejected backup paths is low and close to the ideal.
Fichier principal
Vignette du fichier
IFIP_SAIDI.pdf (467.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01184150 , version 1 (16-02-2016)

Identifiants

Citer

Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux. Distributed PLR-Based Backup Path Computation in MPLS Networks. 7th International IFIP-TC6 Networking Conference, May 2008, Singapour, Singapore. pp.642-653, ⟨10.1007/978-3-540-79549-0_56⟩. ⟨hal-01184150⟩
396 Consultations
169 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More