Name
Abstract | ||
|---|---|---|
A recently proposed active queue management, CHOKe, is stateless, simple to implement, yet surprisingly effective in protecting TCP from UDP flows. We present an equilibrium model of TCP/CHOKe. We prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (e + 1)-1=0.269 when UDP input rate is slightly larger than link capacity, and drops to zero as UDP input rate tends to infinity. We clarify the spatial characteristics of the leaky buffer under CHOKe that produce this throughput behavior. Specifically, we prove that, as UDP input rate increases, even though the total number of UDP packets in the queue increases, their spatial distribution becomes more and more concentrated near the tail of the queue, and drops rapidly to zero toward the head of the queue. In stark contrast to a nonleaky FIFO buffer where UDP bandwidth shares would approach 1 as its input rate increases without bound, under CHOKe, UDP simultaneously maintains a large number of packets in the queue and receives a vanishingly small bandwidth share, the mechanism through which CHOKe protects TCP flows. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TNET.2004.833162 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
Inductors,Throughput,Bandwidth,Protection,Internet,H infinity control,Probability distribution,Current measurement,Communication system traffic control,Traffic control | FIFO (computing and electronics),Active queue management,Computer science,Queue,Network packet,Computer network,Bandwidth (signal processing),Queueing theory,Throughput,Choke | Journal |
Volume | Issue | ISSN |
12 | 4 | 1063-6692 |
Citations | PageRank | References |
21 | 1.18 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ao Tang | 1 | 24 | 2.90 |
| Jiantao Wang | 2 | 315 | 23.82 |
| S. H. Low | 3 | 5999 | 585.58 |