A State-Dependent Polling Model with Markovian Routing
From MaRDI portal
Abstract: A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state of the last visited queue. The stationary distribution of the position of the server is given. Ergodicity conditions are obtained by means of an associated dynamical system. Under rotational symmetry assumptions, average queue length and mean waiting times are computed.
Recommendations
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- Gated polling with stationary ergodic walking times, Markovian routing and random feedback
- Exact analysis of the state-dependent polling model
- Ergodicity of a polling network
- Stability of polling networks with state-dependent server routing
Cited in
(11)- Exact analysis of the state-dependent polling model
- A new look at a smart polling model
- On two-level state-dependent routing polling systems with mixed service
- Gated polling with stationary ergodic walking times, Markovian routing and random feedback
- Finite buffer polling models with routing
- Mathematical methods to study the polling systems
- Stability of polling networks with state-dependent server routing
- A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
- Cycle times in a starlike network with state-dependent routing
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network
This page was built for publication: A State-Dependent Polling Model with Markovian Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4843004)
