Choi and Park  derived an expression for the joint stationary distribution of the number of customers of k types who arrive in batches at an infinite-server system of M/M/∞ type. We propose another method of solving this problem and extend the result to the case of general service times (not necessarily independent). We also get a transient solution. Our main result states that the k- dimensional vector of the number of customers of k types in the system is a certain linear function of a (2 k – 1)-dimensional vector whose coordinates are independent Poisson random variables.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.