Abstract
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.
This work was supported by the European ATRIUM project (IST-1999-20675) and by the TOTEM project funded by the DGTRE (Walloon region)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ATM Forum Technical Commitee. Traffic Management Specification - Version 4.0 (February 1996), ATM Forum/95-0013R13
Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: Extensions to RSVP for LSP tunnels, RFC 3209 (December 2001)
Balon, S., Blanchy, F., Delcourt, O., Leduc, G., Mélon, L., Skivée, F.: Synthesis and recommendation for intra-domain traffic engineering. Technical Report ATRIUM Deliverable D3.3, University of Liège (Novembre 2003)
Berger, L., Gan, D., Swallow, G., Pan, P., Tommasi, F., Molendini, S.: RSVP Refresh Overhead Reduction Extensions. RFC 2961 (April 2001)
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
Chang, Y., Golmie, N., Siu, D.: A Rate-Based Flow Control Switch Design for ABR Service in an ATM Network. In: Twelfth International Conference on Computer Communication ICCC 1995 (August 1995)
Charny, A.: An algorithm for rate allocation in a packet-switching network with feedback. Technical Report MIT/LCS/TR-601 (1994)
Thomas Hou, Y., Tzeng, H., Panwar, S.S., Kumar, V.P.: A generic weight-proportional bandwidth sharing policy for atm abr service. Performance Evaluation 38, 21–44 (1999)
Jain, R., Kalyanaraman, S., Goyal, R., Fahmy, S., Viswanathan, R.: ERICA switch algorithm: A complete description (August 1996), ATM Forum/96-1172
Le Boudec, J.Y., Radunovic, B.: A unified framework for max-min and min-max fairness with applications (October 2002)
Rosen, E., et al.: Multiprotocol label switching architecture (January 2001) RFC 3031
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skivée, F., Leduc, G. (2004). A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_87
Download citation
DOI: https://doi.org/10.1007/978-3-540-27824-5_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22571-3
Online ISBN: 978-3-540-27824-5
eBook Packages: Springer Book Archive