Content deleted Content added
Line 9:
Tijms ''et al.'' believe it is "not likely that computationally tractable methods can be developed to compute the exact numerical values of the steady-state probability in the M/G/''k'' queue."<ref name="tijms">{{cite jstor|1426474}}</ref>
Various approximations for the average queue size,<ref>{{cite doi|10.1287/opre.43.1.158}}</ref> stationary distribution<ref>{{cite doi|10.1007/s11134-008-9073-x}}</ref><ref>{{cite jstor|169760}}</ref> and approximation by a [[reflected Brownian motion]]<ref>{{cite doi|10.1287/opre.31.2.304}}</ref><ref name="yao">{{cite doi|10.1287/opre.33.6.1266}}</ref> have been offered by different authors. Recently a new approximate approach based on [[Laplace transform]] for steady state probabilities has been proposed by Hamzeh Khazaei ''et al.'' <ref>{{cite doi|10.1109/TPDS.2011.199}}</ref><ref>{{cite doi|10.1109/ICDCSW.2011.13}}</ref>. This new approach is yet accurate enough in cases of large number of servers and
==Average delay/waiting time==
| |||