Published June 2003
| Version public
Journal Article
Maximum and asymptotic UDP throughput under CHOKe
Creators
Contributors
Others:
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.
Additional Information
© 2003 ACM. We acknowledge the support of NSF through grants ANI-0113425 and ANI-0230967, and ARO through grant DAAD19-02-1-0283.Additional details
Identifiers
- Eprint ID
- 73240
- DOI
- 10.1145/885651.781038
- Resolver ID
- CaltechAUTHORS:20170104-160731603
Funding
- NSF
- ANI-0113425
- NSF
- ANI-0230967
- Army Research Office (ARO)
- DAAD19-02-1-0283
Dates
- Created
-
2017-01-05Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field