Flexible Multipath Transport Protocols

Tue, 05/26/2020 - 11:59 by Quentin De Coninck

Abstract

Since its inception in the early 70’s, the Internet has expanded to interconnect billions of computers. The last decade has seen the rise of multi-connected devices, such as smartphones that can attach to both Wi-Fi and cellular networks. Endhosts can leverage this availability of multiple network paths in two major ways. First, they can aggregate the bandwidth of the available networks. Second, they can support seamless network handover when one of the network paths fails. Applications rely on transport protocols to carry data between endhosts. These applications can have various requirements. While simple bulk transfers want to complete as fast as possible, interactive applications (such as voice-activated ones) have strict latency constraints, especially under mobile conditions. Furthermore, the device user might enforce additional constraints, such as limiting the cellular usage on smartphone for both monetary and energy purposes.

This thesis explores how multipath transport protocols can adapt to their serving use cases. First, we quantify the performance of the state-of-the-art Multipath TCP on smartphones by performing two measurement campaigns. Second, based on our previous findings, we tune Multipath TCP for the smartphone use case and evaluate it with real Android phones. Next, we focus on the emerging QUIC protocol, design two versions for its Multipath extensions and evaluate their benefits in various scenarios. Finally, we reconsider the architecture of transport protocols such as their operations can be finely customized on a per-connection basis thanks to the dynamic injection of plugins.

Authors
Quentin De Coninck
Type
PhD thesis
Source
UCLouvain, March 2020.
Notes
Presentation available at https://www.youtube.com/watch?v=b2FWfT9b3Ws&feature=youtu.be&t=132
Full text
pdf    (3.5 MB)
Cite it
BibTex
Copyright
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.