The oscillating queue with finite buffer

The idea of the recently introduced oscillating queueing system is based on two threshold values. Roughly speaking, the service process in this system is organized in such a way that the queue length is kept between these values. The oscillating queueing system has the advantage of making better use of the available resources and is applicable in many devices which use a single server queueing scheme. It is also a generalization of some cell discarding procedures proposed for ATM networks. In this paper a finite buffer version of the oscillating queueing system is studied. The steady-state characteristics of the systems with Poisson input process (M/G–G/1/N) and with exponential distribution of the service time (G/M–M/1/N) are obtained by means of the potential method. This approach gives explicit and easily implementable formulas. In addition, numerical examples are presented.