Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-26T07:00:55.795Z Has data issue: false hasContentIssue false
  • English
  • Français

Monte Carlo Summation Applied to Product-Form Loss Networks

Published online by Cambridge University Press:  27 July 2009

Keith W. Ross  and
Jie Wang
Keith W. Ross
Affiliation:
Department of SystemsUniversity of Pennsylvania Philadelphia, Pennsylvania 19104
Jie Wang
Affiliation:
Department of SystemsUniversity of Pennsylvania Philadelphia, Pennsylvania 19104
Get access Rights & Permissions [Opens in a new window]

Abstract

Loss networks with direct routing have a product-form solution for their equilibrium probabilities. The product-form solution typically involves a normalization constant calling for a multidimensional summation over an astronomical number of states. We propose the application of Monte Carlo summation in order to determine the normalization constant, the blocking probabilities, and the revenue sensitivities. We show that if the proper sampling technique is employed, then the computational effort of Monte Carlo summation is independent of link capacities. We also discuss the application of importance sampling, antithetic variates, and indirect estimation via Little's formula. The method is illustrated with a four-leaf star network supporting multirate traffic.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 3 , July 1992 , pp. 323 - 348
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bratley, P., Fox, B.L., & Schrage, L.E. (1987). A guide to simulation. New York: Springer- Verlag.CrossRefGoogle Scholar
Fishman, G.S. (1978). Principles in discrete event simulation. New York: John Wiley.Google Scholar
Harvey, C. & Hills, C.R. (1979). Determining grades of service in a network. In 9th International Teletraffic Conference.Google Scholar
Ho, Y.C. (1987). Performance evaluation and perturbation analysis of discrete event dynamic system, perspective and open problems. IEEE Transactions on Automatic Control 32: 563–572.Google Scholar
Hunt, P.J. (1989). Implied costs in loss networks. Advances in Applied Probability 21: 661–680.CrossRefGoogle Scholar
Kalos, M. & Whitlock, P.A. (1986). Monte Carlo methods, Vol. I: Basics. New York: John Wiley.CrossRefGoogle Scholar
Kaufman, J.S. (1981). Blocking in a shared resource environment. IEEE Transactions on Communications, COM-29(10): 1474–1481.CrossRefGoogle Scholar
Kelly, F. (1986). Blocking probabilities in large circuit-switched networks. Advances in Applied Probability 18: 473–505.CrossRefGoogle Scholar
Lavenberg, S.S. & Welch, P.D. (1981). A perspective on the use of control variables to increase the efficiency of Monte Carlo simulation. Management Science 27: 322–335.CrossRefGoogle Scholar
McKenna, J. & Mitra, D. (1982). Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage. Bell Systems Technical Journal 61: 661–683.CrossRefGoogle Scholar
McKenna, J., Mitra, D., & Ramakrishnan, K.G. (1981). A class of closed Markovian queueing networks: Integral representations, asymptotic expansions, and generalizations. Bell Systems Technical Journal 60: 599–641.CrossRefGoogle Scholar
Mitra, D. (1987). Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking. Advances in Applied Probability 19: 219–239.CrossRefGoogle Scholar
Mitra, D. & McKenna, J. (1986). Asymptotic expansions for closed Markovian queueing networks with state dependent service rates. Journal for the Association of Computing Machinery 33: 568–592.CrossRefGoogle Scholar
Ramakrishnan, K.G. & Mitra, D. (1982). An overview of PANACEA, a software package for analyzing Markovian queueing networks. Bell Systems Technical Journal 61: 568–592.CrossRefGoogle Scholar
Roberts, J.W. (1981). A service system with heterogeneous user requirements. Performance of data communications systems and their applications. Amsterdam: Elsevier (North-Holland), pp. 423–431.Google Scholar
Ross, K.W. & Tsang, D. (1990). Teletraffic engineering for product-form circuit-switched networks. Advances in Applied Probability 22: 657–675.CrossRefGoogle Scholar
Ross, K.W. & Wang, J. (1991). Monte Carlo summation applied to multichain queueing networks. Technical Report, University of Pennsylvania, Philadelphia.CrossRefGoogle Scholar
Ross, K.W. & Wang, J. (1990). Solving product form stochastic networks with Monte Carlo Summation. In Proceedings of the 1990 Winter Simulation Conference, New Orleans.Google Scholar
Tsang, D. & Ross, K.W. (1990). Algorithms for determining exact blocking probabilities in tree networks. IEEE Transactions on Communications 38: 1266–1271.CrossRefGoogle Scholar