{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:34:43Z","timestamp":1648517683046},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2000,10]]},"abstract":"In this paper we consider the problem of estimating blocking probabili ties in the multiservice loss system via simulation, applying the static Monte Carlo method with importance sampling. Earlier approaches to this problem include the use of either a single exponentially twisted version of the steady state distribution of the system or a composite of individual exponentially twisted distributions. Here, a different approach is introduced, where the original estimation problem is first decomposed into independent simpler subproblems, each roughly corresponding to estimating the blocking probability contribution from a single link. Then two importance sampling distributions are presented, which very closely approximate the ideal importance sampling distribution for each subproblem. In both methods, the idea is to try to generate samples directly into the blocking state region. The difference between the methods is that the first method, the inverse convolution method, achieves this exactly, while the second one, using a fitted Gaussian distibution, only approximately. The inverse convolution algorithm, however, has a higher memory requirement. Finally, a dynamic control algorithm is given for optimally allocating the samples between different subproblems. The numerical results demonstrate that the variance reduction obtained with the methods, especially with the inverse convolution method, is tryly remarkable, between 670 and 1,000,000 in the examples under consideration.<\/jats:p>","DOI":"10.1145\/369534.369541","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:28:46Z","timestamp":1027769326000},"page":"326-347","source":"Crossref","is-referenced-by-count":7,"title":["Nearly optimal importance sampling for Monte Carlo simulation of loss systems"],"prefix":"10.1145","volume":"10","author":[{"given":"Pasi E.","family":"Lassila","sequence":"first","affiliation":[{"name":"Helsinki Univ. of Technology, Helsinki, Finland"}]},{"given":"Jorma T.","family":"Virtamo","sequence":"additional","affiliation":[{"name":"Helsinki Univ. of Technology, Helsinki, Finland"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","unstructured":"KAY S. M. 1993. Fundamentals of Statistical Signal Processing: Estimation Theory. Prentice-Hall signal processing series. Prentice-Hall Inc. Upper Saddle River NJ. KAY S. M. 1993. Fundamentals of Statistical Signal Processing: Estimation Theory. Prentice-Hall signal processing series. Prentice-Hall Inc. Upper Saddle River NJ."},{"key":"e_1_2_1_2_1","first-page":"787","volume-title":"Proceedings of the ITC-16 Conference on Teletraffic Engineering in a Competitive World (June). Elsevier","author":"LASSILA P. E.","year":"1999"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(96)00405-5","article-title":"Fast simulation of blocking probabilities in loss networks. Euro","volume":"101","author":"MANDJES M.","year":"1997","journal-title":"J. Oper. Res."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"ROSS K. W. 1995. Multiservice Loss Models for Broadband Telecommunication Networks. Springer-Verlag Vienna Austria. ROSS K. W. 1995. Multiservice Loss Models for Broadband Telecommunication Networks. Springer-Verlag Vienna Austria.","DOI":"10.1007\/978-1-4471-2126-8"},{"key":"e_1_2_1_5_1","unstructured":"RUBINSTEIN R. Y. AND MELAMED B. 1998. Modern Simulation and Modeling. John Wiley and Sons Inc. New York NY. RUBINSTEIN R. Y. AND MELAMED B. 1998. Modern Simulation and Modeling. John Wiley and Sons Inc. New York NY."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/18.179349","article-title":"On the optimality and stability of exponential twisting in Monte Carlo estimation","volume":"39","author":"SADOWSKY J. S.","year":"1993","journal-title":"IEEE Trans. Inf. Theor."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/18.54903","article-title":"On large deviation theory and asymptotically efficient Monte Carlo estimation","volume":"3","author":"SADOWSKY J. S.","year":"1990","journal-title":"IEEE Trans. Inf. Theor. IT-36"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"806","DOI":"10.2307\/1428086","article-title":"Asymptotic estimates for blocking probabilities in a large multi-rate loss network","volume":"29","author":"SIMONIAN A.","year":"1997","journal-title":"Adv. Appl. Probab."}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/369534.369541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T15:12:41Z","timestamp":1614870761000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/369534.369541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["10.1145\/369534.369541"],"URL":"http:\/\/dx.doi.org\/10.1145\/369534.369541","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":["Computer Science Applications","Modeling and Simulation"],"published":{"date-parts":[[2000,10]]}}}