The generalization of AQM algorithms for queueing systems with bounded capacity

Abstract

A queueing system of the M/M/1/(∞,V) type with generally distributed packet volumes and bounded capacity (total packets volume) is considered. The queue length is controlled by means of the accepting function that enqueues the arriving packet with probability depending on the free capacity volume in the system at the pre-arrival epoch. Explicit representations for stationary probabilities are derived via solving the system of differential equations. Sample numerical results are attached in which stationary queue-size distributions with and without dropping packets are compared. © 2012 Springer-Verlag.