This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mean Value Analysis by Chain of Product form Queueing Networks
March 1989 (vol. 38 no. 3)
pp. 432-442
ASCII Text
x 
 
A.E. Conway, E. de Souza e Silva, S.S. Lavenberg, "Mean Value Analysis by Chain of Product form Queueing Networks," IEEE Transactions on Computers, vol. 38, no. 3, pp. 432-442, March, 1989.
 
 
BibTex
x
 
@article{ 10.1109/12.21129,
author = {A.E. Conway and E. de Souza e Silva and S.S. Lavenberg},
title = {Mean Value Analysis by Chain of Product form Queueing Networks},
journal ={IEEE Transactions on Computers},
volume = {38},
number = {3},
issn = {0018-9340},
year = {1989},
pages = {432-442},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.21129},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Mean Value Analysis by Chain of Product form Queueing Networks
IS - 3
SN - 0018-9340
SP432
EP442
EPD - 432-442
A1 - A.E. Conway,
A1 - E. de Souza e Silva,
A1 - S.S. Lavenberg,
PY - 1989
KW - computational algorithm; mean performance measures; mean value analysis by chain; RECAL; computational complexity; computer networks; performance evaluation; queueing theory.
VL - 38
JA - IEEE Transactions on Computers
ER -
 
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 va

[1] A. E. Conway, "A polynomial complexity mean value analysis algorithm for multiple-chain closed queueing networks," inDig. Papers, 1986 IEEE Int. Symp. Inform. Theory, Ann Arbor, MI, 1986.
[2] A. E. Conway and N. D. Georganas, "RECAL, A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks,"J. ACM, vol. 33, pp. 768-791, 1986.
[3] E. de Souza e Silva and S. S. Lavenberg, "A mean value analysis by chain algorithm for product form queueing networks," IBM Res. Rep. RC 11641, Yorktown Heights, NY, 1986.
[4] E. de Souza e Silva and R. R. Muntz, "A simple relationship among moments of queue lengths in product form queueing networks,"IEEE Trans. Comput., vol. 37, pp. 1125-1130, Sept. 1988.
[5] A. Goyal, S. S. Lavenberg, and K. S. Trivedi, "Probabilistic modeling of computer system availability," IBM Res. Rep. RC 11076,Ann. Oper. Res., vol. 8, pp. 285-306, 1987.
[6] M. Reiser and H. Kobayashi, "Queueing networks with multiple closed chains-Theory and computational algorithms,"IBM J. Res. Develop., vol. 19, pp. 283-294, 1975.
[7] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[8] S. Tucci and E. A. MacNair, "Implementation of mean value analysis for open, closed and mixed queueing networks,"Comput. Perform., vol. 3, pp. 233-239, 1982.
[9] J. Zahorjan, "The distribution of network states during residence times in product form queueing networks,"Perform. Eval., vol. 4, pp. 99-104, 1984.

Index Terms:
computational algorithm; mean performance measures; mean value analysis by chain; RECAL; computational complexity; computer networks; performance evaluation; queueing theory.
Citation:
A.E. Conway, E. de Souza e Silva, S.S. Lavenberg, "Mean Value Analysis by Chain of Product form Queueing Networks," IEEE Transactions on Computers, vol. 38, no. 3, pp. 432-442, March 1989, doi:10.1109/12.21129
Usage of this product signifies your acceptance of the Terms of Use.