Abstract
We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a convex program formulation, we show that there exists an algorithm to compute the fairshare at each link using only the total arrival rate at each link. Further this information can be conveyed to the multicast receivers using a simple marking mechanism. The mechanisms required to implement the algorithm at the routers have low complexity since they do not require any per-flow information.
The work of the first two authors was supported by NSF Grants NCR-9701525 and ANI-9813710., and DARPA contract F30602-00-0542. The work of the third author was supported by DARPA contract F30602-00-0554 , and NSF grants NCR-9980552 and EIA-0121608
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Athuraliya, D. E. Lapsley, and S. H. Low. Random early marking for internet congestion control. In Proceedings of IEEE Globecom, 1999.
S. Floyd, “TCP and explicit congestion notification,” ACM Computer Communication Review, vol. 24, pp. 10-23, October 1994.
R.J. Gibbens and F.P. Kelly. Distributed connection acceptance control for a connectionless network. In Proc. of the 16th Intl. Teletraffic Congress, Edinburgh, Scotland, June 1999.
R.J. Gibbens and F.P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 1999.
F.P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33–37, 1997.
F. P. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237–252, 1998.
S. Kunniyur and R. Srikant. End-to-end congestion control: utility functions, random losses and ECN marks. In Proceedings of INFOCOM 2000, Tel Aviv, Israel, March 2000.
S. Kunniyur and R. Srikant, “A time-scale decomposition approach to adaptive ECN marking,” to appear in the Proceedings of INFOCOM 2001, Alaska, Anchorage, April 2001.
X. Li, S. Paul, M.H. Ammar. “Layered video multicast with retransmission (LVMR): evaluation of hierarchical rate control,” Proc. INFOCOM’98, March 1998.
S. H. Low and D. E. Lapsley. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 1999.
S. McCanne, V. Jacobson, M. Vetterli. “Receiver-driven layered multicast,” Proc. SIGCOMM’96, Sept. 1996.
K.K. Ramakrishnan, S. Floyd. “A proposal to add Explicit Congestion Notification (ECN) to IP,” RFC 2481, January 1999.
D. Rubenstein, J. Kurose, D. Towsley. “The impact of multicast layering on network fairness,” Proc. SIGCOMM’99, Sept. 1999.
S. Sarkar and L. Tassiulas. Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees. In Proceedings of INFOCOM 2000, Tel Aviv, Israel, March 2000.
S. Sarkar and L. Tassiulas. Fair Allocation of Discrete Bandwidth Layers in Multicast Networks. In Proceedings of INFOCOM 2000, Tel Aviv, Israel, March 2000.
H.Y. Tzeng, K. Siu. “On Max-Min fair congestion control for multicast ABR service in ATM,” IEEE J. on Sel. Areas in Commun., 15:3, 1997.
L. Vicsiano, J. Crowcroft, L. Rizzo. “TCP-like congestion control for layered multicast data transfer,” Proc. INFOCOM’98, March 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graves, E.E., Srikant, R., Towsley, D. (2001). Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows. In: Palazzo, S. (eds) Evolutionary Trends of the Internet. IWDC 2001. Lecture Notes in Computer Science, vol 2170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45400-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-45400-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42592-2
Online ISBN: 978-3-540-45400-7
eBook Packages: Springer Book Archive