Abstract
Queues with a finite population of customers and the server's occasional unavailable periods (called vacations) are studied in detail. We first consider M/G/l//N queueing system where the server takes repeated vacations until it finds a customer in the queue after emptying the queue. For the steady state, we obtain the performance measures such as the system throughput and mean wa.iting time from the known analysis of a regenerative cycle of the busy and vacation periods. We also obtain the Laplace Stieltjes transform of the distribution function for the waiting time of a customer by applying the method of supplementary variables to the joint distribution of the queue size and the elapsed service or vacation times at an arbitrary point in time. These results are then applied to the steady-state analysis of a multiple-queue, cyclic-service (polling) model with a finite population of customers, which can represent a token ring network for several computers each with a finite number of interactive users. Some numerical results for symmetric systems are shown.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
