This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks
September 1988 (vol. 37 no. 9)
pp. 1125-1129
Obtains simple relationships among partial derivatives and moments of mean queue lengths in product form queueing network models. It is shown that the mean value analysis equations can be used to obtain recursive expressions which make it possible to easily evaluate these moments in a mean value analysis type recursion. These results are also considered important in applications such as optimiz

[1] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[2] J. P. Buzen, "Computational algorithms for closed queueing networks with exponential servers,"Commun. ACM, vol. 16, no. 9, Sept. 1973.
[3] 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.
[4] A. E. Conway, E. de Souza e Silva, and S. S. Lavenberg, "Mean value analysis by chain of product form queueing networks," IBM Res. Rep., RC 11641, Apr. 1986;IEEE Trans. Comput., to be published.
[5] E. de Souza e Silva, "Algorithms for queueing network analysis of distributed systems," UCLA Tech. Rep. 840040, 1984.
[6] E. de Souza e Silva and M. Gerla, "Load balancing in distributed systems with multiple classes and site constraints,"Performance '84, 1984, pp. 17-33.
[7] A. Goyal, W. C. Carter, E. de Souza e Silva, S. S. Lavenberg, and K. S. Trivedi, "The system availability estimator," inProc. FTCS-16, July 1986, pp. 84-89.
[8] A. Goyal, S. S. Lavenberg, and K. S. Trivedi, "Probabilistic modeling of computer systems availability," IBM Res. Rep., RC 11076, Mar. 1985; inAnn. Oper. Res., to be published.
[9] H. Heffes, "Moment formulae for a class of mixed multi-job-type queueing networks,"Bell Syst. Tech. J., vol. 61, pp. 709-745, May-June 1982.
[10] J. R. Kenevan and A. K. von Mayrhauser, "Complexity and concavity properties of analytic queueing models for computer systems," inPerformance 84 Proc.Amsterdam, The Netherlands: North Holland, Dec. 84, pp. 361-375.
[11] H. Kobayashi and M. Gerla, "Optimal routing in closed queueing networks,"ACM Trans. Comput. Syst., vol. 1, pp. 294-310, Nov. 1983.
[12] S.S. Lavenberg,Computer Performance Modeling Handbook, Academic Press, New York, 1983.
[13] M. Reiser and H. Kobayashi, "On the convolution algorithm for separable queueing networks," inProc. Int. Symp. Comput. Perform., 1976, pp. 109-117.
[14] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[15] J. Strelen, "A generalization of mean value analysis for higher moments: Moment analysis," inPerformance 86 Proc., May 1986, pp. 129-140.
[16] K. S. Trivedi and R. E. Kinicki, "A model for computer configuration design,"Computer, vol. 13, pp. 47-54, Apr. 1980.

Index Terms:
queue lengths; product form; queueing networks; partial derivatives; moments; mean queue lengths; queueing network models; mean value analysis; recursive expressions; optimization problems; sensitivity analysis; optimisation; performance evaluation; queueing theory; sensitivity analysis.
Citation:
E. de Souza e Silva, R.R. Muntz, "Simple Relationships Among Moments of Queue Lengths in Product form Queueing Networks," IEEE Transactions on Computers, vol. 37, no. 9, pp. 1125-1129, Sept. 1988, doi:10.1109/12.2264
Usage of this product signifies your acceptance of the Terms of Use.