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

DOI10.1007/S11134-013-9385-3MaRDI QIDQ475092zbMATH OpenOpenAlexFDO

Authors 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

continuous-time Markov chainrandom environmentqueuespolling systemstate-dependent routingergodicity conditionswitchover times

Mathematics Subject Classification ID

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

Recommendations

• A State-Dependent Polling Model with Markovian Routing
• Ergodicity of a polling network
• Stability of polling networks with state-dependent server routing
• Ergodicity and analysis of the process describing the system state in polling systems with two queues
• Stability of polling systems with exhaustive service policies and state-dependent routing

Cites work

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

Cited in

(6)

• 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
• Ergodicity and analysis of the process describing the system state in polling systems with two queues
• Ergodicity of a polling network
• A State-Dependent Polling Model with Markovian Routing
• Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475092)