AN INFINITELY-MANY SERVER QUEUE HAVING MARKOV RENEWAL ARRIVALS AND HYPEREXPONENTIAL SERVICE TIMES

Abstract

This paper studies an infinitely-many server queue which has Markov renewal inputs and hypere-xponential service times. The stationary distributions of the number of busy servers both immediately before an arrival epoch and at an arbitrary time are obtained. These results can be applied to engineering telephone networks.