Reference : A distributed algorithm for weighted max-min fairness in MPLS networks
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/3436
A distributed algorithm for weighted max-min fairness in MPLS networks
English
Skivée, Fabian [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > > >]
Leduc, Guy mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Aug-2004
Lecture Notes in Computer Science
Springer-Verlag
3124
Telecommunications and Networking - ICT 2004
644-653
Yes
No
International
0302-9743
Berlin
IEEE ICT 2004
1-6 Aug. 2004
Fortaleza
Brazil
[en] MPLS ; Fairness ; Congestion control
[en] We propose a novel distributed algorithm to achieve a weighted max-min sharing of the network capacity. We present the Weight Proportional Max-Min policy (WPMM) that supports a minimal rate requirement and an optional maximal rate constraint and allocates network bandwidth among all aggregates based on a weight associated with each one. Our algorithm achieves this policy for IP/MPLS networks using the RSVP-TE signalling protocol. It uses per-LSP accounting in each node to keep track of the state information of each LSP. It uses a novel explicit bottleneck link strategy and a different control architecture in which we update the control packet in the forward path. Simulations show that these two elements improve substantially the convergence time compared to algorithms designed for ATM networks.
DGTRE TOTEM
Researchers
http://hdl.handle.net/2268/3436

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
FS-ICT2004.pdfAuthor postprint218.52 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.