Paper #19

A Rate Based RED Mechanism

Stefaan De Cnodder, Kenny Pauwels
& Omar Elloumi
Alcatel Belgium


The Random Early Detection (RED) algorithm [8] is becoming a de-facto standard for congestion avoidance in the Internet and other packet switched networks. Recently several research and working groups have been discussing parameter settings of RED. Although there were some recommendations dealing with the adequate settings of RED parameters, and some router vendors suggest some default values, the research community is still debating and still lacking the exact engineering rules network operators are looking for [13]. With the recent increasing interest in Differentiated Services, where packets with different priorities can share the same queue and where an enhanced variant of RED, i.e. weighted RED or n-RED, handling different priorities is used, the parameter settingsU complexity increases accordingly. We propose Rate Based n-RED (RB n-RED): a new active queue management algorithm that preserves the design principles of RED and results in the same behavior as RED while reducing the number of parameters to only one. The basic idea is that the rate at which packets are dropped is a function of the long-term average arrival rate in addition to the average queue size used for RED. Our simulation results show that in all the cases RB n-RED gives the same performance results as a "well-configured" n-RED.
Download a copy of this paper in either: Compressed PostScript (195K) - or - PDF (256K) format.

Back to the NOSSDAV 2000 On-Line Proceedings.


- Last revised: Weds Jun 27 20:56:29 EDT 2000