ABC: A Simple Explicit Congestion Controller for Wireless Networks

We propose Accel-Brake Control (ABC), a simple and deployable explicit congestion control protocol for network paths with time-varying wireless links. ABC routers mark each packet with an "accelerate" or "brake", which causes senders to slightly increase or decrease their congestion windows. Routers use this feedback to quickly guide senders towards a desired target rate. ABC requires no changes to header formats or user devices, but achieves better performance than XCP. ABC is also incrementally deployable; it operates correctly when the bottleneck is a non-ABC router, and can coexist with non-ABC traffic sharing the same bottleneck link. We evaluate ABC using a Wi-Fi implementation and trace-driven emulation of cellular links. ABC achieves 30-40% higher throughput than Cubic+Codel for similar delays, and 2.2X lower delays than BBR on a Wi-Fi path. On cellular network paths, ABC achieves 50% higher throughput than Cubic+Codel

Equilibrium of Heterogeneous Congestion Control: Optimality and Stability

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the current theory based on utility maximization fails to predict the network behavior. The pricing signals can be different types of signals such as packet loss, queueing delay, etc, or different values of the same type of signal such as different ECN marking values based on the same actual link congestion level. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, suboptimal and unstable. In Tang et al. (“Equilibrium of heterogeneous congestion control: Existence and uniqueness,” IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 824–837, Aug. 2007), existence and uniqueness of equilibrium of heterogeneous protocols are investigated. This paper extends the study with two objectives: analyzing the optimality and stability of such networks and designing control schemes to improve those properties. First, we demonstrate the intricate behavior of a heterogeneous network through simulations and present a framework to help understand its equilibrium properties. Second, we propose a simple source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns by only updating a linear parameter in the sources’ algorithms on a slow timescale. It steers a network to the unique optimal equilibrium. The scheme can be deployed incrementally as the existing protocol needs no change and only new protocols need to adopt the slow timescale adaptation

Simulation based Study of TCP Variants in Hybrid Network

© ASEE 2011Transmission control protocol (TCP) was originally designed for fixed networks to provide the reliability of the data delivery. The improvement of TCP performance was also achieved with different types of networks with introduction of new TCP variants. However, there are still many factors that affect performance of TCP. Mobility is one of the major affects on TCP performance in wireless networks and MANET (Mobile Ad Hoc Network). To determine the best TCP variant from mobility point of view, we simulate some TCP variants in real life scenario. This paper addresses the performance of TCP variants such as TCP-Tahoe, TCP-Reno, TCP-New Reno, TCPVegas, TCP-SACK and TCP-Westwood from mobility point of view. The scenarios presented in this paper are supported by Zone routing Protocol (ZRP) with integration of random waypoint mobility model in MANET area. The scenario shows the speed of walking person to a vehicle and suited particularly for mountainous and deserted areas. On the basis of simulation, we analyze Round trip time (RTT) fairness, End-to-End delay, control overhead, number of broken links during the delivery of data. Finally analyzed parameters help to find out the best TCP variant

QoS evaluation of different TCPs congestion control algorithm using NS2

The success of the current Internet relies to a large extent on cooperation between the users and network. The network signals its current state to the users by marking or dropping packets. The user then strives to maximize the sending rate without causing network congestion. To achieve this, the users implement a flow control algorithm that controls the rate at which data packets are sent into the Internet. More specifically, the Transmission Control Protocol (TCP) is used by the users to adjust the sending rate in response to changing network conditions. In this paper, we focus on the degree of fairness provided to TCP connections by comparing two packet-scheduling algorithms at the router. The first one is FIFO (First In First Out, or Drop-Tail), which is widely used in the current Internet routers because of its simplicity. The second is RED (Random Early Detection), which drops incoming packets at a certain probability

STCP: A New Transport Protocol for High-Speed Networks

Transmission Control Protocol (TCP) is the dominant transport protocol today and likely to be adopted in future high‐speed and optical networks. A number of literature works have been done to modify or tune the Additive Increase Multiplicative Decrease (AIMD) principle in TCP to enhance the network performance. In this work, to efficiently take advantage of the available high bandwidth from the high‐speed and optical infrastructures, we propose a Stratified TCP (STCP) employing parallel virtual transmission layers in high‐speed networks. In this technique, the AIMD principle of TCP is modified to make more aggressive and efficient probing of the available link bandwidth, which in turn increases the performance. Simulation results show that STCP offers a considerable improvement in performance when compared with other TCP variants such as the conventional TCP protocol and Layered TCP (LTCP)