Abstract
Recently, a TCP-friendly, single-rate multicast congestion control scheme called pgmcc was introduced by one of the authors. In this paper, we study the fairness of pgmcc in a variety of scenarios in which a multicast transfer session competes with long-lived TCP flows and web-like traffic. We evaluate fairness of the pgmcc scheme at different timescales and compare it with the fairness of the TCP congestion control algorithm.
Our results show that pgmcc is capable of sharing fairly the available bandwidth with competing connections. In particular, the use of a closed control loop between the sender and a group’s representative — which closely mimics the TCP congestion control — guarantees that pgmcc is fair to TCP sessions and that it is capable of reacting quickly to changes of network conditions without compromising fairness.
Work partly supported by Cisco Systems, Microsoft Research, IAT-CNR and Università di Pisa.
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. Bhattacharyya, D. Towsely, J. Kurose “The Loss Path Multiplicity Problem in Multicast Congestion Control” IEEE Infocom, March 1999.
L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy, P. Huang, S. McCanne, K. Varadhan, Y. Xu, H. Yu “Advances in Network Simulation”, IEEE Computer, May 2000.
R. Jain, D.M. Chiu, W. Hawe, “A quantitative measure of fairness and discrimination for resource allocation in shared systems”, TechReport DEC-TR-301, September 1984.
T. Jiang, E.W. Zegura, M. Ammar, “Inter-Receiver Fair Multicast Communication Over the Internet”, ACM Sigmetrics, June 1998.
A. Legout, J. Nonnenmacher, E.W. Biersack “Bandwidth Allocation Policies for Unicast and Multicast Flows” IEEE Infocom, March 1999.
A. Mankin, A. Romanow, S. Bradner, V. Paxson, “IETF Criteria for Evaluating Reliable Multicast Transport and Application Protocols” RFC2357
S. Floyd, M. Handley, J. Padhye, J. Widmer, “Equation-Based Congestion Control for Unicast Applications”, ACM SIGCOMM 2000, Stockholm, Sweden, August 2000.
J. Padhye, V. Firoiu, D. Towsley, J. Kurose, “Modeling TCP throughput: a simple model and its empirical validation”, ACM SIGCOMM’98, Vancouver, CA, Sep. 1998.
L. Rizzo, “pgmcc: A TCP-friendly single-rate multicast congestion control scheme”, ACM SIGCOMM 2000, Stockholm, Sweden, Aug 2000.
D. Rubenstein, J. Kurose, D. Towsley “The Impact of Multicast Layering on Network Fairness” ACM Sigcomm, August 1999
T. Speakman et al., “PGM Reliable Transport Protocol Specification”, Internet Draft, http://draft-speakman-pgm-spec-06.txt
H.A. Wang, M. Schwartz, “Achieving Bounded Fairness for Multicast and TCP Trafficin the Internet”, Proc. of SIGCOMM’98, Aug. 1998, Vancouver
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
Iannaccone, G., Rizzo, L. (2001). Fairness of a Single-Rate Multicast Congestion Control Scheme. 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_21
Download citation
DOI: https://doi.org/10.1007/3-540-45400-4_21
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