M/M/$\infty$ queues in semi-Markovian random environment

Abstract

In this paper we investigate an M/M/$\infty$ queue whose parameters depend on an external random environment that we assume to be a semi-Markovian process with finite state space. For this model we show a recursive formula that allows to compute all the factorial moments for the number of customers in the system in steady state. The used technique is based on the calculation of the raw moments of the measure of a bidimensional random set. Finally the case when the random environment has only two states is deeper analyzed. We obtain an explicit formula to compute the above mentioned factorial moments when at least one of the two states has sojourn time exponentially distributed.

17 pages, 2 figures

Cited by in corpus (8)

• Markov-modulated Ornstein-Uhlenbeck processes
• Analysis of Markov-modulated infinite-server queues in the central-limit regime
• Queues on a dynamically evolving graph
• Long-time asymptotics of stochastic reaction systems
• A large deviations principle for infinite-server queues in a random environment
• Refined large deviations asymptotics for Markov-modulated infinite-server systems
• Diffusion limits for networks of Markov-modulated infinite-server queues
• Asymptotics for infinite server queues with fast/slow Markov switching and fat tailed service times