Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given. © 1980, ACM. All rights reserved.
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
John M. Boyer, Charles F. Wiecha
DocEng 2009
Oliver Bodemer
IBM J. Res. Dev