Search

A steady-state analysis is given for M/G/1/K queues with combined N-policy and setup times before service periods. The queue length distributions and the mean waiting times are obtained for the exhaustive service system, the gated service system, the E-limited service system, and the G-limited service system. Numerical examples are also provided. [ABSTRACT FROM AUTHOR]

In this paper, we examine a queueing problem motivated by the pipeline polling protocol in satellite communications. The model is an extension of the cyclic queueing system with M-limited service. In this service mechanism, each queue, after receiving service on cycle j, makes a reservation for its service requirement in cycle j + 1. The main contribution to queueing theory is that we propose an approximation for the queue length and sojourn-time distributions for this discipline. Most approximate studies on cyclic queues, which have been considered before, examine the means only. Our method is an iterative one, which we prove to be convergent by using stochastic dominance arguments. We examine the performance of our algorithm by comparing it to simulations and show that the results are very good. [ABSTRACT FROM AUTHOR]

This paper deals with a modified M/G/1 queueing system with finite capacity and a walking server. Units waiting are served up to a limited number before the server takes a vacation time and later returns to the queue again. A computational method for the stationary queue length distribution is developed and illustrated with a numerical example. The model was motivated by similar channel access mechanisms in token-ring local area networks. [ABSTRACT FROM AUTHOR]