Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking

We consider the following circuit-switching problem which is one of the simplest possible extensions of the classical M/M/K/K model: there are p source centers connected to a hub by channels of various line-capacities and the hub is connected to a destination center by a common channel with its own line-capacity. A circuit requires a line from its source to the hub and another line from the hub to the destination. The holding times of circuits are independent, arbitrarily distributed random variables with means which depend on their source, and requests for circuits arrive in Poisson streams. Blocked calls are cleared. The problem is to calculate the blocking probabilities at each of the sources. The formal solution is well known but its calculation is exponentially hard in p. We have developed a technique which extends recent results on integral representations and their asymptotic expansions to obtain the full expansion for the blocking probabilities in inverse powers of a large parameter N. The power of the method derives from two sources: first, an efficient recursive formula for calculating the general term of the expansion; second, tight upper and lower bounds which accompany the estimates. The computational complexity is polynomial in p. We report on computations.

[1]  R. I. Wilkinson.  Theories for toll traffic engineering in the U. S. A. , 1956 .

[2]  Arne Jensen,et al.  The life and works of A. K. Erlang , 1960 .

[3]  G. M. Jenkins,et al.  Stochastic Service Systems. , 1964 .

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

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

[6]  D. Jagerman.  Some properties of the erlang loss function , 1974 .

[7]  Frank W. J. Olver,et al.  Introduction to Asymptotics and Special Functions , 1974 .

[8]  P. Lin,et al.  Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward , 1978, IEEE Trans. Commun..

[9]  Gianfranco Balbo,et al.  Computational algorithms for closed queueing networks , 1980 .

[10]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[11]  P. Moran,et al.  Reversibility and Stochastic Networks , 1980 .

[12]  K. G. Ramakrishnan,et al.  A class of closed Markovian queuing networks: integral representations, asymptotic expansions, and generalizations , 1981 .

[13]  H. Heffes.  Moment formulae for a class of mixed multi-job-type queueing networks , 1982, The Bell System Technical Journal.

[14]  J. McKenna,et al.  Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage , 1982, The Bell System Technical Journal.

[15]  A. Unwin,et al.  Introduction to Queueing Theory , 1973 .

[16]  A. Girard,et al.  End-to-End Blocking for Circuit-Switched Networks: Polynomial Algorithms for Some Special Cases , 1983, IEEE Trans. Commun..

[17]  M. Neuts,et al.  Introduction to Queueing Theory (2nd ed.). , 1983 .

[18]  Debasis Mitra,et al.  Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks , 1984, JACM.

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

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

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

[22]  Debasis Mitra,et al.  Asymptotic expansions for closed Markovian networks with state-dependent service rates , 1984, JACM.

[23]  B. V. Gnedenko,et al.  Introduction to queueing theory (2nd ed) , 1989 .