Abstract
A multiphase queueing system is considered. The service time of the nth arrival at the ith server is $T_{n,i} $ and ${\bf P}\{ T_{n,1} = \cdots = T_n \} = 1$, where $\{ T_n \} $ are independent identically distributed random variables with an arbitrary common distribution. Let $U_l (n)$ be the time spent by the l arrival at the lth server. Some algebraic properties of the sequence $\{ U_l (n)\} (l \geq 2)$ are cleared up. In the case of Poisson input flow, the distributions of some characteristics of the system are obtained, as well as a number of limit theorems for the situation where the number of servers grows infinitely.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call