Asymptotic behaviour of a stopping time related to cumulative sum procedures and single-server queues
Keyword(s):
For a sequence ξ1, ξ2, · ·· of i.i.d. random variables let X0 = 0 and Xk = max(Xk–1 + ξ k, 0) for k = 1, 2, ···. Let . These stopping times are used in Page's (1954) one-sided cusum procedures and are also important in queueing theory. Various asymptotic properties of Nx are derived.
1987 ◽
Vol 24
(01)
◽
pp. 200-214
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol 51
(2)
◽
pp. 483-491
◽
Keyword(s):
2018 ◽
Vol 48
(14)
◽
pp. 3549-3557
◽
1994 ◽
Vol 31
(04)
◽
pp. 949-957
◽
Keyword(s):