Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
ACM Transactions on Computer Systems (TOCS)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
A transport layer approach for improving end-to-end performance and robustness using redundant paths
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
CUBIC: a new TCP-friendly high-speed TCP variant
ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
Control of Multipath TCP and Optimization of Multipath Routing in the Internet
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
Mean field limit of non-smooth systems and differential inclusions
ACM SIGMETRICS Performance Evaluation Review
Design, implementation and evaluation of congestion control for multipath TCP
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Improving datacenter performance and robustness with multipath TCP
Proceedings of the ACM SIGCOMM 2011 conference
Markov chains with discontinuous drifts have differential inclusion limits
Performance Evaluation
A measurement-based study of MultiPath TCP performance over wireless networks
Proceedings of the 2013 conference on Internet measurement conference
Explicit multipath congestion control for data center networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
On the benefits of applying experimental design to improve multipath TCP
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Cross-path inference attacks on multipath TCP
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
Journal of Parallel and Distributed Computing
Communications of the ACM
Queue - The Internet
| Hi-index | 0.02 |
MPTCP has been proposed recently as a mechanism for supporting transparently multiple connections to the application layer. It is under discussion at the IETF. We show, however, that the current MPTCP suffers from two problems: (P1) Upgrading some TCP users to MPTCP can reduce the throughput of others without any benefit to the upgraded users, which is a symptom of not being Pareto-optimal; and (P2) MPTCP users could be excessively aggressive towards TCP users. We attribute these problems to the linked-increases algorithm (LIA) of MPTCP and, more specifically, to an excessive amount of traffic transmitted over congested paths. The design of LIA forces a tradeoff between optimal resource pooling and responsiveness. We revisit the problem and show that it is possible to provide these two properties simultaneously. We implement the resulting algorithm, called opportunistic linked increases algorithm (OLIA), in the Linux kernel, and we study its performance over our testbed, by simulations and by theoretical analysis. We prove that OLIA is Pareto-optimal and satisfies the design goals of MPTCP. Hence it can avoid the problems P1 and P2. Our measurements and simulations indicate that MPTCP with OLIA is as responsive and non-flappy as MPTCP with LIA, and that it solves problems P1 and P2.