Abstract
Let N(t) be a birth-death process on N = {0,1,2,· ··} governed by the transition rates λ
n
> 0 (n ≧ 0) and μ η
> 0 (n ≧ 1). Let
mTm
be the conditional first-passage time from r to n, given no visit to m where m <r < n. The downward conditional first-passage time
nTm
is defined similarly. It will be shown that , for any λ
n
> 0 and μ η
> 0. The limiting behavior of is considerably different from that of the ordinary first-passage time where, under certain conditions, exponentiality sets in as n →∞. We will prove that, when λ
n
→ λ > 0 and μ η
→ μ > 0 as n → ∞with ρ = λ /μ < 1, one has as r → ∞where T
BP(λ,μ) is the server busy period of an M/M/1 queueing system with arrival rate λand service rate μ.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献