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

DOI10.1007/S11134-013-9385-3zbMATH Open1311.60111OpenAlexW1982676731MaRDI QIDQ475092FDOQ475092

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

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

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)

Cites Work

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

Cited In (6)

• Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
• A State-Dependent Polling Model with Markovian Routing
• 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
• Stability and unloading cost of time-sharing dual-server systems in random environment

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)