Targeted Distribution of Resource Allocation for Backup LSP Computation

Mohand Yazid Saidi (1) , Bernard Cousin (2, 1) , Jean-Louis Le Roux (3)

1 ATNET - Advanced Technolgy in Networking
2 UR - Université de Rennes
3 Orange Labs [Lannion]

Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence, share the bandwidth between such backup paths is central to optimize the bandwidth allocated in the network and to decrease the bandwidth wasting. In this paper, we propose a novel algorithm, based on Targeted Distribution of Resource Allocation (TDRA), to compute the backup Label Switched Paths (LSPs) in a distributed MultiProtocol Label Switching (MPLS) environment. Our algorithm is scalable, efficient and capable to protect against the three types of failure risk: node, link and Shared Risk Link Group (SRLG). Indeed, the TDRA algorithm decreases the quantity of information (resource or bandwidth allocation) transmitted in the network with the selection of nodes to be advertised (with the selection of recipient nodes). Furthermore, bandwidth availability is increased by sharing bandwidth between backup LSPs as long as possible. Simulations show that the ratio of rejected backup LSPs obtained with the transmission of a small quantity of information in the network is low.

Mots clés: local protection; Backup Label Switched Path (LSP); Shared Risk Link Group (SRLG); MPLS; bandwidth sharing; path computation; networking

Domaines: Réseaux et télécommunications [cs.NI]

Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux. Targeted Distribution of Resource Allocation for Backup LSP Computation. Seventh European Dependable Computing Conference (EDCC-7), May 2008, Kaunas, Lithuania. pp.69-78, ⟨10.1109/EDCC-7.2008.10⟩. ⟨hal-01184179⟩