Periodic polling systems in heavy-traffic: renewal arrivals

T.L. Olsen; R.D. van der Mei

doi:10.1016/j.orl.2004.05.003

Periodic polling systems in heavy-traffic: renewal arrivals

T.L. Olsen, R.D. van der Mei

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

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.

Original language	English
Pages (from-to)	17-25
Journal	Operations Research Letters
Volume	33
DOIs	https://doi.org/10.1016/j.orl.2004.05.003
Publication status	Published - 2005

Bibliographical note

Olsen2005

Access to Document

10.1016/j.orl.2004.05.003

Persistent URL (handle)

Copy link address

Cite this

@article{a08ccfdbc2a64cbbab5cdc9759ac8d6a,

title = "Periodic polling systems in heavy-traffic: renewal arrivals",

abstract = "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. {\textcopyright} 2004 Elsevier B.V. All rights reserved.",

author = "T.L. Olsen and {van der Mei}, R.D.",

note = "Olsen2005 ",

year = "2005",

doi = "10.1016/j.orl.2004.05.003",

language = "English",

volume = "33",

pages = "17--25",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

}

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.

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 -

Periodic polling systems in heavy-traffic: renewal arrivals

Abstract

Bibliographical note

Access to Document

Persistent URL (handle)

Fingerprint

Cite this