This paper describes a mechanism we call "SRED" (stabilized random early drop). Like RED (random early detection) SRED pre-emptively discards packets with a load-dependent probability when a buffer in a router in the Internet or an intranet seems congested. SRED has an additional feature that over a wide range of load levels helps it stabilize its buffer occupation at a level independent of the number of active connections. SRED does this by estimating the number of active connections or flows. This estimate is obtained without collecting or analyzing state information on individual flows. The same mechanism can be used to identify flows that may be misbehaving, i.e. are taking more than their fair share of bandwidth. Since the mechanism is statistical in nature, the next step must be to collect state information of the candidates for "misbehaving", and to analyze that information. We show that candidate rows thus identified indeed have a high posterior probability of taking a larger than average amount of bandwidth.
[1]
Azer Bestavros,et al.
Self-similarity in World Wide Web traffic: evidence and possible causes
,
1996,
SIGMETRICS '96.
[2]
Mark Crovella,et al.
Characteristics of WWW Client-based Traces
,
1995
.
[3]
QUTdN QeO,et al.
Random early detection gateways for congestion avoidance
,
1993,
TNET.
[4]
Deborah Estrin,et al.
Recommendations on Queue Management and Congestion Avoidance in the Internet
,
1998,
RFC.
[5]
Robert Tappan Morris,et al.
Dynamics of random early detection
,
1997,
SIGCOMM '97.
[6]
Matthew Mathis,et al.
The macroscopic behavior of the TCP congestion avoidance algorithm
,
1997,
CCRV.