Polling systems in the critical regime

Mikhail Menshikov and Sergei Zuyev

Stochastic Processes and their Applications, 2001, vol. 92, issue 2, 201-218

Abstract: We study polling systems with Poisson arrival streams and exhaustive service discipline in the critical load case [rho]=1. We show that the system may exhibit null-recurrence or transient behavior and give the corresponding conditions in terms of the first two moments of the distribution of service and switching times. For models with two nodes we establish existence of moments of small orders for the return time to the origin of the corresponding embedded Markov chain in the case of null-recurrence.

Keywords: Polling; systems; Greedy; server; Transience; Null-recurrence; Lyapunov; functions; Markov; walk (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4149(00)00087-9
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:92:y:2001:i:2:p:201-218

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().