Reference : Decentralized local backup LSP calculation with efficient bandwidth sharing
Scientific congresses and symposiums : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/3447
Decentralized local backup LSP calculation with efficient bandwidth sharing
English
Mélon, Laurent [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > > >]
Blanchy, François [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > > >]
Leduc, Guy mailto [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Feb-2003
10th IEEE International Conference on Telecommunications
IEEE
929-937
Yes
No
International
USA
IEEE ICT 2003
23-28 Feb. 2003
Papeete
Tahiti
[en] Traffic engineering ; MPLS ; Protection
[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. For this type of application endto- end recovery schemes are usually considered to be far too slow. Local, fast-rerouting is the only solution which can compete with restoration times offered by SONET self-healing ring. However local restoration has a cost in terms of extra bandwidth consumed for the backup paths. Our scheme thus includes a sophisticated resource aggregation mechanism based on the concepts of "backup-backup aggregation" and "backupprimary 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-theart end-to-end recovery schemes in terms of resource reservation. 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.
Fonds de la Recherche Scientifique (Communauté française de Belgique) - F.R.S.-FNRS
EU ATRIUM
Researchers ; Professionals
http://hdl.handle.net/2268/3447

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
LM-ICT2003.pdfPublisher postprint203.28 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.