An Approximate Analytical Method for General Queueing Networks

IEEE Transactions on Software Engineering

Volumn SE-5, Issue 5, 1979, Pages 530-538

  Marie, Raymond A ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

equilibrium distribution; Index Terms Approximate solution; performance evaluation; queueing networks; queueing theory; service time distribution

Indexed keywords

EID: 0000120744     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1979.234214     Document Type: Article

References (8)

1. H. Kobayashi, “Application of the diffusion approximation to queueing networks, Part I: Equilibrium queue distributions,” J. Ass. Comput. Mach., vol. 21, pp. 316–328, Apr. 1974.
2. E. Gelenbe, “On approximate computer system models,” J. Ass. Comput. Mach., vol. 22, pp. 261–269, Apr. 1975.
3. K. M. Chandy, U. Herzog, and L. Woo, “Approximate analysis of general queueing networks,” IBM J. Res. Develop., vol. 19, pp. 43–49, Jan. 1975.
4. R. A. Marie, “Methodes iteratives de resolution de modeles mathématiques ematiques de systèmes informatiques,” RAIRO Inform./Comput. Sci., vol. B2, no. 2, pp. 107-122, 1978.
5. W. J. Stewart, “MARCA: Markov chain analyser,” Institut de Recherche en Informatique et Systèmes Aléatoires de Rennes, France, Res. Rep. 45, June 1976.
6. D. R. Cox, “A use of complex probabilities in the theory of stochastic processes,” in Proc. Cambridge Phil. Soc., vol. 51, 1955, pp. 313–319.
7. A. Chang and S. S. Lavenberg, “Work-rates in closed queueing networks with general independent servers,” Oper. Res., vol. 22, pp. 838-847, 1974.
8. R. A. Marie and W. J. Stewart, “A hybrid iterative-numerical method for the solution of a general queueing network,” in Proc. 3rd Symp. on Measuring, Modelling and Evaluating Comput. Syst., Bonn, West Germany, H. Beilner and E. Gelenbe, Eds. Amsterdam: North-Holland, Oct. 1977, pp. 173–199.