## Subexponential Asymptotics of a Markov-Modulated Random Walk with Queueing Applications (1996)

Citations: | 45 - 15 self |

### BibTeX

@TECHREPORT{Jelenkovic96subexponentialasymptotics,

author = {Predrag R. Jelenkovic and Aurel A. Lazar},

title = {Subexponential Asymptotics of a Markov-Modulated Random Walk with Queueing Applications},

institution = {},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

Let f(Xn; Jn)g be a stationary Markov-modulated random walk on R\Theta E (E finite), defined by its probability transition matrix measure F = fF ij g; F ij (B) = P[X 1 2 B; J 1 = jjJ 0 = i]; B 2 B(R); i; j 2 E. If F ij ([x; 1))=(1 \Gamma H(x)) ! W ij 2 [0; 1), as x! 1, for some longtailed distribution function H, then the ascending ladder heights matrix distribution G+ (x) (right Wiener-Hopf factor) has long-tailed asymptotics. If EXn! 0, at least one W ij? 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 P \Theta sup n0 Sn? x