• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.195-215
• /
• 2021

Multipath Transport Control Protocol (MPTCP) is a transport layer protocol that enables multiple TCP connections across various paths. Due to path heterogeneity, it incurs more energy in a multipath wireless network. Recent work presents a set of approaches described in the literature to support systems for energy consumption in terms of their performance, objectives and address issues based on their design goals. The existing solutions mainly focused on the primary system model but did not discourse the overall system performance. Therefore, this paper capitalized a novel stochastically multipath scheduling scheme for data and path capacity variations. The scheduling problem formulated over MPTCP as a stochastic optimization, whose objective is to maximize the average throughput, avoid network congestion, and makes the system more stable with greater energy efficiency. To design an online algorithm that solves the formulated problem over the time slots by considering its mindrift-plus penalty form. The proposed solution was examined under extensive simulations to evaluate the anticipated stochastic optimized MPTCP (so-MPTCP) outcome and compared it with the base MPTCP and the energy-efficient MPTCP (eMPTCP) protocols. Simulation results justify the proposed algorithm's credibility by achieving remarkable improvements, higher throughput, reduced energy costs, and lower-end to end delay.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.275-284
• /
• 2010

The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.385-393
• /
• 2005

In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.3
• /
• pp.259-269
• /
• 2018

Multipath TCP (MPTCP) can be expected to provide improved network performance because it transmits data through multiple paths. However, Bufferbloat, which unexpectedly occurs in the transmission path, degrades not only the performance of the corresponding path but also the performance of other paths, so that the performance is worse than that of a single TCP. In this paper, we propose the transmission status monitoring method at the sender's MPTCP level and also HoL packets retransmission algorithm in order to solve the Bufferbloat problem. The proposed algorithm enables Bufferbloat detection by the sender side independently, and it can resolve the HoL blocking problem by identifying the HoL packet in the proposed transmission status monitoring buffer and retransmitting it to the normal path. Simulation results based on NS-3 show that the proposed algorithm achieves the improved throughput performance up to 22.8% compared to the existing MPTCP, and the average number of queued packets in the sender and receiver's buffers is decreased to 44.3% and 9.2%, respectively.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1057-1064
• /
• 2015

The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.