Generalizing the CHOKe flow protection

Authors:
Addisu Eshete;Yuming Jiang
Affiliations:
Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, O.S. Bragstads plass 2E, N-7491 Trondheim, Norway;Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, O.S. Bragstads plass 2E, N-7491 Trondheim, Norway and Department of Telematics, ...
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2013

Citing 9
Cited 0

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
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
Maximum and asymptotic UDP throughput under CHOKe

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Understanding CHOKe: throughput and spatial characteristics

IEEE/ACM Transactions on Networking (TON)
Beyond CHOKe: stateless fair queueing

NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Protection from unresponsive flows with geometric CHOKe

ISCC '12 Proceedings of the 2012 IEEE Symposium on Computers and Communications (ISCC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a simple and stateless active queue management (AQM) scheme, called geometric CHOKe (gCHOKe), to protect responsive flows from unresponsive ones. gCHOKe has its root in and is a generalization of the original CHOKe. It provides an additional power of protection, achieved by introducing an extra flow matching trial following each successful flow comparison of packets. The maximum number of comparisons permitted for an arrival can be controlled by a parameter called maxcomp. The quality of flow protection improves with maxcomp. Compared to the plain CHOKe (which is just the simplest case of gCHOKe), our analysis and simulations show that the scheme can achieve over 20% improvement in the bounds of both bandwidth and buffer space used by an aggressive flow. In addition, up to 14% of the total link capacity can be saved from the unresponsive flow, allowing responsive or rate-adaptive flows to obtain a better share of resources in the router.