Computer Networks and ISDN Systems
Diffusion based statistical call admission control in ATM
Performance Evaluation
The Remaining Service Time upon Reaching a High Level in M/G/1 Queues
Queueing Systems: Theory and Applications
The M/G-G/1 Oscillating Queueing System
Queueing Systems: Theory and Applications
Duration of the buffer overflow period in a batch arrival queue
Performance Evaluation
Consecutive customer losses in regular and oscillating MX/G/1/n systems
Queueing Systems: Theory and Applications
On the blocking probability in batch Markovian arrival queues
Microprocessors & Microsystems
Time to buffer overflow in an MMPP queue
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Queue size in a BMAP queue with finite buffer
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 0.00 |
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.