Analysis of polling systems
The M/G/1 queue with processor sharing and its relation to a feedback queue
Queueing Systems: Theory and Applications
Efficient visit orders for polling systems
Performance Evaluation
On the stability of a partially accessible multi-station queue with state-dependent routing
Queueing Systems: Theory and Applications
Analysis and Control of Poling Systems
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Performance Evaluation
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
Performance Evaluation
A state-dependent polling model with k-limited service
Probability in the Engineering and Informational Sciences
Stability and performance of greedy server systems
Queueing Systems: Theory and Applications
Fairness and efficiency for polling models with the κ-gated service discipline
Performance Evaluation
Optimal scheduling policies in time sharing service systems
Mathematical and Computer Modelling: An International Journal
On the optimal control of a two-queue polling model
Operations Research Letters
| Hi-index | 0.00 |
A polling system with switchover times and state-dependent server routing is studied. Input flows are modulated by a random external environment. Input flows are ordinary Poisson flows in each state of the environment, with intensities determined by the environment state. Service and switchover durations have exponential laws of probability distribution. A continuous-time Markov chain is introduced to describe the dynamics of the server, the sizes of the queues and the states of the environment. By means of the iterative-dominating method a sufficient condition for ergodicity of the system is obtained for the continuous-time Markov chain. This condition also ensures the existence of a stationary probability distribution of the embedded Markov chain at instants of jumps. The customers sojourn cost during the period of unloading the stable queueing system is chosen as a performance metric. Numerical study in case of two input flows and a class of priority and threshold routing algorithms is conducted. It is demonstrated that in case of light inputs a priority routing rule doesn't seem to be quasi-optimal.