A network of servers, known as a grading in telecommunication engineering, is simulated in Qp3er to estimate the probability of a customer being "blocked": all servers busy. Since blocking is a very rare event (l%, to 5% chance), importance sampling was considered for reduction of the simulation variance. The basic idea of importance sampling is first explained by means of a non-dynsmic system.
For dynamic systems a method was proposed by Bayes in 1970, which is related to the Itvirtual measures" published by Carter and Ignall in 1975. For simple queuing systems, we derive the resulting variance, using the renewal or regenerative property of such systems. For our practical "grading" system several alternative importance regions are investigated. For practiaal reasons we choose to start an importance region immediately after a call gets blocked (not a renewal state). The analysis and simulation experiments for the resulting estimator yielded the estimated optimal length of the importance region and the optimal number of replications of the region. Unfortunately, a net increase in variance resulted.
-* This research was done by the authors as members of the Working Group on the Statistical Design and Analysis of Simulation Experiments, chaired by J.P.C. Kleijnen, under the auspicies of the Section for Operations Research (SOR) of the Netherlands Society for Statistics (WS). Many critical questions and helpful comments were received from the members of the Working Group, especially B. Sanders and R. van der Ven (P.T.T., Leidschendam), G. Horstmeier and R. Sierenberg (Delft University), T. Boulogne and R. van der Ham (ECT, Rotterdam).