An Effective RED Algorithm for Congestion Control in the Internet


The KIPS Transactions:PartC, Vol. 10, No. 1, pp. 39-44, Feb. 2003
10.3745/KIPSTC.2003.10.1.39,   PDF Download:

Abstract

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Early Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly. We propose the Effective RED algorithm to solve with the weakness of RED. In this algorithm the maximum drop probability decides to accept or drop the incoming packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS (Network Simulator)-2.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. J. Jung and D. H. Lee, "An Effective RED Algorithm for Congestion Control in the Internet," The KIPS Transactions:PartC, vol. 10, no. 1, pp. 39-44, 2003. DOI: 10.3745/KIPSTC.2003.10.1.39.

[ACM Style]
Kyu Jung Jung and Dong Ho Lee. 2003. An Effective RED Algorithm for Congestion Control in the Internet. The KIPS Transactions:PartC, 10, 1, (2003), 39-44. DOI: 10.3745/KIPSTC.2003.10.1.39.