Analysis of finite-capacity polling systems

Analysis of finite-capacity polling systems

0.00 Avg rating0 Votes
Article ID: iaor19921951
Country: United Kingdom
Volume: 23
Issue: 2
Start Page Number: 373
End Page Number: 387
Publication Date: Jun 1991
Journal: Advances in Applied Probability
Authors:
Keywords: polling systems
Abstract:

The paper considers a system of N finite-capacity queues attended by a single server in cyclic order. For each visit by the server to a queue, the service is given continuously until that queue becomes empty (exhaustive service), given continuously only to those customers present at the visiting instant (gated service), or given to only a single customer (limited service). The server then switches to the next queue with a random switchover time, and administers the same type of service there similarly. For such a system where each queue has a Poisson arrival process, general service time distribution, and finite capacity, the distribution of the waiting time at each queue is found by utilizing the known results for a single M/G/1/K queue with multiple vacations.

Reviews

Required fields are marked *. Your email address will not be published.