this is for holding javascript data
Aldo Nassigh edited section_Analytical_Treatment_In_this__.tex
almost 9 years ago
Commit id: ab5fe9d6fbbb8d6d66d353acfb4e0cd4de100f98
deletions | additions
diff --git a/section_Analytical_Treatment_In_this__.tex b/section_Analytical_Treatment_In_this__.tex
index 4e70de3..1930d32 100644
--- a/section_Analytical_Treatment_In_this__.tex
+++ b/section_Analytical_Treatment_In_this__.tex
...
The number of customers in the system is a discrete random variable that evolves according to a \textit{continuous time Markov chain}, with the following transition probabilities:
\begin{itemize}
\item probability $p_{up}$ that in the time interval $\Delta t$ the number of customers in the system increases by one unit is $p_{up} = \lambda \Delta t$;
\item probability $p_{down}$ that in the time interval $\Delta t$ the number of customers in the system decreases by one unit is $p_{down} = \mu \Delta t$ if there is a single customer in the system. If there are more customers, the probability $p_{down}$ increases, since there are several
serves servers available, so that $p_{down} = 2 \mu \Delta t$ if there are two customers, $p_{down} = 3 \mu \Delta t$ if the number of customers in the system is three and so on. However, if the number of customers in the system equals the number of servers, the system is saturated and a queue is formed.
\end{itemize}
The state space diagram for this chain is as below: