A stateless active queue management scheme for approximating fair bandwidth allocation and stabilized buffer occupation

Abstract

This paper proposes an active queue management algorithm we called "SCHOKe", which wants to address the problems of providing a fair bandwidth allocation and a stabilized buffer occupancy in congested routers. The scheme works in concert with a simple FIFO queue that is shared by all flows, so it is stateless and easy to implement. In the algorithm, unresponsive flows are punished effectively and buffer occupancy is stabilized by a "hit", which happens when an arriving packet’s flow ID is the same as one of packets randomly chosen from the FIFO queue. Simulations of a TCP/IP network are used to illustrate the performance of the scheme.