Download:
|
by Ratul Mahajan, Sally Floyd
http://www.aciri.org/red-pd/red-pd.ps
Add To MetaCart
Abstract:
One weakness of the FIFO scheduling typical of routers in the current Internet is that there is no protection against misbehaving flows that send more than their share, or fail to use conformant end-to-end congestion control. This paper investigates RED-PD (RED with Preferential Dropping), a mechanism that uses the packet drop history at the router to detect high-bandwidth flows in times of congestion, and preferentially drops packets from these high-bandwidth flows to control the bandwidth received by these flows at the congested queue. This paper discusses the design decisions underlying RED-PD, and presents simulations evaluating RED-PD in a range of environments. 1
Citations
|
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
|
|
827
|
Modeling TCP Throughput: a Simple Model and its Empirical Validation
– Padhye, Firoiu, et al.
- 1998
|
|
594
|
Promoting the Use of End-to-End Congestion Control in the Internet
– Floyd, Fall
- 1999
|
|
551
|
Equation-Based Congestion Control for Unicast Applications
– Floyd, Handley, et al.
- 2000
|
|
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
|
|
186
|
Efficient fair queuing using deficit round robin
– Shreedhar, Varghese
- 1995
|
|
171
|
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
– Stoica, Shenker, et al.
- 1998
|
|
161
|
TCP Selective Acknowledgments Options
– Mathis, Mahdavi, et al.
- 1996
|
|
159
|
The nature of the beast: Recent traffic measurements from an Internet backbone
– claffy, Miller, et al.
- 1998
|
|
116
|
Router Mechanisms to Support End-to-End Congestion Control. ftp://ftp.ee.lbl.gov/papers/collapse.ps
– Fall, Floyd
- 1997
|
|
113
|
Blue: A new Class of Active Queue Management Algorithms
– Feng, Kandlur, et al.
- 1999
|
|
21
|
bandwidth sharing among adaptive and nonadaptive flows in the Internet
– Anjum, Tassiulas, et al.
- 1999
|
|
15
|
Estimating arrival rates from the RED packet drop history
– Floyd, Fall, et al.
- 1998
|
|
15
|
Stochastic Fairness Queuing
– McKenney
|
|
14
|
Konstantinos Psounis. CHOKe, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
– Pan, Prabhakar
- 2000
|
|
13
|
Load-tolerant differentiation with active queue management
– Bodin, Schelen, et al.
- 2000
|
|
9
|
Controlling high bandwidth aggregates
– Mahajan, Bellovin, et al.
- 2001
|
|
7
|
LRU-RED: An active queue management scheme to contain high bandwidth flows at congested routers
– Smitha, Reddy
- 2001
|
|
5
|
Early Regulation of Unresponsive Flows
– Rangarajan
- 1999
|
|
2
|
AR99] Anurag Acharya and Anand Rangarajan. Early Regulation of Unresponsive Flows
– Anjum, Tassiulas
- 1999
|
|
2
|
Pages: Distributed Weighted Random Early Detection. http://www.cisco.com/univercd/cc/td/doc/ product /software/ios111/cc111/wred.htm
– Web
- 1998
|
|
2
|
A Measurement Study of Traffic on a Wide-area Link
– Mahajan, Floyd, et al.
- 2000
|
