Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 2016 | Submitted
Journal Article Open

Multipath TCP: Analysis, Design, and Implementation

Abstract

Multipath TCP (MP-TCP) has the potential to greatly improve application performance by using multiple paths transparently. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate our algorithm Balia (balanced linked adaptation), which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new algorithm to existing MP-TCP algorithms.

Additional Information

© 2014 IEEE. Manuscript received August 13, 2013; revised May 16, 2014 and September 27, 2014; accepted November 20, 2014; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor Y. Liu. Date of publication December 31, 2014; date of current version February 12, 2016. This work was supported by the ARO MURI under Grant W911NF-08-1-0233, the NSF NetSE under Grant CNS 0911041, Bell Labs, Alcatel-Lucent, and the Seoul R&BD Program funded by the Seoul Metropolitan Government under Grant WR080951. A preliminary version of this work has appeared in the Proceedings of the ACM SIGMETRICS/International Conference on Measurement and Modeling of Computer Systems, Pittsburgh, PA, USA, June 17–21, 2013.

Attached Files

Submitted - 1308.3119v3.pdf

Files

1308.3119v3.pdf
Files (4.8 MB)
Name Size Download all
md5:ea0297a2da7099dab595e711a256246f
4.8 MB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 19, 2023