The Annals of Applied Probability

Asymptotics of first passage times for random walk in an orthant

D. R. McDonald

Full-text: Open access

Abstract

We wish to describe how a chosen node in a network of queues over- loads. The overloaded node may also drive other nodes into overload, but the remaining "super" stable nodes are only driven into a new steady state with stochastically larger queues. We model this network of queues as a Markov additive chain with a boundary. The customers at the "super" stable nodes are described by a Markov chain, while the other nodes are described by an additive chain. We use the existence of a harmonic function h for a Markov additive chain provided by Ney and Nummelin and the asymptotic theory for Markov additive processes to prove asymptotic results on the mean time for a specified additive component to hit a high level l. We give the limiting distribution of the "super" stable nodes at this hitting time. We also give the steady-state distribution of the "super" stable nodes when the specified component equals l. The emphasis here is on sharp asymptotics, not rough asymptotics as in large deviation theory. Moreover, the limiting distributions are for the unscaled process, not for the fluid limit as in large deviation theory.

Article information

Source
Ann. Appl. Probab., Volume 9, Number 1 (1999), 110-145.

Dates
First available in Project Euclid: 21 August 2002

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1029962599

Digital Object Identifier
doi:10.1214/aoap/1029962599

Mathematical Reviews number (MathSciNet)
MR1682592

Zentralblatt MATH identifier
0937.60091

Subjects
Primary: 60K25: Queueing theory [See also 68M20, 90B22]
Secondary: 60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.) [See also 90Bxx]

Keywords
Random walk rare events change of measure

Citation

McDonald, D. R. Asymptotics of first passage times for random walk in an orthant. Ann. Appl. Probab. 9 (1999), no. 1, 110--145. doi:10.1214/aoap/1029962599. https://projecteuclid.org/euclid.aoap/1029962599


Export citation

References

  • Aldous, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Springer, New York.
  • Athrey a, K. B., McDonald, D. and Ney, P. (1978). Limit theorems for semi-Markov processes and renewal theory for Markov chains. Ann. Probab. 6 788-797.
  • Baccelli, F. and McDonald, D. (1996). Rare events for stationary processes. Unpublished manuscript.
  • Beck, B., Dabrowski, A. and McDonald, D. (1997). A unified approach to fast teller queues and ATM. Unpublished manuscript.
  • Bonneau, M-C. (1996). Accelerated Simulation of a leaky bucket controller. M.Sc. dissertation, Univ. Ottawa.
  • Br´emaud, P. (1981). Point Processes and Queues, Martingale Dy namics. Springer, New York.
  • Doob, J. L. (1959). Discrete potential theory and boundaries. J. Math. Mech. 8 433-458.
  • Feller, W. (1971). An Introduction to Probability Theory and Its Applications 2. Wiley, New York.
  • Flatto, L. and Hahn, S. (1985). Two parallel queues created by arrivals with two demands I. SIAM J. Appl. Math. 44 1041-1053.
  • Foley, R. and McDonald, D. (1997). Join the shortest queue sy stems: stability and exact asy mptotics. Unpublished manuscript.
  • Frater, M. R., Lennon, T. M. and Anderson B. D. O. (1991). Optimally efficient estimation of the statistics of rare events in queueing networks. IEEE Trans. Automat. Control 36 1395-1405.
  • Glasserman, G. and Kou, S-G. (1995). Analy sis of an importance sampling estimator for tandem queues. ACM Trans. Modeling Comput. Simul. 5 22-42.
  • Heidelberger, P. (1995). Fast simulation of rare events in queueing and reliability models. ACM Trans. Modeling Comput. Simul. 5 43-85.
  • H ¨oglund, T. (1991). The ruin problem for finite Markov chains. Ann. Probab. 19 1298-1310.
  • Huang, C-C. and McDonald, D. (1996). Connection admission control for constant bit rate traffic at a multi-buffer multiplexer using the oldest-cell-first discipline. Unpublished manuscript. Iscoe, I. and McDonald, D. (1994a). Asy mptotics for exit times of Markov jump processes I. Ann. Probab. 22 372-397. Iscoe, I. and McDonald, D. (1994b). Asy mptotics for exit times of Markov jump processes II: application to Jackson networks. Ann. Probab. 22 2168-2182.
  • Iscoe, I., McDonald, D. and Xian, K. (1993). Capacity of ATM switches. Ann. Appl. Probab. 3 277-295.
  • Iscoe, I., McDonald, D. and Xian, K. (1994). Asy mptotics of the exit distribution for Markov jump processes; application to ATM. Canad. J. Math. 46 1238-1262.
  • Keilson, J. (1979). Markov Chain Models-Rarity and Exponentiality. Springer, New York.
  • Kesten, H. (1974). Renewals theory for functionals of a Markov chain with general state space. Ann. Probab. 2 355-386.
  • Labr eche, N. (1995). Overloading a Jackson network of shared queues. M.Sc. dissertation, Univ. Ottawa.
  • Labr eche, N. and McDonald, D. (1995). Overloading a Jackson network of shared queues. Unpublished manuscript.
  • McDonald, D. (1996). Overloading parallel servers when arrivals join the shortest queue. Stochastic Networks: Stability and Rare Events. Lecture Notes in Statist. 117 169-196. Springer, New York.
  • Mey n, P. M. and Frater, M. R. (1993). Recurrence times of buffer overloads in Jackson networks. IEEE Trans. Inform. Theory 39 92-97.
  • Mey n, S. P. and Tweedie R. L. (1993). Markov Chains and Stochastic Stability. Springer, New York.
  • Ney, P. and Nummelin, E. (1986). Some limit theorems for Markov additive processes. In SemiMarkov Models 3-12. Plenum, New York. Ney, P. and Nummelin, E. (1987a). Markov additive processes I. Eigenvalue properties and limit theorems. Ann. Probab. 15 561-592. Ney, P. and Nummelin, E. (1987b). Markov additive processes II. Large deviations. Ann. Probab. 15 593-609.
  • Nicola, V. F., Shahabuddin, P., Heidelberger, P. and Gly nn, P. W. (1992). Fast simulation of steady-state availability in non-Markovian highly dependable sy stems. IBM Research Report.
  • Orey, S. (1971). Limit Theorems for Markov Chain Transition Probabilities. Van Nostrand Reinhold, New York.
  • Parekh, S. and Walrand, J. (1989). A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Automat. Control 34 54-66.
  • Shwartz, A. and Weiss, A. (1993). Induced rare events: analysis via large deviations and time reversal. Adv. in Appl. Probab. 25 667-689.
  • Sadowsky, J. and Szpankowski, W. (1995). The probability of large queue lengths and waiting times in a heterogeneous multiserver queue I: tight limits. Adv. in Appl. Probab. 27 532-566.
  • Wright, P. (1992). Two parallel processors with coupled inputs. Adv. in Appl. Probab. 24 986- 1007.