On the GI/M/\(\infty\) service system with batch arrivals and different types of service distributions (Q1122238)

An infinite queueing system with batch arrivals and s different types of customers is investigated. With probability \(p_ i\) an arriving customer is of type i \((i=1,...,s)\) and requires an exponentially distributed service time with probability \(\mu_ i\). The binomial moments are determined by a recurrence relation and, in the steady state, they can be computed recursively.