|
USENIX 2004 Annual Technical Conference, General Track — Abstract
Pp. 99–112 of the Proceedings
A Transport Layer Approach for Improving End-to-End Performance and Robustness Using Redundant Paths
Ming Zhang and Junwen Lai, Princeton University; Arvind Krishnamurthy, Yale University; Larry Peterson and Randolph Wang, Princeton University
Abstract
Recent work on Internet measurement and overlay networks has shown
that redundant paths are common between pairs of hosts and that one
can often achieve better end-to-end performance by adaptively
choosing an alternate path. In this paper,
we propose an end-to-end transport layer protocol, mTCP, which can
aggregate the available bandwidth of those redundant paths in parallel.
By striping one flow's packets across multiple paths, mTCP can
not only obtain higher end-to-end throughput but also be
more robust under path failures. When some paths fail, mTCP can continue
sending packets on other paths, and the recovery process normally
takes only a few seconds. Because mTCP could obtain an unfair share of
bandwidth under shared congestion, we integrate a shared congestion
detection mechanism into our system. It allows us to dynamically
detect and suppress paths with shared congestion so as to alleviate
the aggressiveness problem. mTCP can also passively monitor the performance of
several paths in parallel and discover better paths than the path
provided by the underlying routing infrastructure.
We also propose a heuristic to find disjoint paths between pairs of nodes
using traceroute. We have implemented our system on top of overlay networks
and evaluated it in both PlanetLab and Emulab.
- View the full text of this paper in HTML and PDF.
The Proceedings are published as a collective work, © 2004 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.
|
Need help? Use our Contacts page.
