Aldo Nassigh edited subsection_The_Elang_C_Formula__.tex  almost 9 years ago

Commit id: 1b9f0b72a92a68c0c6eee1deff20ea9429a4b6f6

deletions | additions      

       

\begin{equation}\label{ErlangC}  P_w = \frac{\frac{a^c}{c!}}{(1-\rho) \sum_{j=0}^{c-1}{\frac{a^j}{j!}} + \frac{a^c}{c!}}  \end{equation}  By looking at \eqref{ErlangC}, we see that, as $\rho$ goes closer  to unity, the probability $P_w$ increases to one $100\%$  (the first term in the denominator of \eqref{ErlangC} vanishes). In practice, the system gets closer to collapse with customers facing an increasing probability of a long queue before being served.