Abstract

Widespread deployment of multicast depends on the existence of congestion control protocols that are provably fair to unicast traffic. In this work, we present an optimization-based congestion control mechanism for single-rate multicast communication with provable fairness properties. The optimization-based approach attempts to find an allocation of rates that maximizes the aggregate utility of the network. We show that the utility of multicast sessions must be carefully defined if a widely accepted property of aggregate utility is to hold. Our definition of session utility amounts to maximizing a weighted sum of simple utility functions, with weights determined by the number of receivers. The fairness properties of the optimal rate allocation depend both on the weights and form of utility function used. We present analysis for idealized topologies showing that while our mechanism is not strictly fair to unicast, its unfairness can be controlled by appropriate choices of parameters.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1007/3-540-47906-6_34
http://dx.doi.org/10.1109/mcom.2002.1031834
https://core.ac.uk/display/13614808,
https://dblp.uni-trier.de/db/conf/networking/networking2002.html#ShapiroTK02,
https://rd.springer.com/chapter/10.1007/3-540-47906-6_34,
https://academic.microsoft.com/#/detail/2143365616
https://www.scholarworks.umass.edu/cs_faculty_pubs/699,
https://academic.microsoft.com/#/detail/2100637767


DOIS: 10.1007/3-540-47906-6_34 10.1109/mcom.2002.1031834

Back to Top

Document information

Published on 01/01/2002

Volume 2002, 2002
DOI: 10.1109/mcom.2002.1031834
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?