• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.70-77
• /
• 2015

In this paper, we present experimental results evaluating the performance of the Multipath TCP over shared bottleneck path in series of benchmark tests. In summary, we find that the Multipath TCP's fairness as well as its competitive responds to the change of network conditions such as latency, loss rate${\cdots}$ MPTCP is extremely unfair and powerful with regular TCP in ideal network conditions but its throughput decreases clearly even less than regular TCP in worse network conditions with very high latency, higher packet loss rate.

• Information and Communications Magazine
• /
• v.31 no.9
• /
• pp.9-16
• /
• 2014

인터넷의 핵심 프로토콜인 TCP의 성능을 획기적으로 개선시키기 위해 다수의 경로/인터페이스를 동시에 사용하는 Multipath TCP (MPTCP) 가 표준화되었다. 본고에서는 MPTCP에 대한 최신 표준화 동향과 연구개발 동향을 살펴보고 이를 통해 MPTCP와 관련된 향후 연구 이슈를 파악해 보도록 한다.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.445-453
• /
• 2016

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.448-450
• /
• 2019

Multipath TCP (MPTCP) is a standardized transport layer protocol for maximizing the use of finite network resources by using multiple interfaces simultaneously. If the characteristics of each path are the same, there is an advantage in terms of stability and bandwidth utilization compared to the existing single TCP. However, if the path characteristics are different, the performance is lower than that of a single TCP. There are many complex reasons for this, but one of the biggest impacts is the bufferbloat, which dramatically increases the latency. In this paper, we implemented an algorithm that improved MPTCP performance degradation due to bufferbloat in Linux - based testbed and compared performance with existing MPTCP scheduler.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3900-3916
• /
• 2019

The modern mobile devices are typically equipped with multiple network interfaces, e.g., 4G LTE, Wi-Fi, Bluetooth, but the current implementation of TCP can support only a single path at the same time. The Multipath TCP (MPTCP) leverages the multipath feature and provides (i) robust connection by utilizing another interface if the current connection is lost and (ii) higher throughput than single path TCP by simultaneously leveraging multiple network paths. However, if the performance between the multiple paths are significantly diverse, the receiver may have to wait for packets from the slower path, causing reordering and buffering problems. To solve this problem, previous MPTCP schedulers mainly focused on predicting the latency of the path beforehand. Recent studies, however, have shown that the path latency varies by a large margin over time, thus the MPTCP scheduler may wrongly predict the path latency, causing performance degradation. In this paper, we propose a new MPTCP scheduler called, choose fastest subflow (CFS) scheduler to solve this problem. Rather than predicting the path latency, CFS utilizes the characteristics of these paths to reduce the overall flow completion time by redundantly sending the last part of the flow to both paths. We compare the performance through real testbed experiments that implements CFS. The experimental results on both synthetic packet generation and actual Web page requests, show that CFS consistently outperforms the previous proposals in all cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1127-1136
• /
• 2017

In wireless networks, the packet loss due to the bit error is misinterpreted as loss due to the congestion state, so TCP congestion control occurs frequently and performance degradation occurs. This degradation also occurs in MPTCP(Multipath TCP), which is an extension protocol of original TCP. In MPTCP, the overall performance of the multipath is degraded. In this paper, we propose a congestion control scheme which measures the bandwidth on each path of MPTCP and reduces the congestion window size by the measured bandwidth when packet loss occurs, in order to solve the MPTCP performance degradation in the wireless environment. We also implemented the proposed congestion control in the Linux kernel and compared it with the original MPTCP in the testbed and real wireless networks. Experimental results show that the proposed congestion control has better throughput performance than original MPTCP congestion control in the wireless environment.

• Journal of Satellite, Information and Communications
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2017

Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.660-666
• /
• 2004

Overall TCP performance represented by end-to-end throughput is largely dependent upon its loss recovery performance. In particular non-congestion packet losses caused by transmission errors degrade TCP performance seriously. Using Markov process, we analyze TCP loss recovery performance for correlated packet losses caused by multipath fading. The results show that loss recovery performance can be severely affected by burstiness in packet losses, even if overall packet loss ratio is very low.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.28-37
• /
• 2017

Multipath TCP (MPTCP), which is a layer 4 protocol that can get the reliability and the efficiency of the transmission by using multipath transfer, was standardized by the IETF. MPTCP provides superior performance when compared to a single TCP when used in a homogeneous network with similar network characteristics. However, MPTCP degrades performance when used in heterogeneous networks with different network characteristics. In this paper, we propose 'Delay-alerted path-blocking scheduler'. It measures the delay of each path and blocks the path with a long delay to reduce the order of packets in the receive buffer. If the duplicated packet is sent to the blocked path to measure the delay and the congestion on the blocking path is reduced, the blocked path is unblocked. For performance analysis, the proposed scheduler was implemented in the Linux kernel and improved performance was obtained in the test bed. We also confirmed that the proposed scheduler reduces the degradation of MPTCP performance in real wireless networks with heterogeneous path characteristics.