Controlling high-bandwidth flows at the congested router

International Conference on Network Protocols

Volumn , Issue , 2001, Pages 192-201

  Mahajan, Ratul ^a   Floyd, Sally ^a   Wetherall, David ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PACKET NETWORKS; QUEUEING THEORY; ROUTERS; SCHEDULING; TELECOMMUNICATION CONTROL; TELECOMMUNICATION TRAFFIC;

CONGESTED ROUTER; HIGH-BANDWIDTH FLOWS; PARTIAL FLOW STATE; TARGET BANDWIDTH;

BANDWIDTH;

EID: 0035703761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Early regulation of unresponsive flows
2. Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet
3. The nature of the beast: Recent traffic measurements from an internet backbone
4. Analysis and simulation of a fair queueing algorithm
5. Blue: A new class of active queue management algorithms
6. Promoting the use of end-to-end congestion control in the internet
7. Estimating arrival rates from the RED packet drop history
8. Equation-based congestion control for unicast applications
9. Random early detection gate-ways for congestion avoidance
10. Dynamics of random early detection
11. Controlling high-bandwidth flows at a congested router
12. TCP selective acknowledgement options
13. Stochastic fairness queuing
14. SRED: Stabilized RED
15. Modeling TCP throughput: A simple model and its empirical validation
16. Approximate fairness through differential dropping
17. CHOKe, a stateless active queue management scheme for approximating fair bandwidth allocation
18. A proposal to add explicit congestion notification (ECN) to IP
19. Efficient fair queuing using deficit round robin
20. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks