학술논문

Interpath Contention in MultiPath TCP Disjoint Paths
Document Type
Periodical
Source
IEEE/ACM Transactions on Networking IEEE/ACM Trans. Networking Networking, IEEE/ACM Transactions on. 27(4):1387-1400 Aug, 2019
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Signal Processing and Analysis
Scheduling algorithms
Internet
Servers
IEEE transactions
Protocols
Performance evaluation
Linux
MultiPath TCP (MPTCP)
interpath contention
packet scheduling
coupled congestion control
subflow management
full-mesh
single-mesh
Language
ISSN
1063-6692
1558-2566
Abstract
Interpath contention is a phenomenon experienced in a MultiPath TCP (MPTCP) connection when its subflows dispute resources of shared bottlenecks in end-to-end paths. Although solutions have been proposed to improve MPTCP performance in different applications, the impact of interpath contention on the multipath performance is little understood. In this paper, we evaluated such phenomenon experimentally in disjoint paths–an ordinary multipath scenario where subflows dispute bottlenecks of paths physically disjointed in a connection. Under several path conditions determined from emulations of capacity, loss, and delay of bottlenecks, we analyzed the influence of MPTCP mechanisms such as packet scheduling, congestion control, and subflow management. Differently from other studies, we observed that the very first influence was caused by the current subflow manager, full-mesh , with dichotomous impact on the multipath performance when establishing several subflows per disjoint path. Experimental results showed that contention among subflows can lead to positive (goodput improvement) or negative (goodput degradation) impacts according to the bottleneck conditions. In certain conditions, simply establishing subflows in single-mesh , with at most one subflow per disjoint path, could avoid interpath contention while improving goodput significantly, by doubling the performance of full-mesh under different conservative congestion controls.