Polling systems in the critical regime

Stochastic Processes and their Applications

Volumn 92, Issue 2, 2001, Pages 201-218

  Menshikov, Mikhail ^a   Zuyev, Sergei ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

68M20; Greedy server; Lyapunov functions; Markov walk; Null recurrence; Polling systems; Primary: 60G20; Secondary: 90B22; Transience

Indexed keywords

EID: 0042910241     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-4149(00)00087-9     Document Type: Article

References (7)

1. Aspandiiarov S., Iasnogorodski R., Menshikov M. Passage-time moments for nonnegative stochastic processes and an application to reflected random walks in a quadrant. Ann. Probab. 24:1996;932-960.
2. Borovkov A., Schassberger R. Ergodicity of a polling network. Stochastic Process Appl. 50(2):1994;253-262.
3. Foss S., Chernova N. Comparison theorems and ergodic properties of polling systems. Problems Inform. Transmission. 32(4):1996;46-71.
4. Foss S., Last G. Stability of polling systems with exhaustive service policies and state-dependent routing. Ann. Appl. Probab. 6:1996;116-137.
5. Lamperti J. Criteria for the recurrence and transience of stochastic processes I. J. Math. Anal. Appl. 1:1960;314-330.
6. Liu, Z., Nain, P., Towsley, D., 1992. On optimal polling policies. QUESTA 11, 59-83.
7. Ramachandran B. On characteristic functions and moments. Sankhyā Ser. A. 31:1969;1-12.