Performance Analysis of MPTCP Under High Load Based on SDN Environment

Multipath TCP (MPTCP) is a backward compatible extension of Transmission Control Protocol (TCP) designed to let an application send data over several TCP connections, usually called subflows. MPTCP presents several opportunities over legacy TCP, especially when these subflows follow disjoint paths: for instance bandwidth aggregation or seamless mobility across networks. While MPTCP is built as an extension of TCP, the scope of the modifications qualifies it almost as a new protocol. This means traditional TCP tools are not enough to analyze MPTCP performance. We thus develop and present an open source application able to analyze MPTCP specific metrics such as the aggregated goodput or inter-subflow retransmissions.

A popular transport layer protocol that makes extensive use of multi-path communication technology is called Multi-Path Transmission Control Protocol (MPTCP). Making use of the end-host’s multi-interface capabilities is MPTCP’s primary goal. However, the protocol’s main weakness is lower channel usage suffers from a sharp decline in throughput due to its sudden congestion window (cwnd) growth policy. Furthermore, the performance of MPTCP is significantly reduced when there are many possible channels for transmission because different wireless path parameters such as bandwidth, loss rate (due to congestion or unreliability of the wireless channel), and delay necessitate higher re-ordering at the receiver end. As a result, it causes a significant increase in buffer-blocking and needless retransmissions. Nonetheless, a few strategies that efficiently schedule and distribute the load over accessible, qualifying channels have been proposed. However, our proposed policy takes all these parameters into consideration and the performance has been improved significantly can be seen be the graphs presented in the later section of the paper.

Enhancing MPTCP performance in wireless networks with PRS-MPTCP

Today's laptops and mobile terminals are equipped with several network interfaces belonging to different access technologies. Users can benefit from multi-homing to access network services anywhere, at any time and from any network. Multipath TCP (MPTCP) is a modified version of Transmission Control Protocol (TCP) which allows a TCP connection to simultaneously send data over multiple paths. One of the objectives of MPTCP is to improve the throughput of TCP connection. A MPTCP connection over multiple paths should achieve a no worse throughput than a single TCP connection over the best constituent path. In this paper, we evaluate the performance of MPTCP in terms of throughput optimization and load sharing. The measurements show that the context of heterogeneous networks (Ethernet, Wifi and 3G) has a great impact on the MPTCP performances and reveal the need of an intelligent algorithm for interface selection in MPTCP.

Space-ground integrated networks (SGINs) have been recently regarded as a promising way to provide resilient, dependable as well as efficient data transmission in the high-speed railway (HSR) scenario. Applying multipath transmission control protocol (MPTCP) to SGIN can realize data transmission simultaneously via terrestrial and satellite networks. However, since the existing congestion control (CC) mechanisms of MPTCP fail to distinguish between adverse influences (such as packet loss and/or round-trip time increase) caused by congestion and those caused by handovers, it suffers severe performance degradation in the HSR scenario where handover frequently occurs. In this article, we first present the SGIN oriented HSR (SGIN-HSR) with MPTCP. Then leveraging cross-layer information (i.e., reference signal received power), we design a novel cross-layer aided MPTCP CC mechanism targeted at SGIN-HSR based on deep reinforcement learning, which is referred to as HSR-CC, to alleviate performance degradation problems induced by handover. The experimental results show that HSR-CC significantly enhances the goodput and outperforms state-of-the-art MPTCP CC algorithms in SGIN-HSR environments where handover frequently occurs.

With increasing deployment of Multipath TCP (MPTCP) in multihoming and data enter scenarios, there is a need to understand how its performance is affected in practice-both by traditional factors such as RTT measurements, and by new multipath-specific considerations such as sub flow selection. We carried out an initial but comprehensive study using an actual MPTCP implementation in an emulated network environment, to explore the impact of different factors on MPTCP throughput. We find that path selection and packet scheduling have a large effect on performance, and that merely trusting the congestion control mechanism to do the right thing is not enough. Moreover, we provide evidence that throughput can be improved by slight modifications to the send buffers and path selection components of the implementation. Important challenges in network design remain, if only to ensure that multiple suitable paths exist in a network.

The upgrade of network devices to be equipped with multiple network interfaces makes it possible to improve network throughput performance through multipath transmission protocols, especially multipath TCP (MPTCP). However, so far the mostly used MPTCP protocols have a common limitation, namely the rigid and conservative method. They have been designed with little consideration of the fact that real networks are dynamic and the network status changes frequently, thus leading to the poor performance of current MPTCP in many realistic scenarios. In this paper, we propose a lightweight multipath congestion control algorithm based on online learning, named MP-OL. MP-OL models congestion control as a multi-armed bandit problem, and adjusts the sending rate of each subflow flexibly and adaptively through online learning. Therefore, MP-OL possesses the capability of suiting various network scenarios, and can achieve fairness and high performance in dynamic network environment. It can also flexibly switch between online learning and traditional method, which reduces the computational complexity while ensuring the learning efficiency, thus making MP-OL easy to deploy and use. As the experimental results demonstrated, compared with the leading MPTCP variants, MP-OL achieves significant improvements in fairness and link utilization, and shows better resilience to non-congestion loss and better adaptability to unstable network conditions. In real networks, MP-OL also obtains better throughput performance.

The spread of Edge Internet of Things (IoT) radically changes our lifestyle. However, the multimedia services in edge IoT are still stuck by inefficiency. The dynamic typologies perplex the transmission of massive real-time data. To solve this problem, multipath transmission control protocol (MPTCP) which has a natural advantage in transmission robustness and bandwidth aggregation is becoming a good choice. In this paper, failure-aware and delay-predicted multipath virtual queue scheduling (FD-MVQS) is proposed to optimize the MPTCP performance in edge IoT. FD-MVQS constructs a two-plane cooperative scheduling system. In the control plane, the transmission failure estimation and chaos theory-based arrival delay prediction methods are introduced to provide the foundation for prescheduling. In the data plane, the multipath virtual queue scheduling is designed to allocate segments to different subflows. Simulation results showed that the proposed FD-MVQS performed better than standard and typical multipath transmission solutions in throughput, delay, and segment disorder.

Nearly 50% of the energy overhead in today's datacenters comes from host-to-host data transfers, which largely depend on the transport layer performance. Multipath TCP (MPTCP) has recently been suggested as a promising transport protocol to improve datacenter network throughput, yet it also increases the host CPU power consumption. It remains unclear whether datacenters can indeed benefit from using MPTCP from the perspective of energy efficiency. By analyzing the performance of MPTCP, we show that (1) despite consuming higher host CPU power than TCP, MPTCP can largely reduce the long flow completion time and thus save the aggregated energy; (2) link-sharing subflows in MPTCP not only has negative impact on both throughput-sensitive long flows and latency-sensitive short flows, but also noticeably increases the host CPU power, especially for short flows. We present MPTCP-D, an energy-efficient variant of multipath TCP for datacenters. MPTCP-D incorporates a novel congestion control algorithm that can provide energy efficiency by minimizing the flow completion time, and an extra subflow elimination mechanism that can preclude link-sharing subflows from increasing the host CPU power. We implement MPTCP-D in the Linux kernel and study its performance by experiments on Amazon EC2. Our results show that, without degrading the performance of the long flow throughput and short flow completion time, MPTCP-D reduces the long flow energy consumption by up to 72% compared to DCTCP for data transfers, and reduces the short flow power consumption by up to 46% compared to MPTCP with linksharing subflows.

With the growing demand of Internet services, network operators have put significant efforts to improve network error resilience and efficiency. Since there exist different wired/wireless technologies for Internet access such as digital subscriber line (DSL), Ethernet, and worldwide interoperability for microwave access (WiMax), a mobile host can use multiple access networks simultaneously with multipath transmission. Taking the advantage of heterogeneous environment, multipath transmission through the Internet can improve service reliability and network flexibility. Ensuring a reliable end-to-end connection oriented communication with satisfactory quality of service (QoS) and maintaining congestion control and flow control are the main responsibilities of the Transmission Control Protocol (TCP), the dominant transport layer protocol in the Internet. In this paper, we survey the state-of-the-art of multipath transmission techniques for QoS provisioning in wireless Internet access, focusing on the end-to-end transport layer protocols. The main challenges for the design of multipath TCP are reviewed, and the existing transport layer congestion control schemes are categorized. Multipath TCP and stream control transmission protocol (SCTP)-based transport layer protocols are discussed, and their limitations and/or impractical assumptions are addressed. Open research issues on the development of an effective, efficient, and practical multipath TCP protocol are summarized.

Multipath TCP (MPTCP) is a major extension of TCP that aims to offer higher aggregate bandwidth and robustness by pooling multiple paths within one transport connection. One of the current weaknesses of the protocol is the Delayed ACK scheme inherited from TCP. The Delayed ACK is an option of TCP that allows the receiver to delay sending an ACK for every other packet within a window given by the Delayed ACK timer. At the sender, the RTO should be no less than the Minimum RTO to avoid spurious timeouts. This strategy can lead to significant performance degradation in the presence of timeouts, especially in high speed networks, where RTT is usually one- or two-order of magnitude smaller than the Minimum RTO. When a subflow occurs a timeout, the receiver has to buffer data from all the subflows until the missing packet is received. The data may overrun the receive buffer to cause flow control at the sender, which seriously impacts the overall performance. In order to avoid MPTCP performance degradation, we propose a new Delayed ACK aiming to remove the Minimum RTO constraint at the sender while to reserve the Delayed ACK function at the receiver. Our solution requires only minor modification to the legacy Delayed ACK scheme and it introduces negligible computational overhead and no extra traffic overhead. We use a NS-3 network simulator to evaluate the performance of our new Delayed ACK in three typical network environments. The results indicate that MPTCP using new Delayed ACK scheme requires much smaller aggregate buffer than MPTCP using the legacy Delayed ACK scheme, especially in high speed networks where the buffer requirement reduces one- or two-order of magnitude.

A path characteristics based adaptive subflow switching algorithm for dynamic heterogeneous MPTCP network

Mobile devices are able to leverage diverse heterogeneous network paths by Multi-Path Transmission Control Protocol (MPTCP); nevertheless, boosting MPTCP throughput in wireless networks is a real bear. Not only the best path(s) should be selected, but also the optimal congestion control mechanism should be chosen. We investigate the impact of different paths and congestion control for different signal quality states. Consequently, we present the novel MPTCP algorithm augmenting the end user throughput by understating the best policy in different situations by Q-learning. The Results reveal a tremendous effect of switching between the different interfaces and changing the congestion control mechanism on throughput and delay. By and large, the proposed framework achieves 10% more throughput compared to base MPTCP.

Multipath Transmission Control Protocol (MPTCP) enables multi-homed devices to establish multiple simultaneous routes for data transmission. Congestion Control (CC) is a fundamental mechanism for implementing and designing MPTCP. The Internet of Things (IoT) networks generate a massive volume of heterogeneous traffic with high dimensional states and diverse QoS characteristics. The existing MPTCP CC algorithms are unable to perform efficiently under highly mobile and dynamic IoT environments. We propose a novel model-free SDN-based adaptive actor-critic deep reinforcement learning framework based on a fuzzy normalized neural network to address the issue of CC for MPTCP in the IoT networks. In the proposed method, an agent can learn efficiently and better approximate the state-action value function of the actor and the action function of the critic to adjust the sub-flows congestion windows size adaptively according to the dynamic condition of a network. Simulation results show that the proposed scheme outperforms the state of the art schemes in terms of the goodput under highly-dynamic IoT environments.

Multipath Transmission Control Protocol (MPTCP) is a new transmission protocol designed by The Internet Engineering Task Force (IETF) for multipath transmission. In order to realize the large-scale and rapid deployment of MPTCP, the design of MPTCP needs to ensure fairness with traditional Transmission Control Protocol (TCP). The IETF organization designed a congestion control algorithm for the network fairness of MPTCP, but did not consider the bottleneck fairness of MPTCP. In this paper, we propose a congestion control algorithm based on Dynamic Time Warping (DTW) and Bottleneck Bandwidth and Round-trip time (BBR), which takes the bottleneck fairness in consideration for higher transmission efficiency. The experiments validate that the proposed algorithm can improve the recognition rate of shared bottlenecks, increase bandwidth utilization, and ensure fairness at the bottleneck.