Stability of polling networks with state-dependent server routing
DOI10.1017/S0269964800004046zbMATH Open1336.68023OpenAlexW1491649708MaRDI QIDQ2808288FDOQ2808288
Authors: R. Schaßberger
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
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (12)
- Mathematical methods to study the polling systems
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
- Comments on: ``Polling: past, present and perspective
- Stability of polling systems with exhaustive service policies and state-dependent routing
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- A State-Dependent Polling Model with Markovian Routing
- On moment stability properties for a class of state-dependent stochastic networks
- Ergodicity of a polling network
- Stability and performance of greedy server systems
- On the greedy walk problem
- Stability of multi-server polling system with server limits
- Greedy walk on the real line
This page was built for publication: Stability of polling networks with state-dependent server routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808288)