By Topic

Mean value analysis by chain of product form queueing networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. E. Conway ; GTE Labs. Inc., Waltham, MA, USA ; E. de Souza e Silva ; S. S. Lavenberg

A computational algorithm is developed for closed multichain product-form queueing networks. For networks that consist of only single-server fixed rate and infinite-server service centers, it involves only mean performance measures. The algorithm, called mean value analysis by chain (MVAC), is based on a recursion that is quite different in form from the recursion used in the well-known mean value analysis (MVA) algorithm and has quite different computational and storage costs. For networks with few service centers and many chains, MVAC typically has much lower costs than MVA, although it becomes more costly than MVA as the number of service centers increases. The MVAC recursion is similar in structure to a recursion involving normalizing constants that was derived by A.E. Conway and N.D. Georganas (1986). That recursion formed the basis for their recursion by chain (RECAL) algorithm for computing the normalizing constant and from it the mean performance measures. The computational and storage costs for MVAC are shown to be similar to those for RECAL

Published in:

IEEE Transactions on Computers  (Volume:38 ,  Issue: 3 )