Multipath Congestion Control Research Articles

MFAST: A Multipath Congestion Control Protocol for High Bandwidth-Delay Connection

Today, the smart devices are usually equipped with more than one network interfaces. A multipath congestion control protocol that exploits different paths to transmit data will improve the throughput and high-availability. Many multipath congestion control protocols have been developed in the literature. However, most of them are loss-based algorithms, hence they do not well utilize the bandwidth in high bandwidth-delay product (BDP) connections due to the conservative congestion control. From the single-path Fast TCP, we develop a multipath congestion control protocol, called mFast, for high BDP connections. MFast uses queueing delay to measure the congestion as Fast TCP does. Our framework is based on a network utility maximization model for multipath flows. The features of mFast such as load-balancing, TCP friendliness, and throughput improvement are verified via analysis and extensive simulations.

Optimal multipath congestion control and request forwarding in information-centric networks: Protocol design and experimentation

In this paper we consider the problem of joint congestion control and request forwarding in Information-Centric Networks, namely the named-data networking architecture (NDN). The network architecture we consider is based on information retrieval natively pull-based, driven by user requests, point-to-multipoint and intrinsically coupled with in-network caching. We formalize the problem as global optimization with non-linear objectives and linear constraints with the twofold objective of maximizing user throughput and minimizing overall network cost. We solve it via decomposition and derive a family of optimal congestion control strategies at the receiver and of distributed algorithms for dynamic request forwarding at network nodes. An experimental evaluation of our proposal is carried out in different network scenarios using realistic workloads, to assess the performance of our design and to highlight the benefits of an ICN approach. The experimentation is carried out using the NDN software router implementation on a large grid infrastructure deployed to enable experimental research.

Performance Enhancement of Multipath TCP for Wireless Communications With Multiple Radio Interfaces

Multipath transmission control protocol (MPTCP) allows a TCP connection to operate across multiple paths simultaneously and becomes highly attractive to support the emerging mobile devices with various radio interfaces and to improve resource utilization as well as connection robustness. The existing multipath congestion control algorithms, however, are mainly loss-based and prefer the paths with lower drop rates, leading to severe performance degradation in wireless communication systems, where random packet losses occur frequently. To address this challenge and improve the performance of MPTCP in wireless networks, this paper proposes a new mVeno algorithm, which makes full use of the congestion information of all the subflows belonging to a TCP connection in order to adaptively adjust the transmission rate of each subflow. Specifically, mVeno modifies the additive increase phase of Veno so as to effectively couple all subflows by dynamically varying the congestion window increment based on the receiving ACKs. The weighted parameter of each subflow for tuning the congestion window is determined by distinguishing packet losses caused by random error of wireless links or by network congestion. We implement mVeno in a Linux server and conduct extensive experiments both in test bed and in real WAN to validate its effectiveness. The performance results demonstrate that compared with the existing schemes, mVeno increases the throughput significantly, achieves load balancing, and can keep the fairness with regular TCP.

Congestion Control Design for Multipath Transport Protocols: A Survey

High-quality services over wired and wireless networks require high bitrate network content delivery. Multipath transport protocols utilize multiple paths to support increased throughput for network applications. Ubiquitous mobile devices with multiple interfaces such as WiFi and 4G/5G cellular, and data centers supporting big data analysis and cloud-computing, motivate adoption of multipath transmission in current and future network architectures. Congestion control mechanisms play a fundamental role in these multipath transport protocols. Diverse approaches have been proposed in the literature, differing in terms of their goals, principles, performance, and mostly in how various issues are addressed in their design. This paper presents a survey of congestion control solutions for multipath transport protocols and discusses the multipath congestion control design in order to address the need for some desirable properties including TCP-friendliness, load balancing, stability, and Pareto optimality. Existing window-based and rate-based multipath congestion control algorithms are investigated and categorized based on their theoretical algorithm design. Next, this paper discusses the congestion control mechanisms used in diverse multipath transport protocols in the context of different network scenarios. Finally, the trends in the future multipath congestion control design are presented.

A Family of Stable Multipath Dual Congestion Control Algorithms

We consider the problem of multipath congestion control in the Internet. The aim is to take advantage of multiple paths diversity to achieve efficient bandwidth allocation and improve network efficiency. But there exist some potential difficulties when one directly uses the well-known network utility maximization model to design stable multipath congestion control algorithms for the alternative paths. In this paper, we propose a generalized multipath utility maximization model to consider the problem of joint routing and rate control, which can be reduced to specific models with different parameter settings. And then we develop a family of multipath dual congestion control algorithms which are stable in the absence of delays. We also derive decentralized and scalable sufficient conditions for a particular scheme when propagation delays exist in networks. The simulation results show that the proposed multipath dual congestion control algorithms with appropriate parameter settings can achieve stable resource shares while maintaining fairness among the involved users.

Dynamic Queue and TCP based Multipath Congestion Control Scheme for Wired Network

High speed wired communication are large bandwidth utilized network but shared by multiple sender that is crucial challenge for congestion control for that types of network. This paper identifies that dynamic queue and multipath based routing strategies for wired networks are more suitable for congestion control and memory management as compared to existing queue based congestion control, paper describe about existing queue techniques that is RED, Drop-tail etc. and its result impact than compare their results with proposed dynamic base multipath routing in wired network scenario and conclude that in proposed mechanism better bandwidth utilized and control the congestion as well as data drop in multiple sender environment. The results retrieved from network simulator-2 and analyzed the performance of packet delivery ratio, throughput, TCP and UDP data sends and receives in proposed environment deployed based.

INTRUSION DETECTION AND MULTIPATH CONGESTION CONTROL FOR HETEROGENEOUS TRAFFIC IN WIRELESS SENSOR NETWORK

A heterogeneous wireless sensor networks (HWSNs) consists of two or more types of nodes. The redundancy management of various wireless sensor networks uses multipath routing to answer user queries in the presence of defective and malicious nodes. The fixed method uses a novel probability model to analyze the best redundancy level in terms of path redundancy (mp) and source redundancy (ms), as well as the best interruption detection settings in terms of the number of voters (m) under which the lifetime of a heterogeneous wireless sensor network is maximized while satisfying the reliability, timeliness and security, In this paper we propose an efficient scheme to control multipath congestion so that the sink can get priority based throughput for heterogeneous data. We have used packet service ratio for detecting congestion as well as performed hop-by-hop multipath congestion control based on that metric. Finally, simulation results have demonstrated the effectiveness of our proposed approach.

A family of multi-path congestion control algorithms with global stability and delay robustness

The goal of traffic management is to efficiently allocate network resources via adjustment of source transmission rates and routes selection. Mathematically, it aims to solve a traditional utility maximization problem in a fair and distributed manner. In this paper, we first develop a generalized multi-path utility maximization problem which features a weighted average of the classical Kelly’s formulation and the Voice’s model. Next, we design from this broader framework a family of multi-path dual congestion control algorithms whose equilibrium point can both achieve a desired bandwidth utilization and preserve a notion of fairness among competing users. Global stability can be guaranteed for the proposed schemes in the absence of delays by use of a totally novel Lyapunov function. Moreover, when heterogeneous propagation delays are taken into account, we establish decentralized and scalable sufficient conditions for robust global stability by constructing a reasonable Lyapunov–Krasovskii functional candidate. These conditions give estimates for the maximum admissible delays that the controller can tolerate without losing stability. Finally, we verify the results through simulation.

MReno: a practical multipath congestion control for communication networks

In current networks, end-user devices are usually equipped with several network interfaces. The design of a multipath protocol that can cooperate with current single-path transport protocols is an interesting research field. Most previous works on multipath network utility maximization (NUM) lead to rate-based control protocols. Moreover, these studies do not model a case in which paths from a source may have different characteristics. Thus, these approaches are difficult to deploy to the Internet. In this paper, we introduce a multipath NUM model for a network with both multipath and single-path users. The proposed algorithm converges to a global solution to the multipath NUM. Based on the mathematical framework, we develop a multipath TCP called mReno. Analysis and simulations indicate that mReno is completely compatible with TCP Reno and achieves load-balance, fairness, and performance improvement targets.

A Study of Fair Bandwidth Sharing with AIMD-Based Multipath Congestion Control

The multi-homed capability offers a good opportunity to explore multipath transmission. To ensure fair bandwidth sharing between multipath flows and legacy single-path flows, congestion control is an essential mechanism at the transport layer to regulate traffic flows for bandwidth consumption. However, in a multipath scenario, the congestion control algorithm of the dominant transport control protocol (TCP) may result in too aggressive behavior. In this paper, we consider the generic congestion control principle of additive increase and multiplicative decrease (AIMD) and investigate two AIMD-based multipath congestion control solutions. We derive the conditions for AIMD parameters to ensure TCP-friendliness and satisfy two constraints for fair bandwidth sharing between multipath and single-path flows. Simulation results demonstrate that the AIMD-based multipath solutions well achieve the fairness goals.

A Multipath Energy Efficient Congestion Control Scheme for Wireless Sensor Network

Problem statement: In most of the existing works either detection of congestion or scheme for congestion control in wireless sensor networks are presented. A very few works have been done, taken in to account of both congestion detection and congestion control. In most of the congestion detection works they have not achieved accuracy in detecting congestion and have resulted with high latency time. Approach: In this study, we propose to design a multi-path energy efficient congestion control scheme to reduce the packet loss due to congestion. In our congestion detection approach, we follow a combined congestion estimation technique taking in to account on three main parameters specifically queue size, contention and traffic rate. For the congestion control, we design a rate control technique and a multipath routing protocol. Results and Conclusion: Simulation results show that our proposed approach achieves better throughput and packet delivery ratio with reduced delay, packet drop and energy.

A Multipath Cubic TCP Congestion Control with Multipath Fast Recovery over High Bandwidth-Delay Product Networks

Cubic TCP, one of transport protocols designed for high bandwidth-delay product (BDP) networks, has successfully been deployed in the Internet. Multi-homed computers with multiple interfaces to access the Internet via high speed links will become more popular. In this work, we introduce an extended version of Cubic TCP for multiple paths, called MPCubic. The extension process is approached from an analysis model of Cubic by using coordinated congestion control between paths. MPCubic can spread its traffic across paths in load-balancing manner, while preserving fair sharing with regular TCP, Cubic, and MPTCP at common bottlenecks. Moreover, to improve resilience to link failure, we propose a multipath fast recovery algorithm. The algorithm can significantly reduce the recovery time of data rate after restoration of failed links. These techniques can be useful for resilient high-bandwidth applications (for example, tele-health conference) in disaster-affected areas. Our simulation results show that MPCubic can achieve stability, throughput improvement, fairness, load-balancing, and quick data rate recovery from link failure under a variety of network conditions. key words: multipath congestion control, Cubic TCP for multiple paths, load-balancing, resource pooling, fairness, resilience, disaster

Path selection and multipath congestion control

In this paper, we investigate the benefits that accrue from the use of multiple paths by a session coupled with rate control over those paths. In particular, we study data transfers under two classes of multipath control, coordinated control where the rates over the paths are determined as a function of all paths, and uncoordinated control where the rates are determined independently over each path. We show that coordinated control exhibits desirable load balancing properties; for a homogeneous static random paths scenario, we show that the worst-case throughput performance of uncoordinated control behaves as if each user has but a single path (scaling like log(log(N))/ log(N) where N is the system size, measured in number of resources), whereas coordinated control yields a worst-case throughput allocation bounded away from zero. We then allow users to change their set of paths and introduce the notion of a Nash equilibrium. We show that both coordinated and uncoordinated control lead to Nash equilibria corresponding to desirable welfare maximizing states, provided in the latter case, the rate controllers over each path do not exhibit any round-trip time (RTT) bias (unlike TCP Reno). Finally, we show in the case of coordinated control that more paths are better, leading to greater welfare states and throughput capacity, and that simple path reselection polices that shift to paths with higher net benefit can achieve these states.

MPCC: Optimal Congestion Control for Multipath Routing in Ad Hoc Networks

Based on the inherent characteristic of the contention relationship between flows in Ad hoc networks,a notion of the link's interference set is introduced,it extends the multipath utility maximization formulating the congestion control problem for multipath routing in Internet to that in Ad hoc networks.As the objective function is not strictly concave in the path rate,the penalty function method is applied to transform the primal problem into a new formulation to obtain the optimal solution based on the subgradient method.And the multiPath congestion control algorithm(MPCC) is also proposed.It can be implemented in a parallel fashion at each source/link.Simulation results show that MPCC can quickly quickly converge to globally optimal solutions;and,compared to the additive-increase-multiplicative-decrease(AIMD) algorithm in TCP-Reno,MPCC is more adaptive to time-varying network situations,and achieves better network performance.And thus it can be used to the practical Ad hoc networks.