The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution
Open accessAbstract
Multipath TCP (MPTCP) has been proposed recently as a mechanism for transparently supporting multiple connections to the application layer. It is under discussion at the IETF. We nevertheless demonstrate 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 toward 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 the 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 nonflappy as MPTCP with LIA and that it solves problems P1 and P2.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Misra, V., Gong, W.-B., & Towsley, D. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347421 · Cited by 1,274
Scalable TCP: improving performance in highspeed wide area networks
Kelly, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956989 · Cited by 869
Improving datacenter performance and robustness with multipath TCP
Raiciu, C., Barre, S., Pluntke, C., Greenhalgh, A., Wischik, D., & Handley, M. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018467 · Cited by 678
Design, implementation and evaluation of congestion control for multipath TCP
Wischik, D., Raiciu, C., Greenhalgh, A., & Handley, M. J. (2011) · doi:10.5555/1972457.1972468 · Cited by 586
Mathematics Unlimited — 2001 and Beyond
Engquist, B., & Schmid, W. (2001) · Springer eBooks · doi:10.1007/978-3-642-56478-9 · Cited by 535
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Coupled Congestion Control for Multipath Transport Protocols
Raiciu, C., Handley, M. J., & Wischik, D. (2011) · doi:10.17487/rfc6356 · Cited by 440
A measurement-based study of MultiPath TCP performance over wireless networks
Chen, Y., Lim, Y.-S., Gibbens, R., Nahum, E., Khalili, R., & Towsley, D. (2013) · ACM Internet Measurement Conference (IMC) · doi:10.1145/2504730.2504751 · Cited by 300
Self-citationImproving datacenter performance and robustness with multipath TCP
Raiciu, C., Barre, S., Pluntke, C., Greenhalgh, A., Wischik, D., & Handley, M. J. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018467 · Cited by 277
The resource pooling principle
Wischik, D., Handley, M., & Braun, M. B. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1452335.1452342 · Cited by 241
Markov chains with discontinuous drifts have differential inclusion limits
Gast, N., & Gaujal, B. (2012) · Performance Evaluation · doi:10.1016/j.peva.2012.07.003 · Cited by 49
Self-citation
Cited by
Multipath TCP: Analysis, Design, and Implementation
Peng, Q., Walid, A., Hwang, J., & Low, S. H. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2379698 · Cited by 293
Metadata
- Authors
- Khalili, R., Gast, N., Popovic, M., & Le Boudec, J.-Y.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2013-10
- Volume
- 21
- Issue
- 5
- Pages
- 1651-1665
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2179500942
- Cited by
- 339
- References
- 18
- FWCI
- 26.87
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.