A new method for approximating blocking probability in overflow loss networks

In this paper, we present a new approximation for estimating blocking probability in overflow loss networks and systems. Given a system for which an estimate of blocking probability is sought, we first construct a second system to act as a surrogate for the original system. Estimating blocking probability in the second system with Erlang's fixed point approximation (EFPA) provides a better estimate for blocking probability in the original system than if we were to use the conventional approach of directly using EFPA in the original system. We present a combination of numerical and theoretical results that indicate our new approximation offers a better estimate than EFPA for a certain pure overflow loss network. Moreover, we demonstrate the accuracy of our new approximation for circuit-switched networks using alternative routing. We argue that the success of our new approximation is due to its ability to utilize congestion information imbedded in overflow traffic, whereas the conventional approach fails to utilize such information.

[1]  Eric Wing Ming Wong,et al.  Maximum free circuit routing in circuit-switched networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[2]  Gerald R. Ash,et al.  An analytical model for adaptive routing networks , 1993, IEEE Trans. Commun..

[3]  D. L. Jagerman.  Methods in traffic calculations , 1984, AT&T Bell Laboratories Technical Journal.

[4]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[5]  Philippe Chevalier,et al.  Overflow analysis and cross-trained servers , 2003 .

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

[7]  Eric Wing Ming Wong,et al.  A taxonomy of rerouting in circuit-switched networks , 1999, IEEE Commun. Mag..

[8]  L. Delbrouck.  The Uses of Kosten's Systems in the Provisioning of Alternate Trunk Groups Carrying Heterogeneous Traffic , 1983, IEEE Trans. Commun..

[9]  Elaine Wong,et al.  Analysis of the M and M/sup 2/ routings in circuit-switched networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[10]  Indra Widjaja.  Performance analysis of burst admission-control protocols , 1995 .

[11]  Hai Le Vu,et al.  Modelling and performance evaluation of optical burst switched networks with deflection routing and wavelength reservation , 2004, IEEE INFOCOM 2004.

[12]  Wan Chan.  Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan , 1980, IEEE Trans. Commun..

[13]  Hai Le Vu,et al.  Performance analyses of optical burst-switching networks , 2003, IEEE J. Sel. Areas Commun..

[14]  Eric Wing Ming Wong,et al.  Analysis of rerouting in circuit-switched networks , 2000, TNET.

[15]  W. Verbiest,et al.  Interactive video on demand , 1994, IEEE Communications Magazine.

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

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

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

[19]  K. G. Ramakrishnan,et al.  ATM network design and optimization: a multirate loss network framework , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[21]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.

[22]  Sammy Chan,et al.  A novel method for modeling and analysis of distributed video on demand systems , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

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

[24]  A. A. Fredericks.  Congestion in blocking systems — a simple approximation technique , 1980, The Bell System Technical Journal.

[25]  Roch Guerin,et al.  Overflow analysis for finite waiting room systems , 1990, IEEE Trans. Commun..

[26]  A. Kuczura,et al.  A Method of Moments for the Analysis of a Switched Communication Network's Performance , 1977, IEEE Trans. Commun..

[27]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .