On the performance of a circuit switched link with priorities

The author studies links carrying calls of distinct classes subject to different degrees of access restriction, e.g. by means of some trunk reservation device. Calls are accepted at random with the probability depending on the class of the call and the load on the link at the arrival instant. Assuming negative exponentially distributed holding times, the author develops a model that allows the computation of the steady-state loss probability, moments of the blocking periods, time-dependent probability of loss, and moments of overflow intervals for each class. Both Poissonian and peaked arrivals, the latter ones modeled by Markov-modulated Poisson processes, are considered. Efficient numerical techniques are described, and a numerical example, including comparisons to simulations, is given