Bandwidth quantization and states reduction in the broadband ISDN

If a network supports only certain rates, we say its bandwidth is quantized. In a quantized-bandwidth network, a customer may be forced to use the next higher rate if the requested rate is not supported. The result is a higher blocking probability and a lower throughput. The throughput loss due to quantization is called the quantization loss, and its related issues are the focus of this paper. We show that the quantization loss is insensitive to capacity scaling and traffic-loading. More important, it is hardly as large as is thought. Even for a network, such as ATM, intending to support a continuous bit rate, bandwidth quantization can be a powerful tool for states reduction. States reduction is shown to be indispensable for solving many problems, such as routing and capacity planning, of a broadband network. >

[1]  D. Mitra Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Keith W. Ross,et al.  Optimal circuit access policies in an ISDN environment: a Markov decision approach , 1989, IEEE Trans. Commun..

[4]  J. H. Weber,et al.  A simulation study of routing and control in communications networks , 1964 .

[5]  Eugene Pinsky,et al.  An asymptotic analysis of complete sharing policy , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[7]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[8]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[9]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[10]  G. J. Foschini,et al.  Sharing Memory Optimally , 1983, IEEE Trans. Commun..

[11]  F. Kelly Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.