{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:37Z","timestamp":1740123217673,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:00:00Z","timestamp":1563580800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10479-019-03324-w","type":"journal-article","created":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T10:02:40Z","timestamp":1563616960000},"page":"141-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Excessive backlog probabilities of two parallel queues"],"prefix":"10.1007","volume":"293","author":[{"given":"Kamil Demirberk","family":"\u00dcnl\u00fc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8983-2035","authenticated-orcid":false,"given":"Ali Devin","family":"Sezer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"3324_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1214\/aoap\/1027961034","volume":"8","author":"M Alanyali","year":"1998","unstructured":"Alanyali, M., & Hajek, B. (1998). On large deviations in load sharing networks. Annals of Applied Probability, 8, 67\u201397.","journal-title":"Annals of Applied Probability"},{"key":"3324_CR2","volume-title":"Probability approximations via the poisson clumping heuristic","author":"D Aldous","year":"2013","unstructured":"Aldous, D. (2013). Probability approximations via the poisson clumping heuristic (Vol. 77). Berlin: Springer."},{"key":"3324_CR3","unstructured":"Anantharam, J., Heidelberger, P., & Tsoucas, P. (1990). Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation. IBM Research: Tech Rep."},{"key":"3324_CR4","volume-title":"Applied probability and queues","author":"S Asmussen","year":"2008","unstructured":"Asmussen, S. (2008). Applied probability and queues (Vol. 51). Berlin: Springer."},{"key":"3324_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69033-9","volume-title":"Stochastic simulation: Algorithms and analysis","author":"S Asmussen","year":"2007","unstructured":"Asmussen, S., & Glynn, P. (2007). Stochastic simulation: Algorithms and analysis (Vol. 57). Berlin: Springer."},{"issue":"2","key":"3324_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0304-4149(99)00051-4","volume":"84","author":"R Atar","year":"1999","unstructured":"Atar, R., & Dupuis, P. (1999). Large deviations and queueing networks: Methods for rate function identification. Stochastic Processes and Their Applications, 84(2), 255\u2013296.","journal-title":"Stochastic Processes and Their Applications"},{"issue":"4","key":"3324_CR7","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/moor.2013.0586","volume":"38","author":"J Blanchet","year":"2013","unstructured":"Blanchet, J. (2013). Optimal sampling of overflow paths in Jackson networks. Mathematics of Operations Research, 38(4), 698\u2013719.","journal-title":"Mathematics of Operations Research"},{"key":"3324_CR8","first-page":"227","volume":"2008","author":"J Blanchet","year":"2008","unstructured":"Blanchet, J., Glynn, P., & Leder, K. (2008). Efficient simulation of light-tailed sums: An old folk song sung to a faster new tune. Monte Carlo and Quasi-Monte Carlo Methods, 2008, 227\u2013258.","journal-title":"Monte Carlo and Quasi-Monte Carlo Methods"},{"issue":"3","key":"3324_CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2331140.2331141","volume":"22","author":"J Blanchet","year":"2012","unstructured":"Blanchet, J., Glynn, P., & Leder, K. (2012). On Lyapunov inequalities and subsolutions for efficient importance sampling. ACM Transactions on Modeling and Computer Simulation (TOMACS), 22(3), 13.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"key":"3324_CR10","unstructured":"Blanchet, J., & Mandjes, M. (2009). Rare event simulation for queues in Rare event simulation using Monte Carlo methods. In G. Rubino & B. Tuffin (Eds.), Rare event simulation for queues (pp. 87\u2013124). Wiley."},{"issue":"5","key":"3324_CR11","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1070\/RM2001v056n05ABEH000398","volume":"56","author":"AA Borovkov","year":"2001","unstructured":"Borovkov, A. A., & Mogul\u2019skii, A. A. (2001). Large deviations for markov chains in the positive quadrant. Russian Mathematical Surveys, 56(5), 803\u2013916.","journal-title":"Russian Mathematical Surveys"},{"issue":"1","key":"3324_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/PL00008720","volume":"116","author":"M Bou\u00e9","year":"2000","unstructured":"Bou\u00e9, M., Dupuis, P., & Ellis, R. S. (2000). Large deviations for small noise diffusions with discontinuous statistics. Probability Theory Related Fields, 116(1), 125\u2013149.","journal-title":"Probability Theory Related Fields"},{"key":"3324_CR13","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. (1994). Effective bandwith and fast simulation of ATM intree networks. Performance Evaluation, 20, 45\u201366.","journal-title":"Performance Evaluation"},{"key":"3324_CR14","doi-asserted-by":"crossref","unstructured":"Collingwood, J., Foley, R. D., & McDonald, D. R. (2011). Networks with cascading overloads. In Proceedings of the 6th international conference on queueing theory and network applications (pp. 33\u201337). ACM.","DOI":"10.1145\/2021216.2021221"},{"issue":"1\u20132","key":"3324_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/rsa.20154","volume":"30","author":"F Comets","year":"2007","unstructured":"Comets, F., Delarue, F., & Schott, R. (2007). Distributed algorithms in an ergodic Markovian environment. Random Structures & Algorithms, 30(1\u20132), 131\u2013167.","journal-title":"Random Structures & Algorithms"},{"issue":"3","key":"3324_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00245-009-9079-8","volume":"60","author":"F Comets","year":"2009","unstructured":"Comets, F., Delarue, F., & Schott, R. (2009). Large deviations analysis for distributed algorithms in an ergodic Markovian environment. Applied Mathematics and Optimization, 60(3), 341\u2013396.","journal-title":"Applied Mathematics and Optimization"},{"issue":"1","key":"3324_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/321796.321805","volume":"21","author":"MA Crane","year":"1974","unstructured":"Crane, M. A., & Iglehart, D. L. (1974). Simulating stable stochastic systems, I: General multiserver queues. Journal of the Association for Computing Machinery, 21(1), 103\u2013113.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"3324_CR18","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/10-SSY022","volume":"1","author":"JG Dai","year":"2011","unstructured":"Dai, J. G., Miyazawa, M., et al. (2011). Reflecting Brownian motion in two dimensions: Exact asymptotics for the stationary distribution. Stochastic Systems, 1(1), 146\u2013208.","journal-title":"Stochastic Systems"},{"issue":"3","key":"3324_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/1147224.1147226","volume":"16","author":"P-T de Boer","year":"2006","unstructured":"de Boer, P.-T. (2006). Analysis of state-independent importance-sampling measures for the two-node tandem queue. ACM Transactions on Modeling and Computer Simulation (TOMACS), 16(3), 225\u2013250.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"key":"3324_CR20","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1287\/mnsc.1030.0139","volume":"50","author":"P-T De Boer","year":"2004","unstructured":"De Boer, P.-T., Kroese, D. P., & Rubenstein, R. Y. (2004). A fast cross-entropy method for estimating buffer overflows in queueing networks. Management Science, 50, 883\u2013895.","journal-title":"Management Science"},{"key":"3324_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/ett.4460130403","volume":"13","author":"P-T De Boer","year":"2001","unstructured":"De Boer, P.-T., & Nicola, V. F. (2001). Adaptive state-dependent importance sampling simulation of Markovian queueing networks. European Transactions on Telecommunications, 13, 303\u2013315.","journal-title":"European Transactions on Telecommunications"},{"issue":"2","key":"3324_CR22","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.spa.2008.02.017","volume":"119","author":"T Dean","year":"2009","unstructured":"Dean, T., & Dupuis, P. (2009). Splitting for rare event simulation: A large deviation approach to design and analysis. Stochastic Processes and Their Applications, 119(2), 562\u2013587.","journal-title":"Stochastic Processes and Their Applications"},{"key":"3324_CR23","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1017\/S0001867800000306","volume":"37","author":"AT Dieker","year":"2005","unstructured":"Dieker, A. T., & Mandjes, M. (2005). On asymptotically efficient simulation of large deviation probabilities. Advances in Applied Probability, 37, 539\u2013552.","journal-title":"Advances in Applied Probability"},{"issue":"8","key":"3324_CR24","first-page":"2689","volume":"347","author":"P Dupuis","year":"1995","unstructured":"Dupuis, P., & Ellis, R. S. (1995). The large deviation principle for a general class of queueing systems. I. Transactions of the American Mathematical Society, 347(8), 2689\u20132751.","journal-title":"Transactions of the American Mathematical Society"},{"key":"3324_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9781118165904","volume-title":"A weak convergence approach to the theory of large deviations","author":"P Dupuis","year":"1997","unstructured":"Dupuis, P., & Ellis, R. (1997). A weak convergence approach to the theory of large deviations. New York: Wiley."},{"issue":"1","key":"3324_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1080\/17442509108833688","volume":"35","author":"P Dupuis","year":"1991","unstructured":"Dupuis, P., & Ishii, H. (1991). On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications. Stochastics Stochastics Reports, 35(1), 31\u201362.","journal-title":"Stochastics Stochastics Reports"},{"issue":"3","key":"3324_CR27","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1243991.1243995","volume":"17","author":"P Dupuis","year":"2007","unstructured":"Dupuis, P., Leder, K., & Wang, H. (2007a). Importance sampling for sums of random variables with regularly varying tails. ACM Transactions on Modeling and Computer Simulation, 17(3), 14.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"4","key":"3324_CR28","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. (2007b). Dynamic importance sampling for queueing networks. Annals of Applied Probability, 17(4), 1306\u20131346.","journal-title":"Annals of Applied Probability"},{"issue":"6","key":"3324_CR29","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/10451120410001733845","volume":"76","author":"P Dupuis","year":"2004","unstructured":"Dupuis, P., & Wang, H. (2004). Importance sampling, large deviations and differential games. Stochastics and Stochastic Reports, 76(6), 481\u2013508.","journal-title":"Stochastics and Stochastic Reports"},{"key":"3324_CR30","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. (2009). Importance sampling for Jackson networks. Queueing Systems, 62, 113\u2013157.","journal-title":"Queueing Systems"},{"key":"3324_CR31","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R. (2010). Probability: Theory and examples (4th ed.). Cambridge: Cambridge University Press.","edition":"4"},{"key":"3324_CR32","volume-title":"The evolution of two stacks in bounded space and random walks in a triangle","author":"P Flajolet","year":"1986","unstructured":"Flajolet, P. (1986). The evolution of two stacks in bounded space and random walks in a triangle. Berlin: Springer."},{"issue":"1B","key":"3324_CR33","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1214\/105051604000000666","volume":"15","author":"RD Foley","year":"2005","unstructured":"Foley, R. D., McDonald, D. R., et al. (2005). Large deviations of a modified jackson network: Stability and rough asymptotics. The Annals of Applied Probability, 15(1B), 519\u2013541.","journal-title":"The Annals of Applied Probability"},{"key":"3324_CR34","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1112\/blms\/bdr115","volume":"44","author":"RD Foley","year":"2012","unstructured":"Foley, R. D., & McDonald, David R. (2012). Constructing a harmonic function for an irreducible nonnegative matrix with convergence parameter r> 1. Bulletin of the London Mathematical Society, 44, 533\u2013544.","journal-title":"Bulletin of the London Mathematical Society"},{"issue":"12","key":"3324_CR35","doi-asserted-by":"crossref","first-page":"1395","DOI":"10.1109\/9.106155","volume":"36","author":"MR Frater","year":"1991","unstructured":"Frater, M. R., Lennon, T. M., & Anderson, B. D. O. (1991). Optimally efficient estimation of the statistics of rare events in queueing networks. IEEE Transactions on Automatic Control, 36(12), 1395\u20131405.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"3324_CR36","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. (1995). Analysis of an importance sampling estimator for tandem queues. ACM Transactions on Modeling and Computer Simulation, 5, 22\u201342.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"3324_CR37","volume-title":"Dynamic random walks: Theory and applications","author":"N Guillotin-Plantard","year":"2006","unstructured":"Guillotin-Plantard, N., & Schott, R. (2006). Dynamic random walks: Theory and applications. Amsterdam: Elsevier."},{"key":"3324_CR38","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1214\/aoap\/1019487515","volume":"10","author":"I Ignatiouk-Robert","year":"2000","unstructured":"Ignatiouk-Robert, I. (2000). Large deviations of Jackson networks. Annals of Applied Probability, 10, 962\u20131001.","journal-title":"Annals of Applied Probability"},{"key":"3324_CR39","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1214\/09-AOP506","volume":"38","author":"I Ignatiouk-Robert","year":"2010","unstructured":"Ignatiouk-Robert, I., & Loree, C. (2010). Martin boundary of a killed random walk on a quadrant. The Annals of Probability, 38, 1106\u20131142.","journal-title":"The Annals of Probability"},{"issue":"2","key":"3324_CR40","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1070\/RM1994v049n02ABEH002204","volume":"49","author":"IA Ignatyuk","year":"1994","unstructured":"Ignatyuk, I. A., Malyshev, V. A., & Scherbakov, V. V. (1994). Boundary effects in large deviation problems. Russian Mathematical Surveys, 49(2), 41\u201399.","journal-title":"Russian Mathematical Surveys"},{"key":"3324_CR41","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/1113316.1113317","volume":"15","author":"S Juneja","year":"2005","unstructured":"Juneja, S., & Nicola, V. (2005). Efficient simulation of buffer overflow probabilities in Jackson networks with feedback. ACM Transcations on Modeling and Computer Simulation, 15, 281\u2013315.","journal-title":"ACM Transcations on Modeling and Computer Simulation"},{"key":"3324_CR42","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0927-0507(06)13011-X","volume":"13","author":"S Juneja","year":"2006","unstructured":"Juneja, S., & Shahabuddin, P. (2006). Rare-event simulation techniques: An introduction and recent advances. Handbooks in Operations Research and Management Science, 13, 291\u2013350.","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"3324_CR43","volume-title":"Art of computer programming volume 1: Fundamental algorithms","author":"DE Knuth","year":"1972","unstructured":"Knuth, D. E. (1972). Art of computer programming volume 1: Fundamental algorithms. Reading: Addison-Wesley Publishing Company."},{"key":"3324_CR44","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-1-4614-4909-6_8","volume-title":"Matrix-analytic methods in stochastic models","author":"M Kobayashi","year":"2013","unstructured":"Kobayashi, M., & Miyazawa, M. (2013). Revisiting the tail asymptotics of the double qbd process: refinement and complete solutions for the coordinate and diagonal directions. In G. Latouche, V. Ramaswami, J. Sethuraman, K. Sigman, M. S. Squillante, & D. Yao (Eds.), Matrix-analytic methods in stochastic models (pp. 145\u2013185). Berlin: Springer."},{"key":"3324_CR45","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/566392.566395","volume":"12","author":"DP Kroese","year":"2002","unstructured":"Kroese, D. P., & Nicola, V. (2002). Efficient simulation of Jackson networks. ACM Transactions on Modeling and Computer Simulation, 12, 119\u2013141.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"2","key":"3324_CR46","first-page":"203","volume":"4","author":"IA Kurkova","year":"1998","unstructured":"Kurkova, I. A., & Malyshev, V. A. (1998). Martin boundary and elliptic curves. Markov Process. Related Fields, 4(2), 203\u2013272.","journal-title":"Markov Process. Related Fields"},{"issue":"2","key":"3324_CR47","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/rsa.3240020203","volume":"2","author":"G Louchard","year":"1991","unstructured":"Louchard, G., & Schott, R. (1991). Probabilistic analysis of some distributed algorithms. Random Structures & Algorithms, 2(2), 151\u2013186.","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"3324_CR48","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0377-0427(94)90048-5","volume":"53","author":"G Louchard","year":"1994","unstructured":"Louchard, G., Schott, R., Tolley, M., & Zimmermann, P. (1994). Random walks, heat equation and distributed algorithms. Journal of Computational and Applied Mathematics, 53(2), 243\u2013274.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"3324_CR49","unstructured":"Maier, R. S. (1993). Large fluctuations in stochastically perturbed nonlinear systems: Applications in computing. arXiv preprint \narXiv:chao-dyn\/9305009v1\n\n."},{"issue":"4","key":"3324_CR50","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/rsa.3240020404","volume":"2","author":"RS Maier","year":"1991","unstructured":"Maier, R. S. (1991). Colliding stacks: A large deviations analysis. Random Structures & Algorithms, 2(4), 379\u2013420.","journal-title":"Random Structures & Algorithms"},{"key":"3324_CR51","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1214\/aoap\/1029962599","volume":"9","author":"DR McDonald","year":"1999","unstructured":"McDonald, D. R. (1999). Asymptotics of first passage times for random walk in an orthant. Annals of Applied Probability, 9, 110\u2013145.","journal-title":"Annals of Applied Probability"},{"issue":"3","key":"3324_CR52","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1842713.1842718","volume":"20","author":"D Miretskiy","year":"2010","unstructured":"Miretskiy, D., Scheinhardt, W., & Mandjes, M. (2010). State-dependent importance sampling for a Jackson tandem network. ACM Transactions on Modeling and Computer Simulation (TOMACS), 20(3), 15.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"issue":"3","key":"3324_CR53","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1287\/moor.1090.0375","volume":"34","author":"M Miyazawa","year":"2009","unstructured":"Miyazawa, M. (2009). Tail decay rates in double QBD processes and related reflected random walks. Mathematics of Operations Research, 34(3), 547\u2013575.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"3324_CR54","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s11750-011-0179-7","volume":"19","author":"M Miyazawa","year":"2011","unstructured":"Miyazawa, M. (2011). Light tail asymptotics in multidimensional reflecting processes for queueing networks. Top, 19(2), 233\u2013299.","journal-title":"Top"},{"key":"3324_CR55","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1214\/aop\/1176992159","volume":"15","author":"P Ney","year":"1987","unstructured":"Ney, P., & Nummelin, E. (1987). Markov additive processes I. Eigenvalue properties and limit theorems. The Annals of Probability, 15, 561\u2013592.","journal-title":"The Annals of Probability"},{"issue":"2","key":"3324_CR56","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1225275.1225281","volume":"17","author":"V Nicola","year":"2007","unstructured":"Nicola, V., & Zaburnenko, T. (2007). Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks. ACM Transactions on Modeling and Computer Simulation (TOMACS), 17(2), 10.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"issue":"1","key":"3324_CR57","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/9.8649","volume":"34","author":"S Parekh","year":"1989","unstructured":"Parekh, S., & Walrand, J. (1989). A quick simulation method for excessive backlogs in networks of queues. IEEE Transactions on Automatic Control, 34(1), 54\u201366.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"3324_CR58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/974734.974735","volume":"14","author":"RS Randhawa","year":"2004","unstructured":"Randhawa, R. S., & Juneja, S. (2004). Combining importance sampling and temporal difference control variates to simulate Markov chains. ACM Transactions on Modeling and Computer Simulation, 14(1), 1\u201330.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"1","key":"3324_CR59","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.ejor.2008.10.028","volume":"199","author":"A Ridder","year":"2009","unstructured":"Ridder, A. (2009). Importance sampling algorithms for first passage time probabilities in the infinite server queue. European Journal of Operational Research, 199(1), 176\u2013186.","journal-title":"European Journal of Operational Research"},{"key":"3324_CR60","volume-title":"Stochastic networks and queues, stochastic modelling and applied probability series","author":"P Robert","year":"2003","unstructured":"Robert, P. (2003). Stochastic networks and queues, stochastic modelling and applied probability series (Vol. 52). New York: Springer."},{"key":"3324_CR61","doi-asserted-by":"crossref","DOI":"10.1002\/9780470745403","volume-title":"Rare event simulation using Monte Carlo methods","author":"G Rubino","year":"2009","unstructured":"Rubino, G., & Tuffin, B. (2009). Rare event simulation using Monte Carlo methods. New York: Wiley."},{"issue":"4","key":"3324_CR62","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/2517450","volume":"23","author":"L Setayeshgar","year":"2013","unstructured":"Setayeshgar, L., & Wang, H. (2013). Efficient importance sampling schemes for a feed-forward network. ACM Transactions on Modeling and Computer Simulation (TOMACS), 23(4), 21.","journal-title":"ACM Transactions on Modeling and Computer Simulation (TOMACS)"},{"key":"3324_CR63","unstructured":"Sezer, A.\u00a0D. (2005). Dynamic importance sampling for queueing networks. Ph.D. thesis, Brown University Division of Applied Mathematics."},{"key":"3324_CR64","unstructured":"Sezer, A.\u00a0D. (2007). Asymptotically optimal importance sampling for Jackson networks with a tree topology. Preprint. \nhttp:\/\/arxiv.org\/abs\/0708.3260\n\n."},{"issue":"2","key":"3324_CR65","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.spa.2008.02.009","volume":"119","author":"AD Sezer","year":"2009","unstructured":"Sezer, A. D. (2009). Importance sampling for a Markov modulated queuing network. Stochastic Processes and Their Applications, 119(2), 491\u2013517.","journal-title":"Stochastic Processes and Their Applications"},{"key":"3324_CR66","unstructured":"Sezer, A.\u00a0D. (2010). Asymptotically optimal importance sampling for Jackson networks with a tree topology. Queueing Systems, 64(2), 103\u2013117, Longer (2007) version available at \nhttp:\/\/arxiv.org\/abs\/0708.3260 \n\n."},{"key":"3324_CR67","unstructured":"Sezer, A.\u00a0D. (2015). Exit probabilities and balayage of constrained random walks. \nhttps:\/\/arxiv.org\/abs\/1506.08674\n\n."},{"issue":"3","key":"3324_CR68","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1017\/jpr.2018.60","volume":"55","author":"AD Sezer","year":"2018","unstructured":"Sezer, A. D. (2018). Approximation of excessive backlog probabilities of two tandem queues. Journal of Applied Probability, 55(3), 968\u2013997.","journal-title":"Journal of Applied Probability"},{"key":"3324_CR69","unstructured":"Shwartz, A., Weiss, A. (1995). Large deviations for performance analysis. Stochastic modeling series. London: Chapman & Hall, Queues, communications, and computing, With an appendix by Robert J. Vanderbei."},{"key":"3324_CR70","unstructured":"\u00dcnl\u00fc, K. D. (2018). Exit probabilities of constrained simple random walks. Ph.D. thesis, Institute of Applied Mathematics, Middle East Technical University."},{"issue":"2","key":"3324_CR71","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0210029","volume":"10","author":"AC Yao","year":"1981","unstructured":"Yao, A. C. (1981). An analysis of a memory allocation scheme for implementing stacks. SIAM Journal on Computing, 10(2), 398\u2013403.","journal-title":"SIAM Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03324-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T17:31:41Z","timestamp":1599499901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03324-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,20]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["3324"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03324-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2019,7,20]]},"assertion":[{"value":"20 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}