A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing

This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is designed to protect traffic with strong delay requirements such as EF (Expedited Forwarding) ordered aggregates in a DiffServ domain. Indeed, for this type of application, we need fast restoration in case of failure. The duplication of all the packets in a 1+1 end-toend restoration scheme consumes a large amount of bandwidth. Furthermore, end-to-end recovery with bandwidth sharing schemes are usually considered to be far too slow. Local fast-rerouting is a solution which can compete with restoration times and bandwidth consumption offered by SONET self-healing rings. Our scheme includes a sophisticated resource aggregation mechanism based on the concepts of "backup-backup aggregation" and "backup-primary aggregation". The path selection algorithm is also designed to efficiently reduce the ...

• Type: Journal
• Year: 2006
• Where: CN
• Authors: Simon Balon, Laurent Mélon, Guy Leduc
• Keywords: Backup-primary Aggregation, CN 2006, Sophisticated Resource Aggregation, Strong Delay Requirements