Shapiro et al 2002a - Revision history

Scipediacontent at 14:01, 21 January 2021

2021-01-21T14:01:26Z

Scipediacontent: Scipediacontent moved page Draft Content 352976658 to Shapiro et al 2002a

2020-10-14T12:03:56Z

Scipediacontent moved page Draft Content 352976658 to Shapiro et al 2002a

Scipediacontent: Created page with " == Abstract == Widespread deployment of multicast depends on the existence of congestion control protocols that are provably fair to unicast traffic. In this work, we presen..."

2020-10-14T12:03:53Z

Created page with " == Abstract == Widespread deployment of multicast depends on the existence of congestion control protocols that are provably fair to unicast traffic. In this work, we presen..."

New page

== 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.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_352976658-beopen453-5120-document.pdf</pdf>

== Original document ==

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

* [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_34.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_34.pdf]

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

@@ Line 3: / Line 3: @@
 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.
@@ Line 15: / Line 10: @@
 * [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_34.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_34.pdf]
-DOIS: 10.1109/mcom.2002.1031834 10.1007/3-540-47906-6_34
+DOIS: 10.1007/3-540-47906-6_34 10.1109/mcom.2002.1031834

← Older revision	Revision as of 12:03, 14 October 2020
(No difference)