|
USENIX 2002 Annual Conference - Technical Program Abstract
A Mechanism for TCP-Friendly Transport-level Protocol Coordination
David E. Ott and Ketan Mayer-Patel,
University of North Carolina at Chapel Hill
Abstract
In this paper, we identify an emerging and important application class comprised of a set of processes on a cluster of devices communicating
to a remote set of processes on another cluster of devices across a common intermediary Internet path. We call these applications
cluster-to-cluster applications, or C-to-C applications. The networking requirements of C-to-C applications present
unique challenges. Because the application involves communication between clusters of devices, very few streams will share a complete
end-to-end path. At the same time, network performance needs to be measured globally across all streams for the application to employ
interstream adaptation strategies. These strategies are important for the application to achieve its global objectives while at the same
time realizing an aggregate flow behavior that is congestion controlled and responsive. We propose a mechanism called the
Coordination Protocol (CP) to provide this ability. In particular, CP makes fine-grained measurements of current network
conditions across all associated flows and provides transport-level protocols with aggregate available bandwidth information using an
equation-based congestion control algorithm. A prototype of CP is evaluated within a network simulator and is shown to be effective.
- View the full text of this paper in
HTML and
PDF.
The Proceedings are published as a collective work, © 2002 by the USENIX Association. All Rights Reserved. Rights
to individual papers remain with the author or the author's employer.
Permission is granted for the noncommercial reproduction of the complete
work for educational or research purposes. USENIX acknowledges all
trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
 To become a USENIX Member, please see our Membership Information.
|
Need help? Use our Contacts page.
