Multipath TCP Ramin Khalili
INTERNET-DRAFT T-Labs/TU-Berlin
Intended Status: Standard Track Nicolas Gast
Expires: August 21, 2013 Miroslav Popovic
Jean-Yves Le Boudec
EPFL-LCA2
February 17, 2013
<Performance Issues with MPTCP>
draft-khalili-mptcp-performance-issues-02
Abstract
We show, by measurements over a testbed and by mathematical analysis,
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; and (P2) MPTCP users can be
excessively aggressive towards TCP users. We attribute these problems
to the "Linked Increases" Algorithm (LIA) of MPTCP [4], and more
specifically, to an excessive amount of traffic transmitted over
congested paths. Our results show that these problems are important
and can be mitigated. We believe that the design of the congestion
control of MPTCP should be improved.
Status of this Memo
This Internet-Draft is submitted to IETF in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as
Internet-Drafts.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on August 22, 2013.
The list of current Internet-Drafts can be accessed at
http://www.ietf.org/1id-abstracts.html
Khalili, et al. Expires August 22, 2013 [Page 1]
INTERNET DRAFT Performance Issues with MPTCP February 18, 2013
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html
Copyright and License Notice
Copyright (c) 2013 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1 Requirements Language . . . . . . . . . . . . . . . . . . . 4
1.2 Terminology . . . . . . . . . . . . . . . . . . . . . . . . 4
2 MPTCP's LIA . . . . . . . . . . . . . . . . . . . . . . . . . . 5
3 Testbed Setup . . . . . . . . . . . . . . . . . . . . . . . . . 6
4 Scenario A: MPTCP can penalize regular TCP users . . . . . . . . 7
5 Scenario B: MPTCP can penalize other MPTCP users . . . . . . . . 10
6 Scenario C: MPTCP is excessively aggressive towards TCP users . 12
7 Can the suboptimality of MPTCP with LIA be fixed? . . . . . . . 14
8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
9 References . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
9.1 Normative References . . . . . . . . . . . . . . . . . . . . 17
9.2 Informative References . . . . . . . . . . . . . . . . . . . 17
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 19
Khalili, et al. Expires August 22, 2013 [Page 2]
INTERNET DRAFT Performance Issues with MPTCP February 18, 2013
1 Introduction
Regular TCP uses a window-based congestion-control mechanism to
adjust the transmission rate of users [2]. It always provides a
Pareto-optimal allocation of resources: it is impossible to increase
the throughput of one user without decreasing the throughput of
another or without increasing the congestion cost [5]. It also
guarantees a fair allocation of bandwidth among the users but favors
the connections with lower RTTs [6].
Various mechanisms have been used to build a multipath transport
protocol compatible with the regular TCP. Inspired by utility
maximization frameworks, [7, 8] propose a family of algorithms. These