×

Excessive backlog probabilities of two parallel queues. (English) Zbl 1452.90137

Summary: Let \(X\) be the constrained random walk on \(\mathbb {Z}_+^2\) with increments \((1, 0)\), \((-1,0)\), \((0, 1)\) and \((0,-1)\); \(X\) represents, at arrivals and service completions, the lengths of two queues (or two stacks in computer science applications) working in parallel whose service and interarrival times are exponentially distributed with arrival rates \(\lambda_i\) and service rates \(\mu_i\), \(i=1,2\); we assume \(\lambda_i < \mu_i\), \(i=1,2\), i.e., \(X\) is assumed stable. Without loss of generality we assume \(\rho_1 =\lambda_1/\mu_1 \geqslant \rho_2 = \lambda_2/\mu_2\). Let \(\tau_n\) be the first time \(X\) hits the line \(\partial A_n = \{x \in \mathbb {Z}^2:x(1)+x(2) = n \} \), i.e., when the sum of the components of \(X\) equals \(n\) for the first time. Let \(Y\) be the same random walk as \(X\) but only constrained on \(\{y \in \mathbb{Z}^2: y(2)=0\}\) and its jump probabilities for the first component reversed. Let \(\partial B =\{y \in \mathbb{Z}^2: y(1) = y(2) \}\) and let \(\tau\) be the first time \(Y\) hits \(\partial B\). The probability \(p_n = P_x(\tau_n < \tau_0)\) is a key performance measure of the queueing system (or the two stacks) represented by \(X\) (if the queues/stacks share a common buffer, then \(p_n\) is the probability that this buffer overflows during the system’s first busy cycle). Stability of the process implies that \(p_n\) decays exponentially in \(n\) when the process starts off the exit boundary \(\partial A_n.\) We show that, for \(x_n= \lfloor nx \rfloor\), \(x \in \mathbb{R}_+^2\), \(x(1)+x(2) \leqslant 1\), \(x(1) > 0\), \(P_{(n-x_n(1),x_n(2))}( \tau < \infty )\) approximates \(P_{x_n}(\tau_n < \tau_0)\) with exponentially vanishing relative error. Let \(r = (\lambda_1 + \lambda_2)/(\mu_1 + \mu_2)\); for \(r^2 < \rho_2\) and \(\rho_1 \ne \rho_2\), we construct a class of harmonic functions from single and conjugate points on a related characteristic surface for \(Y\) with which the probability \(P_y(\tau < \infty )\) can be approximated with bounded relative error. For \(r^2 = \rho_1 \rho_2\), we obtain the exact formula \(P_y(\tau < \infty ) = r^{y(1)-y(2)} +\frac{r(1-r)}{r-\rho_2}\left( \rho_1^{y(1)} - r^{y(1)-y(2)} \rho_1^{y(2)}\right) .\)

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)

References:

[1] Alanyali, M.; Hajek, B., On large deviations in load sharing networks, Annals of Applied Probability, 8, 67-97 (1998) · Zbl 0938.60097
[2] Aldous, D., Probability approximations via the poisson clumping heuristic (2013), Berlin: Springer, Berlin · Zbl 0679.60013
[3] 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.
[4] Asmussen, S., Applied probability and queues (2008), Berlin: Springer, Berlin
[5] Asmussen, S.; Glynn, P., Stochastic simulation: Algorithms and analysis (2007), Berlin: Springer, Berlin · Zbl 1126.65001
[6] Atar, R.; Dupuis, P., Large deviations and queueing networks: Methods for rate function identification, Stochastic Processes and Their Applications, 84, 2, 255-296 (1999) · Zbl 0996.60036
[7] Blanchet, J., Optimal sampling of overflow paths in Jackson networks, Mathematics of Operations Research, 38, 4, 698-719 (2013) · Zbl 1291.65010
[8] Blanchet, J.; Glynn, P.; Leder, K., 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-258 (2008) · Zbl 1191.65002
[9] Blanchet, J.; Glynn, P.; Leder, K., On Lyapunov inequalities and subsolutions for efficient importance sampling, ACM Transactions on Modeling and Computer Simulation (TOMACS), 22, 3, 13 (2012) · Zbl 1490.62211
[10] 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-124). Wiley. · Zbl 1175.65013
[11] Borovkov, AA; Mogul’skii, AA, Large deviations for markov chains in the positive quadrant, Russian Mathematical Surveys, 56, 5, 803-916 (2001) · Zbl 1068.60034
[12] Boué, M.; Dupuis, P.; Ellis, RS, Large deviations for small noise diffusions with discontinuous statistics, Probability Theory Related Fields, 116, 1, 125-149 (2000) · Zbl 0949.60046
[13] Chang, C-S; Heidelberger, P.; Juneja, S.; Shahabuddin, P., Effective bandwith and fast simulation of ATM intree networks, Performance Evaluation, 20, 45-66 (1994)
[14] 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-37). ACM. · Zbl 1364.90071
[15] Comets, F.; Delarue, F.; Schott, R., Distributed algorithms in an ergodic Markovian environment, Random Structures & Algorithms, 30, 1-2, 131-167 (2007) · Zbl 1178.68663
[16] Comets, F.; Delarue, F.; Schott, R., Large deviations analysis for distributed algorithms in an ergodic Markovian environment, Applied Mathematics and Optimization, 60, 3, 341-396 (2009) · Zbl 1186.60021
[17] Crane, MA; Iglehart, DL, Simulating stable stochastic systems, I: General multiserver queues, Journal of the Association for Computing Machinery, 21, 1, 103-113 (1974) · Zbl 0289.60052
[18] Dai, JG; Miyazawa, M., Reflecting Brownian motion in two dimensions: Exact asymptotics for the stationary distribution, Stochastic Systems, 1, 1, 146-208 (2011) · Zbl 1291.60168
[19] de Boer, P-T, Analysis of state-independent importance-sampling measures for the two-node tandem queue, ACM Transactions on Modeling and Computer Simulation (TOMACS), 16, 3, 225-250 (2006) · Zbl 1390.90270
[20] De Boer, P-T; Kroese, DP; Rubenstein, RY, A fast cross-entropy method for estimating buffer overflows in queueing networks, Management Science, 50, 883-895 (2004) · Zbl 1232.90142
[21] De Boer, P-T; Nicola, VF, Adaptive state-dependent importance sampling simulation of Markovian queueing networks, European Transactions on Telecommunications, 13, 303-315 (2001)
[22] Dean, T.; Dupuis, P., Splitting for rare event simulation: A large deviation approach to design and analysis, Stochastic Processes and Their Applications, 119, 2, 562-587 (2009) · Zbl 1157.60019
[23] Dieker, AT; Mandjes, M., On asymptotically efficient simulation of large deviation probabilities, Advances in Applied Probability, 37, 539-552 (2005) · Zbl 1073.60025
[24] Dupuis, P.; Ellis, RS, The large deviation principle for a general class of queueing systems. I, Transactions of the American Mathematical Society, 347, 8, 2689-2751 (1995) · Zbl 0869.60022
[25] Dupuis, P.; Ellis, R., A weak convergence approach to the theory of large deviations (1997), New York: Wiley, New York · Zbl 0904.60001
[26] Dupuis, P.; Ishii, H., On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications, Stochastics Stochastics Reports, 35, 1, 31-62 (1991) · Zbl 0721.60062
[27] Dupuis, P.; Leder, K.; Wang, H., Importance sampling for sums of random variables with regularly varying tails, ACM Transactions on Modeling and Computer Simulation, 17, 3, 14 (2007) · Zbl 1390.65002
[28] Dupuis, P.; Sezer, AD; Wang, H., Dynamic importance sampling for queueing networks, Annals of Applied Probability, 17, 4, 1306-1346 (2007) · Zbl 1144.60022
[29] Dupuis, P.; Wang, H., Importance sampling, large deviations and differential games, Stochastics and Stochastic Reports, 76, 6, 481-508 (2004) · Zbl 1076.65003
[30] Dupuis, P.; Wang, H., Importance sampling for Jackson networks, Queueing Systems, 62, 113-157 (2009) · Zbl 1166.60329
[31] Durrett, R., Probability: Theory and examples (2010), Cambridge: Cambridge University Press, Cambridge · Zbl 1202.60001
[32] Flajolet, P., The evolution of two stacks in bounded space and random walks in a triangle (1986), Berlin: Springer, Berlin · Zbl 0602.68029
[33] Foley, RD; McDonald, DR, Large deviations of a modified jackson network: Stability and rough asymptotics, The Annals of Applied Probability, 15, 1, 519-541 (2005) · Zbl 1063.60134
[34] Foley, RD; McDonald, David R., Constructing a harmonic function for an irreducible nonnegative matrix with convergence parameter r> 1, Bulletin of the London Mathematical Society, 44, 533-544 (2012) · Zbl 1260.60154
[35] Frater, MR; Lennon, TM; Anderson, BDO, Optimally efficient estimation of the statistics of rare events in queueing networks, IEEE Transactions on Automatic Control, 36, 12, 1395-1405 (1991) · Zbl 0739.60080
[36] Glasserman, P.; Kou, S-G, Analysis of an importance sampling estimator for tandem queues, ACM Transactions on Modeling and Computer Simulation, 5, 22-42 (1995) · Zbl 0841.62083
[37] Guillotin-Plantard, N.; Schott, R., Dynamic random walks: Theory and applications (2006), Amsterdam: Elsevier, Amsterdam · Zbl 1103.60012
[38] Ignatiouk-Robert, I., Large deviations of Jackson networks, Annals of Applied Probability, 10, 962-1001 (2000) · Zbl 1073.60510
[39] Ignatiouk-Robert, I.; Loree, C., Martin boundary of a killed random walk on a quadrant, The Annals of Probability, 38, 1106-1142 (2010) · Zbl 1205.60057
[40] Ignatyuk, IA; Malyshev, VA; Scherbakov, VV, Boundary effects in large deviation problems, Russian Mathematical Surveys, 49, 2, 41-99 (1994) · Zbl 0824.60022
[41] Juneja, S.; Nicola, V., Efficient simulation of buffer overflow probabilities in Jackson networks with feedback, ACM Transcations on Modeling and Computer Simulation, 15, 281-315 (2005) · Zbl 1390.90224
[42] Juneja, S.; Shahabuddin, P., Rare-event simulation techniques: An introduction and recent advances, Handbooks in Operations Research and Management Science, 13, 291-350 (2006) · Zbl 1170.90300
[43] Knuth, DE, Art of computer programming volume 1: Fundamental algorithms (1972), Reading: Addison-Wesley Publishing Company, Reading
[44] Kobayashi, M.; Miyazawa, M.; Latouche, G.; Ramaswami, V.; Sethuraman, J.; Sigman, K.; Squillante, MS; Yao, D., Revisiting the tail asymptotics of the double qbd process: refinement and complete solutions for the coordinate and diagonal directions, Matrix-analytic methods in stochastic models, 145-185 (2013), Berlin: Springer, Berlin · Zbl 1280.60044
[45] Kroese, DP; Nicola, V., Efficient simulation of Jackson networks, ACM Transactions on Modeling and Computer Simulation, 12, 119-141 (2002) · Zbl 1390.90231
[46] Kurkova, IA; Malyshev, VA, Martin boundary and elliptic curves, Markov Process. Related Fields, 4, 2, 203-272 (1998) · Zbl 0929.60055
[47] Louchard, G.; Schott, R., Probabilistic analysis of some distributed algorithms, Random Structures & Algorithms, 2, 2, 151-186 (1991) · Zbl 0732.68055
[48] Louchard, G.; Schott, R.; Tolley, M.; Zimmermann, P., Random walks, heat equation and distributed algorithms, Journal of Computational and Applied Mathematics, 53, 2, 243-274 (1994) · Zbl 0820.68052
[49] Maier, R. S. (1993). Large fluctuations in stochastically perturbed nonlinear systems: Applications in computing. arXiv preprint arXiv:chao-dyn/9305009v1. · Zbl 0869.60105
[50] Maier, RS, Colliding stacks: A large deviations analysis, Random Structures & Algorithms, 2, 4, 379-420 (1991) · Zbl 0737.60097
[51] McDonald, DR, Asymptotics of first passage times for random walk in an orthant, Annals of Applied Probability, 9, 110-145 (1999) · Zbl 0937.60091
[52] Miretskiy, D.; Scheinhardt, W.; Mandjes, M., State-dependent importance sampling for a Jackson tandem network, ACM Transactions on Modeling and Computer Simulation (TOMACS), 20, 3, 15 (2010) · Zbl 1384.90028
[53] Miyazawa, M., Tail decay rates in double QBD processes and related reflected random walks, Mathematics of Operations Research, 34, 3, 547-575 (2009) · Zbl 1213.60151
[54] Miyazawa, M., Light tail asymptotics in multidimensional reflecting processes for queueing networks, Top, 19, 2, 233-299 (2011) · Zbl 1280.60051
[55] Ney, P.; Nummelin, E., Markov additive processes I. Eigenvalue properties and limit theorems, The Annals of Probability, 15, 561-592 (1987) · Zbl 0625.60027
[56] Nicola, V.; Zaburnenko, T., Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks, ACM Transactions on Modeling and Computer Simulation (TOMACS), 17, 2, 10 (2007) · Zbl 1390.90249
[57] Parekh, S.; Walrand, J., A quick simulation method for excessive backlogs in networks of queues, IEEE Transactions on Automatic Control, 34, 1, 54-66 (1989) · Zbl 0661.60110
[58] Randhawa, RS; Juneja, S., Combining importance sampling and temporal difference control variates to simulate Markov chains, ACM Transactions on Modeling and Computer Simulation, 14, 1, 1-30 (2004) · Zbl 1390.65031
[59] Ridder, A., Importance sampling algorithms for first passage time probabilities in the infinite server queue, European Journal of Operational Research, 199, 1, 176-186 (2009) · Zbl 1176.90131
[60] Robert, P., Stochastic networks and queues, stochastic modelling and applied probability series (2003), New York: Springer, New York
[61] Rubino, G.; Tuffin, B., Rare event simulation using Monte Carlo methods (2009), New York: Wiley, New York · Zbl 1159.65003
[62] Setayeshgar, L.; Wang, H., Efficient importance sampling schemes for a feed-forward network, ACM Transactions on Modeling and Computer Simulation (TOMACS), 23, 4, 21 (2013) · Zbl 1358.60079
[63] Sezer, A. D. (2005). Dynamic importance sampling for queueing networks. Ph.D. thesis, Brown University Division of Applied Mathematics.
[64] Sezer, A. D. (2007). Asymptotically optimal importance sampling for Jackson networks with a tree topology. Preprint. http://arxiv.org/abs/0708.3260.
[65] Sezer, AD, Importance sampling for a Markov modulated queuing network, Stochastic Processes and Their Applications, 119, 2, 491-517 (2009) · Zbl 1157.60345
[66] Sezer, A. D. (2010). Asymptotically optimal importance sampling for Jackson networks with a tree topology. Queueing Systems, 64(2), 103-117, Longer (2007) version available at http://arxiv.org/abs/0708.3260 . · Zbl 1182.90027
[67] Sezer, A. D. (2015). Exit probabilities and balayage of constrained random walks. https://arxiv.org/abs/1506.08674.
[68] Sezer, AD, Approximation of excessive backlog probabilities of two tandem queues, Journal of Applied Probability, 55, 3, 968-997 (2018) · Zbl 1401.60081
[69] 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. · Zbl 0871.60021
[70] Ünlü, K. D. (2018). Exit probabilities of constrained simple random walks. Ph.D. thesis, Institute of Applied Mathematics, Middle East Technical University.
[71] Yao, AC, An analysis of a memory allocation scheme for implementing stacks, SIAM Journal on Computing, 10, 2, 398-403 (1981) · Zbl 0457.68023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.