{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:39:29Z","timestamp":1769283569281,"version":"3.49.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2006,7]]},"abstract":"<jats:p>We investigate the simulation of overflow of the total population of a Markovian two-node tandem queue model during a busy cycle, using importance sampling with a state-independent change of measure. We show that the only such change of measure that may possibly result in asymptotically efficient simulation for large overflow levels is exchanging the arrival rate with the smallest service rate. For this change of measure, we classify the model's parameter space into regions of asymptotic efficiency, exponential growth of the relative error, and infinite variance, using both analytical and numerical techniques.<\/jats:p>","DOI":"10.1145\/1147224.1147226","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:11:32Z","timestamp":1161195092000},"page":"225-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Analysis of state-independent importance-sampling measures for the two-node tandem queue"],"prefix":"10.1145","volume":"16","author":[{"given":"Pieter-Tjerk","family":"De Boer","sequence":"first","affiliation":[{"name":"University of Twente, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Ahamed T. P. I. Borkar V. S. and Juneja S. 2006. Adaptive importance sampling technique for Markov chains using stochastic approximation. Oper. Res. To appear. 10.1287\/opre.1060.0291   Ahamed T. P. I. Borkar V. S. and Juneja S. 2006. Adaptive importance sampling technique for Markov chains using stochastic approximation. Oper. Res. To appear. 10.1287\/opre.1060.0291"},{"key":"e_1_2_1_2_1","unstructured":"de Boer P. T. 2000. Analysis and efficient simulation of queueing models of telecommunication systems. Ph.D. thesis University of Twente The Netherlands.  de Boer P. T. 2000. Analysis and efficient simulation of queueing models of telecommunication systems. Ph.D. thesis University of Twente The Netherlands."},{"key":"e_1_2_1_3_1","volume-title":"the 5th International Workshop on Rare Event Simulation and Combinatorial Optimization. (RESIM\/COP'04)","author":"de Boer P. T.","year":"2004"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10479-005-5725-y","article-title":"Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy","volume":"134","author":"de Boer P. T.","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1030.0139"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/ett.4460130403","article-title":"Adaptive state-dependent importance sampling simulation of markovian queueing networks","volume":"13","author":"de Boer P. T.","year":"2002","journal-title":"European Trans. Telecomm."},{"key":"e_1_2_1_7_1","volume-title":"the 2nd International Workshop on Rare Event Simulation (RESIM'99)","author":"Garvels M. J. J."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/203091.203093"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/203091.203094"},{"key":"e_1_2_1_10_1","first-page":"391","article-title":"Adaptive importance sampling on discrete markov chains","volume":"9","author":"Kollman C.","year":"1999","journal-title":"Ann. Appl. Probab."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/9.8649","article-title":"A quick simulation method for excessive backlogs in networks of queues","volume":"34","author":"Parekh S.","year":"1989","journal-title":"IEEE Trans. Autom. Control"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/974734.974735"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/9.106154","article-title":"Large deviations theory and efficient simulation of excessive backlogs in a GI\/GI\/m queue","volume":"36","author":"Sadowsky J. S.","year":"1991","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1147224.1147226","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1147224.1147226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:23Z","timestamp":1750259183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1147224.1147226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1147224.1147226"],"URL":"https:\/\/doi.org\/10.1145\/1147224.1147226","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}