Load Early Detection (LED): A Congestion Control Algorithm Based on Routers' Traffic Load
TL;DR: This paper presents a new and simple congestion control scheme, called Load Early Detection (LED), that achieves high link efficiency and low persistent queue length, and evaluates the performance of LED using extensive ns2 simulations over a wide range of network scenarios.
read more
Abstract: Efficient bandwidth allocation and low delays remain important goals, especially in highspeed networks. Existing end-to-end congestion control schemes (such as TCP+AQM/RED) have significant limitations to achieve these goals. In this paper, we present a new and simple congestion control scheme, called Load Early Detection (LED), that achieves high link efficiency and low persistent queue length. The major novelty of LED is that it gauges the congestion level by measuring the traffic load instead of the queue length. We show analytically that this feature of LED enables it to detect congestion earlier and react faster than other schemes. To gain insight into the behavior of LED and compare it with RED, we analyze a simple fluid model, and study the relation between stability and throughput, especially for low delays. We evaluate the performance of LED using extensive ns2 simulations over a wide range of network scenarios. Our simulation results show that LED achieves significantly higher link efficiency than RED (up to 83%), REM (up to 141%), and PI controller (up to 88%), especially in the presence of low delays.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach
Makoto Ikeda,Leonard Barolli,G. De Marco,Arjan Durresi,A. Koyama,Mimoza Durresi +5 more
- 04 Jul 2006
TL;DR: New algorithms based on fuzzy logic and genetic algorithm which use for admission control and routing many QoS parameters and the performance of the network extraction topology algorithm which reduces the search space of the proposed GA-based routing approach are evaluated.
25
Transient Analysis of a Tandem Communication Network with Dynamic Bandwidth Allocation having Two Stage Direct Bulk Arrivals
TL;DR: The sensitivity analysis of the model provides evidence that the dynamic bandwidth allocation strategy along with bulk arrival consideration can provide the performance of the network more close to the reality and avoid burstness in buffers.
Clustering and Classification (Time Series analysis) Based Congestion Control algorithm: Data Mining Approach
Manoj Devare,Ajay Kumar +1 more
- 01 Jan 2007
TL;DR: A new approach is given to predict the congestion by historical data points to find the future intensity of the traffic in the network by using actual network test-bed.
Understanding congestion control algorithms in tcp using opnet
T. Álvarez,L. Nicolas,V. Álvarez +2 more
- 01 Jan 2010
TL;DR: A combined approach of ready and self-programmed methods combined with tutorials using OPNET is presented, which aims to solve the problem of congestion on the basis of classical and new approaches.
1
AMJD resource allocation and picoseconds analysis for the data transfer to avoid the network congestion and limit the queuing time for clients
C. Jamunadevi,S. Deepa,B. Bharathi,V. Manikandan +3 more
- 01 Dec 2010
TL;DR: In this paper, the authors dealt with the problem of data transfer that incurs the congestion and resource allocation problems in between server and client and switched the control between the clients is to be made through AMJD approach.
References
Random early detection gateways for congestion avoidance
Sally Floyd,Van Jacobson +1 more
TL;DR: Red gateways are designed to accompany a transport-layer congestion control protocol such as TCP and have no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time.
On the self-similar nature of Ethernet traffic (extended version)
TL;DR: It is demonstrated that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
On the self-similar nature of Ethernet traffic
Will E. Leland,Murad S. Taqqu,Walter Willinger,Daniel V. Wilson +3 more
- 01 Oct 1993
TL;DR: In this paper, the authors demonstrate that Ethernet local area network (LAN) traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
Promoting the use of end-to-end congestion control in the Internet
Sally Floyd,Kevin Fall +1 more
TL;DR: It is argued that router mechanisms are needed to identify and restrict the bandwidth of selected high-bandwidth best-effort flows in times of congestion, and several general approaches are discussed for identifying those flows suitable for bandwidth regulation.
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Vishal Misra,Weibo Gong,Don Towsley +2 more
- 28 Aug 2000
TL;DR: This paper uses jump process driven Stochastic Differential Equations to model the interactions of a set of TCP flows and Active Queue Management routers in a network setting and presents a critical analysis of the RED algorithm.
Related Papers (5)
Zhenyu Na,Qing Guo +1 more
- 17 Aug 2011
B.K. Ng,Md. Siam Uddin,A.A.Y.M. Abusin,David Chieng +3 more
- 12 Dec 2005