Average waiting time of a symmetric polling system under Bernoulli scheduling

DOI10.1016/0167-6377(91)90074-YzbMath0744.60115OpenAlexW2030986217MaRDI QIDQ1186951

Tetsuya Takine, Toshiharu Hasegawa

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90074-y

zbMATH Keywords

imbedded Markov chainaverage waiting timecyclic serviceBernoulli schedulingsystem of multiple queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

Mathematical methods to study the polling systems

Cites Work

• Unnamed Item
• Symmetric queues served in cyclic order
• Queueing systems with vacations - a survey
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
• Queuing analysis of polling models
• Waiting Lines and Times in a System with Polling
• Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems—Exact Results and Applications
• Queues Served in Cyclic Order
• Queues Served in Cyclic Order: Waiting Times

This page was built for publication: Average waiting time of a symmetric polling system under Bernoulli scheduling