Reduced load approximations for loss networks

In this paper, we present a general scheme with which to view reduced load approximations in loss networks. We use notation motivated by stochastic Petri net (SPN) representations of such models and a technique similar to that described by Ciardo and Trivedi for general SPNs. Previous reduced load approximations have involved link independence assumptions. In our method, we assume independence between sets of links rather than between themselves. Our independence assumptions are thus less drastic than those that have been made previously and better results can be expected. Several examples are given in this context.

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

[2]  Peter G. Taylor,et al.  A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference , 1994, IEEE Trans. Commun..

[3]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[4]  Giovanni Chiola,et al.  A Software Package for the Analysis of Generalized Stochastic Petri Net Models , 1985, PNPM.

[5]  D Mitra.  Some results from an asymptotic analysis of a class of simple, circuit-switched networks , 1986 .

[6]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[7]  D. P. Heyman,et al.  Asymptotic marginal independence in large networks of loss systems , 1987 .

[8]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[9]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[10]  Kishor S. Trivedi,et al.  A decomposition approach for stochastic Petri net models , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

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

[12]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[13]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[14]  J. M. Holtzman,et al.  Analysis of dependence effects in telephone trunking networks , 1971 .

[15]  Francoise Le Gall.  About loss probabilities for general routing policies in circuit-switched networks , 1989, IEEE Trans. Commun..

[16]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

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

[18]  Frank Kelly,et al.  Limit theorems for loss networks with diverse routing , 1989, Advances in Applied Probability.