Controlling high-bandwidth flows at the congested router

By Ratul Mahajan, Sally Floyd, David Wetherall. Proceedings Ninth International Conference on Network Protocols. ICNP 2001, 2001

408 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Frequency Estimation of Internet Packet Streams with Limited Space (2002, methodology): “However, this sampling method is often unsatisfactory given the nature of Internet tra‐c [9, 23 ].”
Low-rate TCP-targeted denial of service attacks and counter strategies (2003, methodology): “Finally, as the number of .ows increases, CHOKe (like RED-PD) becomes more and more successful in smoothing the TCP aggregate null frequencies (not shown).”
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks (2003, methodology): “In the identification approach, a router uses a lightweight detection algorithm to identify ill-behaved (unfriendly) flows [11], [ 21 ].”
On the characteristics and origins of internet flow rates (2002, background): “algorithms have been proposed, and the performance and scalability of some of these algorithm depends on the nature of the flow rates seen at routers [9, 10, 14].”