{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:31:29Z","timestamp":1648596689648},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T00:00:00Z","timestamp":1253059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s11134-009-9139-4","type":"journal-article","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T17:20:41Z","timestamp":1253035241000},"page":"103-117","source":"Crossref","is-referenced-by-count":2,"title":["Asymptotically optimal importance sampling for\u00a0Jackson networks with a tree topology"],"prefix":"10.1007","volume":"64","author":[{"given":"Ali Devin","family":"Sezer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,16]]},"reference":[{"key":"9139_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-5316(94)90005-1","volume":"20","author":"C.-S. Chang","year":"1994","unstructured":"Chang, C.-S., Heidelberger, P., Juneja, S., Shahabuddin, P.: Effective bandwidth and fast simulation of ATM intree networks. Perform. Eval. 20, 45\u201366 (1994)","journal-title":"Perform. Eval."},{"key":"9139_CR2","first-page":"303","volume":"13","author":"P.-T. Boer De","year":"2001","unstructured":"De Boer, P.-T., Nicola, V.F.: Adaptive state-dependent importance sampling simulation of Markovian queueing networks. Eur. Trans. Telecommun. 13, 303\u2013315 (2001)","journal-title":"Eur. Trans. Telecommun."},{"key":"9139_CR3","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1287\/mnsc.1030.0139","volume":"50","author":"P.-T. Boer De","year":"2004","unstructured":"De Boer, P.-T., Kroese, D.P., Rubenstein, R.Y.: A fast cross-entropy method for estimating buffer overflows in queueing networks. Manag. Sci. 50, 883\u2013895 (2004)","journal-title":"Manag. Sci."},{"issue":"6","key":"9139_CR4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/10451120410001733845","volume":"76","author":"P. Dupuis","year":"2004","unstructured":"Dupuis, P., Wang, H.: Importance sampling, large deviations and differential games. Stoch. Stoch. Rep. 76(6), 481\u2013508 (2004)","journal-title":"Stoch. Stoch. Rep."},{"key":"9139_CR5","unstructured":"Dupuis, P., Wang, H.: Subsolutions of an Isaacs equation and efficient schemes for importance sampling: Examples and numerics (2005). Preprint available at http:\/\/www.dam.brown.edu\/lcds\/publications"},{"issue":"1","key":"9139_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/105051604000001016","volume":"15","author":"P. Dupuis","year":"2005","unstructured":"Dupuis, P., Wang, H.: Adaptive importance sampling for uniformly recurrent Markov chains. Ann. Appl. Probab. 15(1), 1\u201338 (2005)","journal-title":"Ann. Appl. Probab."},{"key":"9139_CR7","unstructured":"Dupuis, P., Wang, H.: Subsolutions of an Isaacs equation and efficient schemes for importance sampling: Convergence analysis. (2005). Preprint available at http:\/\/www.dam.brown.edu\/people\/huiwang"},{"key":"9139_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s11134-009-9124-y","volume":"62","author":"P. Dupuis","year":"2009","unstructured":"Dupuis, P., Wang, H.: Importance sampling for Jackson networks. Queueing Syst. 62, 113\u2013157 (2009)","journal-title":"Queueing Syst."},{"issue":"4","key":"9139_CR9","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1214\/105051607000000122","volume":"17","author":"P. Dupuis","year":"2007","unstructured":"Dupuis, P., Sezer, A.D., Wang, H.: Dynamic importance sampling for queueing networks. Ann. Appl. Probab. 17(4), 1306\u20131346 (2007)","journal-title":"Ann. Appl. Probab."},{"key":"9139_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/203091.203093","volume":"5","author":"P. Glasserman","year":"1995","unstructured":"Glasserman, P., Kou, S.-G.: Analysis of an importance sampling estimator for tandem queues. ACM Trans. Model. Comput. Simul. 5, 22\u201342 (1995)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9139_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/1113316.1113317","volume":"15","author":"S. Juneja","year":"2005","unstructured":"Juneja, S., Nicola, V.: Efficient simulation of buffer overflow probabilities in Jackson networks with feedback. ACM Trans. Model. Comput. Simul. 15, 281\u2013315 (2005)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9139_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/566392.566395","volume":"12","author":"D.P. Kroese","year":"2002","unstructured":"Kroese, D.P., Nicola, V.: Efficient simulation of Jackson networks. ACM Trans. Model. Comput. Simul. 12, 119\u2013141 (2002)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9139_CR13","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/9.8649","volume":"34","author":"S. Parekh","year":"1989","unstructured":"Parekh, S., Walrand, J.: A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Autom. Control 34, 54\u201366 (1989)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9139_CR14","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/9.106154","volume":"36","author":"J.S. Sadowsky","year":"1991","unstructured":"Sadowsky, J.S.: Large deviations theory and efficient simulation of excessive backlogs in a GI\/GI\/m queue. IEEE Trans. Autom. Control 36, 1383\u20131394 (1991)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9139_CR15","unstructured":"Sezer, A.D.: Dynamic importance sampling for queueing networks, Ph.D. thesis, Brown University Division of Applied Mathematics (2005). Preprint available at http:\/\/www.dam.brown.edu\/people\/sezer"},{"key":"9139_CR16","unstructured":"Sezer, A.D.: Asymptotically optimal importance sampling for Jackson networks with a tree topology (2007). Preprint, available at arXiv:0708.3260"},{"key":"9139_CR17","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1214\/aos\/1176343541","volume":"4","author":"D. Siegmund","year":"1976","unstructured":"Siegmund, D.: Importance sampling in the Monte Carlo study of sequential tests. Ann. Stat. 4, 673\u2013684 (1976)","journal-title":"Ann. Stat."},{"key":"9139_CR18","unstructured":"Wei, L., Qi, H.: An efficient importance sampling method for rare event simulation in large scale tandem networks. In: Proceedings of the 2002 Winter Simulation Conference, pp. 580\u2013587 (2002)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9139-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-009-9139-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9139-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:39Z","timestamp":1559360679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-009-9139-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,16]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9139"],"URL":"https:\/\/doi.org\/10.1007\/s11134-009-9139-4","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,16]]}}}