Examples of numerical bounds are given for the distribution of the duration of the busy period in the context of a single server queue with random arrivals and (special) Erlangian service time. The ...
This is a preview. Log in through your library . Abstract This paper considers ergodic, continuous-time Markov chains {X (t)} tɛ(-∞, ∞) on Z + = {0, 1,…}. For an arbitrarily fixed N∊ Z+, we study the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback