Maximum and asymptotic UDP throughput under CHOKe

Authors:
Jiantao Wang;Ao Tang;Steven H. Low
Affiliations:
California Institute of Technology, Pasadena;California Institute of Technology, Pasadena;California Institute of Technology, Pasadena
Venue:
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2003

Citing 5
Cited 4

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Understanding TCP Vegas: a duality model

Journal of the ACM (JACM)
A duality model of TCP and queue management algorithms

IEEE/ACM Transactions on Networking (TON)

Understanding CHOKe: throughput and spatial characteristics

IEEE/ACM Transactions on Networking (TON)
A queue management algorithm for fair bandwidth allocation

Computer Communications
An Architecture for Network Congestion Control and Charging of Non-cooperative Traffic

Journal of Network and Systems Management
Generalizing the CHOKe flow protection

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recently proposed active queue management, CHOKe, aims to protect TCP from UDP flows. Simulations have shown that as UDP rate increases, its bandwidth share initially rises but eventually drops. We derive an approximate model of CHOKe and show that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (e+1)-1 = 0.269 when the UDP input rate is slightly larger than the link capacity, and drops to zero as UDP input rate tends to infinity, regardless of the TCP algorithm.