A Caltech Library Service

Maximum and asymptotic UDP throughput under CHOKe

Wang, Jiantao and Tang, Ao and Low, Steven H. (2003) Maximum and asymptotic UDP throughput under CHOKe. ACM SIGMETRICS Performance Evaluation Review . pp. 82-90. ISSN 0163-5999. doi:10.1145/885651.781038.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
Tang, Ao0000-0001-6296-644X
Low, Steven H.0000-0001-6476-3048
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.
Funding AgencyGrant Number
Army Research Office (ARO)DAAD19-02-1-0283
Subject Keywords:Performance, Theory, CHOKe, AQM, UDP, TCP, Bandwidth Share
Classification Code:I.6.4 [ Simulation and Modelling ]: Model Validation and Analysis; C.2.5 [ Computer Systems Organization ]: Local and Wide-Area Networks
Record Number:CaltechAUTHORS:20170104-160731603
Persistent URL:
Official Citation:Jiantao Wang, Ao Tang, and Steven H. Low. 2003. Maximum and asymptotic UDP throughput under CHOKe. SIGMETRICS Perform. Eval. Rev. 31, 1 (June 2003), 82-90. DOI=
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73240
Deposited On:05 Jan 2017 00:13
Last Modified:11 Nov 2021 05:13

Repository Staff Only: item control page