Article (Scientific journals)
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
Balon, Simon; Mélon, Laurent; Leduc, Guy
2006In Computer Networks, 50 (16), p. 3043-3063
Peer Reviewed verified by ORBi
 

Files


Full Text
SB-COMNET-Pre.pdf
Author preprint (344.61 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
fast recovery; resilience; protection; survivability; rerouting; MPLS; resource sharing; backup LSP
Abstract :
[en] 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-to-end 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 resource usage. Moreover, when considering LSPs at different preemption levels, our algorithm is able to correctly calculate the amount of bandwidth that can be preempted despite the sharing of resource. We show that our approach, though local, can compete with the state-of-the-art end-to-end recovery schemes in terms of resource consumption. The major contribution of our scheme, the "backup-primary aggregation", was then also used in the context of end-to-end recovery and improved its performance substantially. To be able to save a maximum amount of bandwidth in a decentralised implementation, the nodes that compute backup LSPs need to obtain a certain amount of link-state information. We propose a solution where the nodes learn almost all the information they need with RSVP messages. This drastically reduces the information that needs to be flooded in the whole network and is the first scalable decentralised solution capable of sharing a large amount of bandwidth. (c) 2005 Elsevier B.V. All rights reserved.
Disciplines :
Computer science
Author, co-author :
Balon, Simon ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Mélon, Laurent;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Leduc, Guy ;  Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
Language :
English
Title :
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
Publication date :
14 November 2006
Journal title :
Computer Networks
ISSN :
1389-1286
eISSN :
1872-7069
Publisher :
Elsevier Science Bv, Amsterdam, Netherlands
Volume :
50
Issue :
16
Pages :
3043-3063
Peer reviewed :
Peer Reviewed verified by ORBi
Name of the research project :
DGTRE TOTEM
Funders :
F.R.S.-FNRS - Fonds de la Recherche Scientifique
Available on ORBi :
since 03 January 2009

Statistics


Number of views
141 (7 by ULiège)
Number of downloads
207 (0 by ULiège)

Scopus citations®
 
14
Scopus citations®
without self-citations
13
OpenCitations
 
13
OpenAlex citations
 
16

Bibliography


Similar publications



Contact ORBi