See this document in CiteSeerX!

Controlling High-Bandwidth Flows at the Congested Router (2001)  (Make Corrections)  (41 citations)
Ratul Mahajan, Sally Floyd, David Wetherall



  Home/Search   Context   Related

 
View or download:
washington.edu/hom...icnp2001redpd.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  washington.edu/hom...pubsntalks (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: FIFO queueing is simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control, but also short round-trip time TCP flows. At the other extreme, per-flow scheduling mechanisms provide max-min fairness but are more complex, keeping state for all flows going through the router. This paper presents RED-PD, a mechanism that combines simplicity and protection by keeping state for just the high-bandwidth flows. RED-PD uses... (Update)

Cited by:   More
A new approach to Service Differentiation: - Non-Congestive Queueing Mamatas (2005)   (Correct)
Defending Against Low-rate TCP Attacks: Dynamic Detection and .. - Haibin Sun John (2004)   (Correct)
On the Effect of Router Buffer Sizes on Low-Rate Denial of .. - Sandeep Sarat Andreas   (Correct)

Similar documents (at the sentence level):
35.2%:   Controlling High Bandwidth Flows at the Congested Router - Ratul Mahajan And (2001)   (Correct)
11.7%:   Controlling High-Bandwidth Flows at the Congested Router - Ratul Mahajan And (2001)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Internet Traffic Engineering - Mortier (2002)   (Correct)
0.2:   Decoupling Congestion Control and Bandwidth Allocation Policy.. - Katabi   (Correct)
0.2:   A Flow Table-Based Design to Approximate Fairness - Pan, Breslau, Prabhakar..   (Correct)

Similar documents based on text:   More   All
0.6:   Promoting the Use of End-to-End Congestion Control in the Internet - Floyd, Fall (1999)   (Correct)
0.5:   Router Mechanisms to Support End-to-End Congestion Control - Floyd, Fall (1997)   (Correct)
0.4:   Controlling High Bandwidth Aggregates in the Network - Mahajan, Bellovin, Floyd.. (2001)   (Correct)

Related documents from co-citation:   More   All
25:   Dynamics of random early detection - Lin, Morris - 1997
24:   Promoting the use of endto -end congestion control in the internet - Floyd, Fall - 1998
22:   Random early detection gateways for congestion avoidance - Floyd, Jacobson - 1993

BibTeX entry:   (Update)

R. Mahajan, S. Floyd, and D. Wetherall, "Controlling high-bandwidth flows at the congested router," in Proc. ACM 9th International Conference on Network Protocols (ICNP), Nov. 2001. http://citeseer.ist.psu.edu/article/mahajan01controlling.html   More

@misc{ mahajan01controlling,
  author = "R. Mahajan and S. Floyd and D. Wetherall",
  title = "Controlling high-bandwidth flows at the congested router",
  text = "R. Mahajan, S. Floyd, and D. Wetherall, Controlling high-bandwidth flows
    at the congested router, in Proc. ACM 9th International Conference on Network
    Protocols (ICNP), Nov. 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/article/mahajan01controlling.html" }
Citations (may not include all citations):
1159   Random Early Detection Gateways for Congestion Avoidance - Floyd, Jacobson - 1993
790   Analysis and Simulation of a Fair Queueing Algorithm (context) - Demers, Keshav et al. - 1989
607   Modeling TCP Throughput: A Simple Model and its Empirical Va.. - Padhye, Firoiu et al. - 1998
510   Promoting the Use of End-to-End Congestion Control in the In.. - Floyd, Fall - 1999
386   EquationBased Congestion Control for Unicast Applications - Floyd, Handley et al. - 2000
269   A Proposal to add Explicit Congestion Notification - Ramakrishnan, Floyd - 1999
268   Dynamics of Random Early Detection - Lin, Morris - 1997
141   Core-Stateless Fair Queueing: Achieving Approximately Fair B.. - Stoica, Shenker et al. - 1998
137   TCP Selective Acknowledgement Options (context) - Mathis, Mahdavi et al. - 2018
121   Efficient Fair Queuing using Deficit Round Robin - Shreedhar, Varghese - 1995
119   SRED: Stabilized RED - Ott, Lakshman et al. - 1999
90   The Nature of the Beast: Recent Traffic Measurements from an.. (context) - Claffy, Miller et al. - 1998
87   Blue: A New Class of Active Queue Management Algorithms - Feng, Kandlur et al. - 1999
41   Controlling High-Bandwidth Flows at a Congested Router - Mahajan, Floyd - 2001
31   A Stateless Active Queue Management Scheme for Approximating.. (context) - Pan, Prabhakar et al. - 2000
19   Fair Bandwidth Sharing among Adaptive and Non-adaptive Flows.. (context) - Anjum, Tassiulas - 1999
17   Estimating Arrival Rates from the RED Packet Drop History - Floyd, Fall et al. - 1998
10   Stochastic Fairness Queuing - McKenney - 1990
6   Approximate Fairness through Differential Dropping - Pan, Breslau et al. - 2001
5   Early Regulation of Unresponsive Flows - Acharya, Rangarajan - 1999
http://www.isi.edu/nsnam
http://www.cs.washington.edu/homes/ratul/red-pd/



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.washington.edu/homes/ratul/pubs-n-talks.html):   More
Understanding BGP Misconfiguration - Mahajan, Wetherall, Anderson (2002)   (Correct)
Translating XSLT Programs to Efficient SQL Queries - Jain, Mahajan, Suciu (2002)   (Correct)
Controlling the Cost of Reliability in Peer-to-Peer Overlays - Mahajan, Castro, Rowstron (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC