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 quasi-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 row moments of the area of a bidimensional random set. Finally some examples where it is possible to get explicit formulas are given together with comparisons with previous known results.

This publication has 2 references indexed in Scilit: