Stability of Polling Networks with State-Dependent Server Routing

DOI10.1017/S0269964800004046zbMath1336.68023OpenAlexW1491649708MaRDI QIDQ2808288

R. Schassberger

Publication date: 23 May 2016

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800004046

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Stability and performance of greedy server systems ⋮ On the greedy walk problem ⋮ On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing ⋮ Mathematical methods to study the polling systems ⋮ Comments on: ``Polling: past, present and perspective ⋮ Greedy walk on the real line

Cites Work

• Polling and greedy servers on a line
• Stability of token passing rings
• A continuous polling system with general service times
• Monotonicity and stability of periodic polling models
• Ergodicity of a polling network
• Queuing analysis of polling models

This page was built for publication: Stability of Polling Networks with State-Dependent Server Routing