Monte Carlo Summation for Product-Form Loss Networks

Author(s):  
Keith W. Ross
1992 ◽  
Vol 6 (3) ◽  
pp. 323-348 ◽  
Author(s):  
Keith W. Ross ◽  
Jie Wang

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.


1989 ◽  
Vol 21 (04) ◽  
pp. 831-841 ◽  
Author(s):  
P. J. Hunt ◽  
F. P. Kelly

This paper studies the behaviour of large loss networks, paying particular attention to links at a certain critical loading where the load offered very nearly matches capacity. We correct and extend an earlier central limit theorem for the stationary distribution of a loss network with critically loaded links. We then use this result to show that acceptance probabilities have a limiting product-form decomposition, despite marked dependencies between the occupancies of critically loaded links.


2003 ◽  
Vol 38 (11-13) ◽  
pp. 1147-1156 ◽  
Author(s):  
M. Bebbington ◽  
P. Pollett ◽  
I. Ziedins

Sign in / Sign up

Export Citation Format

Share Document