Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TPDS.2012.298
Title: | MPath: High-bandwidth data transfers with massively multipath source routing | Authors: | Xu, Y. Leong, B. Seah, D. Razeen, A. |
Keywords: | congestion control Multipath TCP source routing |
Issue Date: | 2013 | Citation: | Xu, Y., Leong, B., Seah, D., Razeen, A. (2013). MPath: High-bandwidth data transfers with massively multipath source routing. IEEE Transactions on Parallel and Distributed Systems 24 (10) : 2046-2059. ScholarBank@NUS Repository. https://doi.org/10.1109/TPDS.2012.298 | 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. © 1990-2012 IEEE. | Source Title: | IEEE Transactions on Parallel and Distributed Systems | URI: | http://scholarbank.nus.edu.sg/handle/10635/77890 | ISSN: | 10459219 | DOI: | 10.1109/TPDS.2012.298 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.