Distributed PLR-based backup path computation in MPLS networks

  • Authors:

  • Mohand Yazid Saidi;Bernard Cousin;Jean-Louis Le Roux

  • Affiliations:

  • Université de Rennes I, IRISA, INRIA, Rennes Cedex, France;Université de Rennes I, IRISA, INRIA, Rennes Cedex, France;France Télécom, Lannion, France

  • Venue:
  • NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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