Name
Abstract | ||
|---|---|---|
The capacity of access links has increased dramatically in recent times, and bottlenecks are moving deeper into the Internet core. When bottlenecks occur in a core (or AS-AS peering) link, it is possible to use additional detour paths to improve the end-to-end throughput between a pair of source and destination nodes. We propose and evaluate a new massively multipath (mPath) source routing algorithm to improve end-to-end throughput for high-volume data transfers. We demonstrate that our algorithm is practical by implementing a system that employs a set of proxies to establish one-hop detour paths between the source and destination nodes. Our algorithm can fully utilize the available access link bandwidth when good proxied paths are available, without sacrificing TCP-friendliness, and achieves throughput comparable to TCP when such paths cannot be found. For 40 percent of our test cases on PlanetLab, mPath achieved significant improvements in throughput. Among these, 50 percent achieved a throughput of more than twice that of TCP. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TPDS.2012.298 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
high-volume data transfer,recent time,high-bandwidth data transfers,one-hop detour path,end-to-end throughput,additional detour path,destination node,available access link bandwidth,good proxied path,massively multipath source routing,access link,internet core,routing,congestion control,throughput,source routing,internet | Equal-cost multi-path routing,Multipath routing,Dynamic Source Routing,Static routing,Computer science,Multipath TCP,DSRFLOW,Computer network,Source routing,Throughput,Distributed computing | Journal |
Volume | Issue | ISSN |
24 | 10 | 1045-9219 |
Citations | PageRank | References |
4 | 0.48 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin Xu | 1 | 383 | 64.25 |
| Ben Leong | 2 | 343 | 27.92 |
| Daryl Seah | 3 | 8 | 1.28 |
| Ali Razeen | 4 | 82 | 6.93 |