Admission-control techniques with application to broadband networks

This paper contains an exact analysis of the blocking conditions at the burst level, experienced by different types of traffic in an ATM network. A basic assumption is that traffic is generated by a finite set of independent two-state sources that share equally the available bandwidth. When all sources are active the bandwidth demanded may exceed the capacity of one or more links in the network. In this paper, we show, using reversibility arguments, that the product-form solution is valid for our model. Then we give a recursion that reduces the multidimensional birth-death process of our original model into a one-dimensional birth-death like system. Thus, we calculate burst blocking probabilities by means of a recursive relation that considerably simplifies the complexity of the problem. The analysis is extended to a two-dimensional case that models a switch, and a similar recursion is suggested. The above results supply the analytical basis for an admission control mechanism that guarantees a predefined performance threshold (in terms of burst loss probability) for the classes of traffic supported.