The Community for Technology Leaders
Green Image
<p>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/).</p>
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 and R. Muntz, "A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks," in IEEE Transactions on Computers, vol. 39, no. , pp. 840-842, 1990.
93 ms
(Ver 3.3 (11022016))