deletions | additions       diff --git a/Queueing.tex b/Queueing.tex  index 7bcfe83..43338aa 100644  --- a/Queueing.tex  +++ b/Queueing.tex 
...
\subsection{Queueing}  The problem is effectively 3 separate \href{http://en.wikipedia.org/wiki/M/G/k_queue}{M/G/c queues}. This makes the problem of calculating the waiting time (given the $\lambda(t)$ we calculated and the distribution $G$ from the data) analytically impossible. However, there are approximations which we could use, but we would have to figure out which ones work best, if at all, (especially considering papers like \href{http://link.springer.com/article/10.1007%2Fs11134-009-9133-x#page-1}{this one} which describe the issues with approximating M/G/c waiting times). Perhaps it's a good idea to check our approximations against simulations. The coefficients of variation for the three job types are 0.652542051874, 2.71118336953 and 2.61351007772.  Perhaps it would also be useful if we can somehow find a (very rough) analytical or numerical approximation of the distribution of waiting times. That way we could integrate this distribution over our penalty function $C(t)$ to calculate the expected penalty we get for a particular waiting time. Maybe we could somehow estimate it by considering each VM independently as a M/G/1 queue and use a numerical Laplace-Stieltjes transform (see \href{http://en.wikipedia.org/wiki/M/G/1_queue}{the M/G/1 Wikipedia page}). Absolutely no idea whether this is possible. Else we could just use simulation again, and fit a function.