deletions | additions       diff --git a/subsection_The_Elang_C_Formula__.tex b/subsection_The_Elang_C_Formula__.tex  index 7ac293e..1309ff6 100644  --- a/subsection_The_Elang_C_Formula__.tex  +++ b/subsection_The_Elang_C_Formula__.tex 
...
\subsection{The Elang "C" Formula}  The Markov chain above was solved analytically by Erlang. If the average server utilization $\rho$ is greater then one, the system is unstable and the queue grows indefinitely. If $\rho$ is smaller than one, a steady state exists, however, since the number of customers in it is a stochastic variable, the probability $P_w$ of a new customer not having immediate access to a server - i.e the probability that a \textit{queue} is formed - is finite and is assigned by the so-called Erlang "C" formula - see: \cite{allen1978queueing} page 274: 276:  \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} 
...