Sciweavers

Share
SIGCOMM
1997
ACM

Dynamics of Random Early Detection

10 years 7 months ago
Dynamics of Random Early Detection
In this paper we evaluate the effectiveness of Random Early Detection (RED) over traffic types categorized as nonadaptive, fragile and robust, according to their responses to congestion. We point out that RED allows unfair bandwidth sharing when a mixture of the three traffic types shares a link. This unfairness is caused by the fact that at any given time RED imposes the same loss rate on all flows, regardless of their bandwidths. We propose Flow Random Early Drop (FRED), a modified version of RED. FRED uses per-active-flow accounting to impose on each flow a loss rate that depends on the flow’s buffer use. We show that FRED provides better protection than RED for adaptive (fragile and robust) flows. In addition, FRED is able to isolate non-adaptive greedy traffic more effectively. Finally, we present a “two-packet-buffer” gateway mechanism to support a large number of flows without incurring additional queueing delays inside the network. These improvements are demons...
Dong Lin, Robert Morris
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1997
Where SIGCOMM
Authors Dong Lin, Robert Morris
Comments (0)
books