Average waiting time of a symmetric polling system under Bernoulli scheduling

Authors:
Tetsuya Takine;Toshiharu Hasegawa
Affiliations:
Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan;Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan
Venue:
Operations Research Letters
Year:
1991

Citing 9
Cited 0

Analysis of polling systems

Analysis of polling systems
Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
Queuing analysis of polling models

ACM Computing Surveys (CSUR)
Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications

Management Science
Exact results for the cyclic-service queue with a Bernoulli schedule

Performance Evaluation
Waiting Lines and Times in a System with Polling

Journal of the ACM (JACM)
Symmetric queues served in cyclic order

Operations Research Letters
Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks

IEEE Journal on Selected Areas in Communications
Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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, we derive an explicit expression of the average waiting time.