Hybrid Random Early Detection 


Vol. 27,  No. 12, pp. 1254-1261, Dec.  2002


PDF Full-Text
  Abstract

In this paper, we propose a new AQM algorithm, Hybrid RED (HRED). It combines the more effective elements of recent algorithms with a RED core. It decouples queue length management from adaptation to dynamic load in order to achieve high network utilization with low loss and delay in a simple and scalable manner. We analyze it to prove local stability and provide a simple configuration for quick response time. Throughout simulation, we demonstrate that HRED outperforms earlier AQM algorithms in stability and response time with straightforward selection of parameters for both steady load and changes in load.

  Statistics
Cumulative Counts from November, 2022
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]

C. Joo and S. Bahk, "Hybrid Random Early Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1254-1261, 2002. DOI: .

[ACM Style]

Chagnhee Joo and Saewoong Bahk. 2002. Hybrid Random Early Detection. The Journal of Korean Institute of Communications and Information Sciences, 27, 12, (2002), 1254-1261. DOI: .

[KICS Style]

Chagnhee Joo and Saewoong Bahk, "Hybrid Random Early Detection," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1254-1261, 12. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880