 Importance sampling in systems simulation: a practical failure?A.C.M. Hopmans and J.P.C. Kleijnen Mathematics and Computers in Simulation (MATCOM), 1979, vol. 21, issue 2, 209-220 Abstract: A network of servers, known as a grading in telecommunication engineering, is simulated in order to estimate the probability of a customer being “blocked”: all servers busy. Since blocking is a very rare event (1‰ 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-dynamic system. For dynamic systems a method was proposed by Bayes in 1970, which is related to the “virtual 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 practical 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. Date: 1979 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:21:y:1979:i:2:p:209-220 DOI: 10.1016/0378-4754(79)90136-8 Access Statistics for this article Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.