ANALYSIS OF FINITE-CAPACITY POLLING SYSTEMS

We consider 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 quene 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, we find the distribution of the waiting time at each queue by utilizing the known results for a single M/G/1/K queue with multiple vacations.