Host-to-Host Congestion Control for TCP

Abstract

Abstract-The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works. Performance characteristics of a particular version of TCP are defined by the congestion control algorithm it employs. This paper presents a survey of various congestion control proposals that preserve the original host-to-host idea of TCP-namely, that neither sender nor receiver relies on any explicit notification from the network. The proposed solutions focus on a variety of problems, starting with the basic problem of eliminating the phenomenon of congestion collapse, and also include the problems of effectively using the available network resources in different types of environments (wired, wireless, high-speed, long-delay, etc.). In a shared, highly distributed, and heterogeneous environment such as the Internet, effective network use depends not only on how well a single TCPbased application can utilize the network capacity, but also on how well it cooperates with other applications transmitting data through the same network. Our survey shows that over the last 20 years many host-to-host techniques have been developed that address several problems with different levels of reliability and precision. There have been enhancements allowing senders to detect fast packet losses and route changes. Other techniques have the ability to estimate the loss rate, the bottleneck buffer size, and level of congestion. The survey describes each congestion control alternative, its strengths and its weaknesses. Additionally, techniques that are in common use or available for testing are described.

A cross-layer jitter-based TCP for wireless networks

“…Given these issues, several TCP solutions have been proposed by researchers in order to improve TCP performance over heterogeneous networks [10]. At the time of writing, cross-layer approach can provide interesting solutions for TCP over wireless, since this approach does not violate the end-to-end semantics of TCP, by embedding all the modifications inside the sender and/or the receiver stack.…”

Game theoretical analysis of rate adaptation protocols conciliating QoS and QoE

“…The cross layer rate adaptation model provides a framework to optimize the output codec rate of a source node with feedback from the network in the form of RTCP signals [16,17]. We will focus on the rate adaptation based on optimizing QoE of the video obtained by the end user.…”

“…Note that the increment in rate can be modeled using different functions like logarithmic, linear or exponential functions. We chose here a squared function having a slow start followed by a rapid growth which makes our model resemblant to TCP to some extent [16,17]. We now describe the performance metrics which will be used in this work.…”

A Review on Snoop with Rerouting in Wired cumWireless Networks

“…Otherwise, it leaves the window size unchanged. Figure 1 [11] shows the expected rate is a theoretical rate of a TCP flow in a congestion-free network state. This rate can occur if all transmitted data packets are successfully acknowledged within the minimum RTT (i.e., no loss, no congestion).…”

“…Assuming that RTTmin is constant, the expected rate is directly proportional to the size of the congestion window with a proportionality coefficient of 1/RTTmin. The actual rate (bold solid line in Figure.1 [11]) can be expressed as the ratio between the current congestion window and the current RTT value. However, due to the finite capacity of the path, we can always find a point cwnd0 on the graph when the actual rate is numerically equal to the expected rate, and all attempts to send at a faster rates (i.e.,> cwnd0/RTTmin) will fail.…”