On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing

DOI10.1007/s11134-013-9385-3zbMath1311.60111OpenAlexW1982676731MaRDI QIDQ475092

Andrei V. Zorine

Publication date: 25 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-013-9385-3

zbMATH Keywords

queuesrandom environmentcontinuous-time Markov chainstate-dependent routingpolling systemergodicity conditionswitchover times

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Processes in random environments (60K37)

Related Items

Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ Stability and Unloading Cost of Time-Sharing Dual-Server Systems in Random Environment ⋮ Investigation of the stochastic polling system and its applications to broadband wireless networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and performance of greedy server systems
• Stability of periodic polling system with BMAP arrivals
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• On the stability of a partially accessible multi-station queue with state-dependent routing
• Ergodicity of a polling network
• Optimal scheduling policies in time sharing service systems
• Stability of polling systems with exhaustive service policies and state-dependent routing
• Polling systems and multitype branching processes
• Mathematical methods to study the polling systems
• On the optimal control of a two-queue polling model
• Optimization of control of doubly stochastic nonordinary flows in time-sharing systems
• Stability of Polling Networks with State-Dependent Server Routing
• A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
• Time-Sharing Service Systems. I
• On the stability of polling models with multiple servers
• Efficient visit orders for polling systems
• On Klimov's model by two job classes and exponential processing times
• A State-Dependent Polling Model with Markovian Routing
• On the Stability of Greedy Polling Systems with General Service Policies
• Time Sharing with Priorities

This page was built for publication: On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing