Download:
|
by Thomas Ziegler, Serge Fdida, Ulrich Hofmann
Flows in the Internet", Proceedings of IFIP Broadband Communications 99
http://www-rp.lip6.fr/~costa/publications/ziegler/red+_bbc4.ps.gz
Add To MetaCart
Abstract:
Abstract-- This paper proposes an add-on to the well known RED (Random Early Detection) algorithm called RED+. RED+ adds the functionality of identifying and discriminating high-bandwidth, unfriendly best-effort flows to RED gateways. It is based on the observation that unfriendly flows have higher arrival rates in times of congestion than friendly flows. Hence unfriendly flows can be discriminated if packets arriving at a router output-port are dropped as a function of RED's average queue size and the arrival-rate of the packet's flow. RED+ is scalable regarding the amount per flow information stored in routers as it only allocates per-flow state for the n highest bandwidth flows, where n is a configurable parameter. As shown by simulation, RED+ is able to identify and discriminate unresponsive flows avoiding problems of unfairness and congestion collapse.
Citations
|
1790
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
1681
|
Random Early Detection Gateways for Congestion Avoidance
– Floyd, Jacobson
- 1993
|
|
939
|
Analysis and Simulation of a Fair Queueing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
594
|
Promoting the Use of End-to-End Congestion Control in the Internet
– Floyd, Fall
- 1999
|
|
343
|
A Proposal to add Explicit Congestion Notification (ECN) to IP", RFC2491
– Ramakrishnan, Floyd
- 1999
|
|
335
|
Dynamics of random early detection
– Lin, Morris
- 1997
|
|
297
|
Explicit Allocation of Best Effort Packet Delivery Service”, http:// www.ietf.org/html.charters/diffserv-charter.html
– Clark
|
|
235
|
Hierarchical packet fair queueing algorithms
– Bennett, Zhang
- 1996
|
|
211
|
On Traffic Phase Effects in Packet-Switched Gateways
– Floyd, Jacobson
- 1992
|
|
171
|
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
– Stoica, Shenker, et al.
- 1998
|
|
153
|
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
– Goyal, Vin, et al.
- 1997
|
|
144
|
Congestion Avoidance in Computer Networks with A Connectionless Network Layer: Part IV: A Selective Binary Feedback Scheme for General Topologies
– Ramakrishnan, Jain, et al.
- 1987
|
|
119
|
Modified TCP Congestion Avoidance Algorithm,” end2end-interest mailing list (ftp://ftp.ee.lbl.gov/email/vanj.90apr30.txt
– Jacobson
- 1990
|
|
96
|
SRED: stabilized red
– Ott, Lakshman, et al.
- 1999
|
|
45
|
Stochastic Fairness Queueing
– McKenney
- 1990
|
|
44
|
et al., "An Architecture for Differentiated Services", RFC 2475
– Blake
- 1998
|
|
14
|
et al., "Recommendations on Queue
– Braden
- 1998
|
|
6
|
TCP and explicit congestion notification." A PostScript version of this document is available from ftp://ftp.ee.lbl.gov/papers/tcp ecn.4.ps.Z
– Floyd
- 1994
|
|
3
|
Round Robin Scheduling for Max-Min Fairness
– Hahne
- 1991
|
|
2
|
et al, " The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm
– Mathis
- 1997
|
|
2
|
RED+ Gateways for detection and discrimination of unresponsive flows
– Ziegler, Hofmann, et al.
- 1998
|
|
1
|
A distributed Mechanism for detection and discrimination of non-TCP-friendly Flows
– Ziegler, Fdida, et al.
|
