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
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)
Maximum and asymptotic UDP throughput under CHOKe
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Feedback control for router congestion resolution
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Stochastic Stability in Internet Router Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Beyond CHOKe: stateless fair queueing
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Stateless Fair Admission Control
Simulation
An Architecture for Network Congestion Control and Charging of Non-cooperative Traffic
Journal of Network and Systems Management
A new AQM algorithm for enhancing internet capability against unresponsive flows
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Generalizing the CHOKe flow protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.