Hostname: page-component-745bb68f8f-kw2vx Total loading time: 0 Render date: 2025-01-14T20:38:15.909Z Has data issue: false hasContentIssue false
  • English
  • Français

Subexponential asymptotics of a Markov-modulated random walk with queueing applications

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Predrag R. Jelenković  and
Aurel A. Lazar
Predrag R. Jelenković*
Affiliation:
Bell Laboratories
Aurel A. Lazar*
Affiliation:
Columbia University
*
∗Postal address: Bell Laboratories, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ 07974, USA. E-mail address: predrag@bell-labs.com
∗∗Postal address: Department of Electrical Engineering and CTR, Columbia University, New York, NY 10027, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Let {(Xn,Jn)} be a stationary Markov-modulated random walk on ℝ x E (E is finite), defined by its probability transition matrix measure F = {Fij}, Fij(B) = ℙ[X1 ∈ B, J1 = j | J0 = i], B ∈ B(ℝ), i, j ∈ E. If Fij([x,∞))/(1-H(x)) → Wij ∈ [0,∞), as x → ∞, for some long-tailed distribution function H, then the ascending ladder heights matrix distribution G+(x) (right Wiener-Hopf factor) has long-tailed asymptotics. If 𝔼Xn < 0, at least one Wij > 0, and H(x) is a subexponential distribution function, then the asymptotic behavior of the supremum of this random walk is the same as in the i.i.d. case, and it is given by ℙ[supn≥0Sn > x] → (−𝔼Xn)−1 ∫x∞ ℙ[Xn > u]du as x → ∞, where Sn = ∑1nXk, S0 = 0. Two general queueing applications of this result are given.

First, if the same asymptotic conditions are imposed on a Markov-modulated G/G/1 queue, then the waiting time distribution has the same asymptotics as the waiting time distribution of a GI/GI/1 queue, i.e., it is given by the integrated tail of the service time distribution function divided by the negative drift of the queue increment process. Second, the autocorrelation function of a class of processes constructed by embedding a Markov chain into a subexponential renewal process, has a subexponential tail. When a fluid flow queue is fed by these processes, the queue-length distribution is asymptotically proportional to its autocorrelation function.

Keywords

Non-Cramér type conditionssubexponential distributionsMarkov-modulated random walkWeiner-Hopf factorizationsupremum distributionsubexponential dependencyfluid flow queue

MSC classification

Secondary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 2 , June 1998 , pp. 325 - 347
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abate, J., Choudhury, G.L., and Whitt, W. (1994). Waiting-time tail probabilities in queues with long-tail service-time distributions. Queueing Systems. 16, 311–338.Google Scholar
Arndt, K. (1980). Asymptotic properties of the distributions of the supremum of random walk on a Markov chain. Theory Prob. Appl. 25, 253–267.Google Scholar
Asmussen, S. (1989). Aspects of matrix Wiener–Hopf factorization in applied probability. Math. Scientist 14, 101–116.Google Scholar
Asmussen, S. (1991). Ladder heights and the Markov–modulated M/G/1 queue. Stoch. Proc. Appl. 37, 313–326.Google Scholar
Asmussen, S., Henriksen, L.F. and Klüppelberg, C. (1994). Large claims approximations for risk processes in a Markovian environment. Stoch. Proc. Appl. 54, 29–43.Google Scholar
Athreya, K.B., and Ney, P.E. (1972). Branching Processes. Springer.Google Scholar
Baccelli, F., and Bremaud, P. (1994). Elements of Queueing Theory: Palm–Martingale Calculus and Stochastic Recurrence. Springer.Google Scholar
Billingsley, P. (1986). Probability and Measure. John Wiley & Sons.Google Scholar
Bingham, N.H., Goldie, C.M., and Teugels, J.L. (1987). Regular Variation. Cambridge University Press, Cambridge.Google Scholar
Borovkov, A.A. (1976). Stochastic Processes in Queueing Theory. Springer.Google Scholar
Chistakov, V.P. (1964). A theorem on sums of independent positive random variables and its application to branching random processes. Theor. Prob. Appl. 9, 640–648.Google Scholar
Chow, Y.S., and Teicher, H. (1988). Probability Theory. Springer.CrossRefGoogle Scholar
Chung, K.L. (1960). Markov Chains with Stationary Transition Probabilities. Springer, New York, p. 52.Google Scholar
Cinlar, E. (1975). Introduction to Stochastic Processes. Prentice-Hall.Google Scholar
Cline, D.B. H. (1986). Convolution tails, product tails and domains of attraction. Prob. Theory Rel. Fields 72, 529–557.Google Scholar
Cline, D.B. H. (1987). Convolution of distributions with exponential and subexponential tails. J. Austral. Math. Soc. (Series A) 43, 347–365.Google Scholar
Cohen, J.W. (1973). Some results on regular variation for distributions in queueing and fluctuation theory. J. Appl. Prob. 10, 343–353.Google Scholar
Elwalid, A., Heyman, D., Lakshman, T.V., Mitra, D., and Weiss, A. (1995). Fundamental bounds and approximations for atm multiplexers with applications to video teleconferencing. IEEE Journal on Selected Areas in Communications 13, 1004–1016.Google Scholar
Embrechts, P., Goldie, C.M., and Veraverbeke, N. (1979). Subexponentiality and infinite divisibility. Z. Wahrscheinlichkeitsth. 49, 335–347.Google Scholar
Feller, W. (1971). An Introduction to Probability Theory and its Application, Volume II. Wiley, New York.Google Scholar
Garett, M.W., and Willinger, W. (1994). Analysis, modeling and generation of self-similar VBR video traffic. SIGCOMM'94 269–280.Google Scholar
Glynn, P.V., and Whitt, W. (1994). Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. In Studies in Applied Probability. Papers in honour of Lajos Takaćs, eds. Galambos, J. and Gani, J. (J. Appl. Prob. Special Volume 31A.) Alden Press Ltd, Oxford, pp. 131–156.Google Scholar
Jelenković, P.R., Lazar, A.A., and Semret, N. (1996). Multiple time scales and subexponentiality in MPEG video streams. International IFIP-IEEE Conference on Broadband Communications.Google Scholar
Karamata, J. (1930). Sur un mode de croissance régulière des fonctions. Mathematica (Cluj) 4, 38–53.Google Scholar
Klüppelberg, C. (1988). Subexponential distributions and integrated tails. J. Appl. Prob. 25, 132–141.Google Scholar
Klüppelberg, C. (1989). Subexponential distributions and characterizations of related classes. Prob. Theory Rel. Fields 82, 259.Google Scholar
Loynes, R.M. (1968). The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.CrossRefGoogle Scholar
Pakes, A.G. (1975). On the tails of waiting-time distribution. J. Appl. Prob. 12, 555–564.Google Scholar
Veraverbeke, N. (1977). Asymptotic behavior of Wiener–Hopf factors of a random walk. Stoch. Proc. Appl. 5, 27–37.Google Scholar
Willekens, E., and Teugels, J.L. (1992). Asymptotic expansion for waiting time probabilities in an M/G/1 queue with long-tailed service time. Queueing Systems 10, 295–312.Google Scholar