Polling systems in the critical regime.

DOI10.1016/S0304-4149(00)00087-9zbMath1047.60036OpenAlexW2023747136MaRDI QIDQ1879530

Mikhail V. Menshikov, Sergei Zuyev

Publication date: 22 September 2004

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-4149(00)00087-9

zbMATH Keywords

Lyapunov functionstransiencepolling systemsgreedy serverMarkov walknull-recurrence

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Generalized stochastic processes (60G20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Critical random walks on two-dimensional complexes with applications to polling systems ⋮ Mathematical methods to study the polling systems ⋮ A Markov chain model of a polling system with parameter regeneration ⋮ Periodicity in the transient regime of exhaustive polling systems

Cites Work

• Criteria for the recurrence or transience of stochastic process. I
• Comparison theorems and ergodic properties of polling systems.
• On optimal polling policies
• Ergodicity of a polling network
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Passage-time moments for nonnegative stochastic processes and an application to reflected random walks in a quadrant
• Unnamed Item

This page was built for publication: Polling systems in the critical regime.