Leo Liberti, James Ostrowski
Journal of Global Optimization
The solution of separable closed queueing networks requires the evaluation of homogeneous multinomial expressions. The number of terms in those expressions grows combinatorially with the size of the network such that a direct summation may become impractical. An algorithm is given which does not show a combinatorial operation count. The algorithm is based on a generalization of Horner's rule for polynomials. It is also shown how mean queue size and throughput can be obtained at negligible extra cost once the normalization constant is evaluated. © 1975, ACM. All rights reserved.
Leo Liberti, James Ostrowski
Journal of Global Optimization
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
B.K. Boguraev, Mary S. Neff
HICSS 2000