cid abb62cedd95a0dc812ee5fff9d7f22c52ef366e52525c604fa4dc6ec886c2c2f · original · open access · via openalex
Title: MPTCP is not pareto-optimal Authors: Ramin Khalili; Nicolas Gast; Miroslav Popovic; Utkarsh Upadhyay; Jean‐Yves Le Boudec Venue: ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Year: 2012 Canonical: doi:10.1145/2413176.2413178 URL: https://doi.org/10.1145/2413176.2413178 Collector: openalex OA: true ABSTRACT 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.