Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
Finite-Source Queueing Systems and their Applications
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
János Sztrik 2001/08/05<br />
P0 =<br />
� r�<br />
n=0<br />
� �<br />
N<br />
ρ<br />
n<br />
n +<br />
N�<br />
n=r+1<br />
� �<br />
N n!<br />
n r!rn−rρn �−1 In the following only the main performace measures characteristic of<br />
machine interference problem are mentioned.<br />
1. The expected (average) number of down machines is<br />
E[L] =<br />
N�<br />
nPn<br />
n=0<br />
It can be seen that there is no closed-form expression for E(L) in general,<br />
but for a particular problem (system), E[L] is easily computed. There is a<br />
closed-form expression for single-server (only one operator) systems. In this<br />
case<br />
<strong>Finite</strong>-<strong>Source</strong> <strong>Queueing</strong> <strong>Systems</strong> <strong>and</strong> <strong>their</strong> <strong>Applications</strong>
Change language