On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements

A recursion formula is described. It is useful for calculating steady-state probabilities in a lost-call-cleared service facility carrying a mixture of message traffics with different peakedness factors and/or capacity requirements. In conjunction with the notion of equivalent trunk groups, these probabilities can then be used to evaluate the blocking probability perceived by each traffic stream.