Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
A control theoretic approach to active queue management
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic queue length thresholds in a shared memory ATM switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
ComBAQ: provisioning loss differentiated services for hybrid traffic in routers
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
| Hi-index | 0.24 |
In this paper, we propose a new active queue management scheme for a network device (e.g. router, switch, etc.) with a shared buffer where the buffer is logically organized into multiple queues. Conventional schemes allocate buffer space to each queue through the use of static buffer thresholds. Although very simple, these static thresholds are often determined using simple heuristics and cannot adapt to changing traffic conditions. These schemes could also result in unnecessary packet drops which lead to poor network performance since congested or heavily loaded queues cannot gain access to buffers not utilized by the lightly loaded queues. The proposed active queue management scheme, which uses dynamic buffer thresholds, adapts to changing load conditions and dynamically allocates buffer space to all queues using a simple recursive algorithm. The implementation of the scheme is also simple and requires low processing overhead to compute the dynamic buffer thresholds and packet drop probabilities.