Study of ARED algorithm based on the 2nd order difference equation
Authors: 
Xunli Fan, Feng Zheng, Lin Guan, Jie Wang, Li Gao, Xingang WangAuthors Info & Claims
Xunli Fan, Feng Zheng, Lin Guan, Jie Wang, Li Gao, Xingang WangAuthors Info & ClaimsPages 110 - 117
Abstract
This paper proposes a novel internal structure of the Adaptive Random Early Detection (ARED) algorithm through time-domain analysis using the classical control theory, which is based on the Active Queue Management (AQM) scheme. A new discrete-time controller has been developed based on the 2nd order difference equation and embedded it into the AQM algorithm. The experiments are conducted based on the NS-2 simulation platform to demonstrate the credibility of the proposed mechanism. Simulation results show that the 2nd order difference ARED (2DE-ARED) algorithm is able to keep the instantaneous queue length more stable and it has better control capability in terms of performance of both good-puts and loss rate.
References
[1]
V. Jacobson. Congestion avoidance and control. ACM SIGCOMM Computer Communication Review, 1995, Vol. 25 (1), pp157--187.
[2]
S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ ACM Transactions on Networking, 1993, Vol. 1(4), pp397--413.
[3]
W. C. Feng, D. D. Kandlur, D. Saha and K. G. Shin. A self-configuring RED gateway. In Proceedings of IEEE INFOCOM '99. Vol. 3, pp1320--1328.
[4]
S. Floyd, R. Gummadi and S. Shenker. Adaptive RED: An algorithm for increasing the robustness of RED's active queue management. August 2001. http://www.icir.org/floyd/papers/adaptiveRed.pdf
[5]
C. Hollot, V. Misra, D. Towsley, et al. A control theoretic analysis of RED. in Proceedings of IEEE INFOCOM 2001, Vol. 3, pp1510--1519
[6]
B. Zheng and M. Atiquzzaman. A framework to determine bounds of maximum loss rate parameter of RED queue for next generation routers. Journal of Network and Computer Applications, 2008, Vol. 31 (4), pp429--445
[7]
M. Zamani, M. Karimi-Ghartemain, N. Sadati, et al. Design of a fractional order PID controller for an AVR using particle swarm optimization. Control Engineering Practice, 2009, Vol. 17(12), pp1380--1387
[8]
W. Chen, S. H. Yang. The mechanism of adapting RED parameters to TCP traffic. Computer Communications, 2009, Vol. 32(13), pp1525--1530.
[9]
B. Wang, B. Kasthurirangan, J. Xu. Subsidized RED: An AQM mechanism for short-lived flows. Computer Communications, 2005, Vol. 28(5), pp540--549
[10]
S. T. Guo, G Feng, X. F. Liao, et al, Novel delay-range-dependent stability analysis of the second-order congestion control algorithm with heterogenous communication delays. Journal of Network and Computer Applications, 2009, Vol. 32(3), pp568--57
Index Terms
- Study of ARED algorithm based on the 2nd order difference equation
Recommendations
Analysis of a Network of AQM Router Supporting TCP Flows and Comparison with XCP
EAIT '14: Proceedings of the 2014 Fourth International Conference of Emerging Applications of Information TechnologyThe most important issues in the Internet are congestion control. Queue management is an important part to provide better link utilization and fair service of buffer at the Internet router so as to control the congestion. To provide this we can ...
One more bit is enough
SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communicationsAchieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (eg TCP) and traditional congestion notification schemes (...
The Research of an Improved Algorithm for Active Queue Management with BP
IS3C '12: Proceedings of the 2012 International Symposium on Computer, Consumer and ControlActive Queue Management (AQM) acts as an enhanced mechanism for end-to-end congestion controlling. It can improve the queue length and usability of data links by the method of drop the packets among nodes in the network. In this paper, we describe the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Beijing Jiaotong University
- Operations Research Society of China
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QTNA '10
Sponsor:
QTNA '10: International Conference on Queueing Theory and Network Applications
July 24 - 26, 2010
Beijing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 68Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in