Average waiting time of a symmetric polling system under Bernoulli scheduling

Average waiting time of a symmetric polling system under Bernoulli scheduling

0.00 Avg rating0 Votes
Article ID: iaor19921955
Country: Netherlands
Volume: 10
Issue: 9
Start Page Number: 535
End Page Number: 539
Publication Date: Dec 1991
Journal: Operations Research Letters
Authors: ,
Keywords: markov processes
Abstract:

The authors consider a system of multiple queues served in cyclic order by a single server. At a visit of a server to each queue, the server works according to the Bernoulli scheduling service discipline. The system is assumed to be symmetric. By using both the stochastic decomposition property and an imbedded Markov chain, the authors derive an explicit expression of the average waiting time.

Reviews

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