Equation-based congestion control for unicast applications

Floyd, Sally; Handley, Mark; Padhye, Jitendra; Widmer, Joerg

doi:10.1145/347057.347397

Cited by 880 publications

(531 citation statements)

References 8 publications

Supporting

Mentioning

523

Contrasting

Unclassified

Order By: Relevance

“…In addition to the above multi-path and coding techniques, as a transport protocol, TCP-friendly rate control for wired and wireless networks is also studied in various papers [11][12][13], so that the adverse effects of wireless packet losses and out-of-order packet delivery to TCP can be avoided while still avoiding the congestion collapse in the network. In fact, both the coding techniques as well as TCP-friendly transport layer solutions above can be integrated for an end-to-end reliable and TCP-friendly rate control.…”

Section: Coding Techniques and Transport Layer Effortsmentioning

confidence: 99%

An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

Arisoylu

2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we promote the packet function (e.g., packet size) -aware extension of the Dijkstra algorithm (i.e., PFA_SPF) as a base algorithm where any routing protocol can evolve it and integrate it with appropriate routing metrics. In particular, we propose a generic algorithm for packet function-aware path setup for multi-hop networks. The algorithm is based on a generic and novel extension of the classical Dijkstra algorithm in which the cost of each link is a non-negative-valued function of packet parameter(s) (e.g., packet size) rather than a scalar value. The algorithm minimizes the sum of the cost functions (e.g., total transmission delay or total energy consumption) experienced by each packet (e.g., maximizing the throughput) from the source to the destination node. We did initial analysis based on simulation of the algorithm for various random multi-hop wireless networks (e.g., 802.11), utilizing realistic link delay models. Finally, we demonstrate the initial significant potential performance improvements of our algorithm over the existing prior art.

show abstract

Section: Coding Techniques and Transport Layer Effortsmentioning

confidence: 99%

An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

Arisoylu

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…A new control algorithm that has been proposed to emulate the long-term behavior of the Reno throughput is the TCP-Friendly Rate Control (TFRC) [12,31]. TFRC aims at obtaining a smooth transmission rate dynamics along with friendliness toward Reno TCP [12].…”

Section: Related Workmentioning

confidence: 99%

“…TFRC aims at obtaining a smooth transmission rate dynamics along with friendliness toward Reno TCP [12]. To provide friendliness, a TFRC sender emulates the long-term behavior of a Reno connection using the equation model of the Reno throughput developed in [27].…”

Section: Related Workmentioning

confidence: 99%

“…ARC has been tested over many scenarios and compared with the TCP-Friendly Rate Control (TFRC), which is currently considered by the IETF for applications such as video streaming or telephony where a relative smooth sending rate is of importance [5,12,16]. In particular, single-and multibottleneck scenarios with and without lossy links and in the presence of homogeneous and heterogeneous traffic sources have been considered.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive rate control for streaming flows over the Internet

Grieco

Mascolo

2004

Multimedia Systems

View full text Add to dashboard Cite

The existing end-to-end TCP congestion control algorithm is well suited for applications that are not sensitive to delay jitter and abrupt changes of the transmission rate, such as FTP data transfer, but it is not recommended for delivering video data, whose perceived quality is sensitive to delay jitter and changes in the sending rate. In particular, the window-based control of Reno TCP congestion control causes burstiness in data transmission, which not only requires large buffers at the client side to provide a smooth playout but also may provoke bursts of lost packets difficult to recover via forward error correction techniques. This paper proposes an adaptive rate-based control (ARC) algorithm that striclty mimics the real-time dynamics of TCP and is based on an end-to-end mechanism to estimate the connection available bandwidth. Computer simulations using ns-2 have been developed to compare the ARC with the Reno TCP and with the TCP-Friendly Rate Control (TFRC) algorithm. Single-and multibottleneck scenarios in the presence of homogeneous and heterogeneous traffic sources have been considered. Simulations have shown that the ARC algorithm improves fairness and is friendly toward Reno. On the other hand, TFRC revealed itself not to be friendly toward Reno since it mimics only the long term behaviour of Reno TCP. Finally, simulations have shown that ARC remarkably improves the goodput with respect to TFRC and Reno in the presence of lossy links.

show abstract

“…Bansal and Balakrishnan [2] study binomial congestion control algorithms, which are a non-linear generalization of AIMD. Floyd et al [7] introduce the TFRC algorithm that adjusts its sending rate as a function of the measured loss rate. Bansal et al [3] investigate the behavior of slowly responsive congestion control algorithms.…”

Section: Introductionmentioning

confidence: 99%

Adaptive AIMD Congestion Control

Kesselman

Mansour

2005

Algorithmica

View full text Add to dashboard Cite

The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.

show abstract

Equation-based congestion control for unicast applications

Cited by 880 publications

References 8 publications

An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

Adaptive rate control for streaming flows over the Internet

Adaptive AIMD Congestion Control

Contact Info

Product

Resources

About