This Article 
 Bibliographic References 
 Add to: 
A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks
June 1990 (vol. 39 no. 6)
pp. 840-842

Linearizer is one of the best known approximation algorithms for obtaining numeric solutions for closed-product-form queueing networks. In the original exposition of Linearizer, the computational cost was stated to be O(MK/sup 3/) for a model with M queues and K job classes. It is shown that with some straightforward algebraic manipulation, Linearizer can be modified to require a cost that is only O(MK/sup 2/).

[1] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[2] K. Chandy and D. Neuse, "Linearizer: A heuristic algorithm for queueing network models of computing systems,"Commun. ACM, vol. 25, no. 2, pp. 126-134, 1982.
[3] E. A. de Souza e Silva, S. S. Lavenberg, and R. R. Muntz, "Clustering approximation technique for queueing network models with a large number of chains,"IEEE Trans. Computers, vol. C-35, pp. 419-430, May 1986.

Index Terms:
omputational cost; Linearizer algorithm; approximation algorithms; numeric solutions; closed-product-form queueing networks; algebraic manipulation; approximation theory; performance evaluation; queueing theory.
E. de Souza e Silva, R.R. Muntz, "A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks," IEEE Transactions on Computers, vol. 39, no. 6, pp. 840-842, June 1990, doi:10.1109/12.53607
Usage of this product signifies your acceptance of the Terms of Use.