TY - JOUR
T1 - Periodic polling systems in heavy-traffic: renewal arrivals
AU - Olsen, T.L.
AU - van der Mei, R.D.
N1 - Olsen2005
PY - 2005
Y1 - 2005
N2 - This paper considers heavy-traffic limit theorems for polling models with periodic server routing with general renewal arrivals and mixtures of gated and exhaustive service policies. We provide a strong conjecture for the limiting waiting-time distribution in a general parameter setting when the load tends to 1, under proper heavy-traffic scalings. © 2004 Elsevier B.V. All rights reserved.
AB - This paper considers heavy-traffic limit theorems for polling models with periodic server routing with general renewal arrivals and mixtures of gated and exhaustive service policies. We provide a strong conjecture for the limiting waiting-time distribution in a general parameter setting when the load tends to 1, under proper heavy-traffic scalings. © 2004 Elsevier B.V. All rights reserved.
UR - https://www.scopus.com/pages/publications/4544339528
UR - https://www.scopus.com/inward/citedby.url?scp=4544339528&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2004.05.003
DO - 10.1016/j.orl.2004.05.003
M3 - Article
SN - 0167-6377
VL - 33
SP - 17
EP - 25
JO - Operations Research Letters
JF - Operations Research Letters
ER -