 |
 |
Achieving
bounded fairness for multicast and TCP traffic in the internet
Huayan Amy Wang and Mischa Schwartz (Columbia University)
There is an urgent need for effective multicast congestion control
algorithms which enable reasonably fair sharing of network resources
between multicast and unicast TCP traffic under the current Internet
infrastructure. In this paper, we propose a quantitative definition of
a type of bounded fairness between multicast and unicast best-effort
traffic, termed essentially fair. We also propose a window-based
Random Listening Algorithm (RLA) for multicast congestion control. The
algorithm is proven to be essentially fair to TCP connections under a
restricted topology with equal round-trip times and with phase effects
eliminated. The algorithm is also fair to multiple multicast
sessions. This paper provides the theoretical proofs and some
simulation results to demonstrate that the RLA achieves good
performance under various network topologies. These include the
performance of a generalization of the RLA algorithm for topologies
with different round-trip times.
The slides from the presentation are available here in
Powerpoint ,
Adobe Portable Document Format (PDF) , or
from the author's site.
ACM Copyright Notice: Copyright (c) 1998 by Association
for Computing Machinery, Inc. (ACM) Permission to make digital or
hard copies of all or part of this work for personal or classroom use
is granted without fee provided that the copies are not made or
distributed for profit or commercial advantage and that the copies
bear this notice and full citation on the first page. Copyright for
components of this work owned by others than ACM must be
honored. Abstracting with credit is permitted. To copy otherwise, to
republish, to post on servers, or to redistribute to lists, requires
prior specific permission and/or a fee. Request permission to publish
from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email
<permissions@acm.org>.
The referenced paper is in Computer Communication
Review, a publication of ACM SIGCOMM, volume 28, number 4, October
1998. ISSN # 0146-4833.
This electronic facsimile may differ slighty from the printed
version. It has may have been reformated to better support electronic
viewing. Therefore, please use the printed version when referencing
layout details, such as page numbers.
This paper is available in
Postscript and
Adobe Portable Document Format (PDF)
Get Microsoft Powerpoint Viewer,
 Ghostview
|
