Summary
We develop a method based on diffusion approximations in order to compute, under general conditions, the queue length distribution of a single queue in a network of queues. Several applications of this approach to computer network performance analysis and to time-sharing systems are presented. The accuracy of model predictions are evaluated by comparison with known exact results in particular cases, with simulation experiments and with the approximation method of Kobayashi and Reiser.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jackson, J. R.: Jobshop-like queueing systems. Management Science 10, 131–142 (1963)
Baskett, F., Chandy, K. M., Muntz, R. R., Palacios, F. G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22, 248–260 (1975)
Newell, G. F.: Applications of queueing theory. London: Chapman and Hall 1971, Chapter 6
Gaver, D. P., Shedler, G. S.: Multiprogramming system performance via diffusion approximations. Operations Research 21, 569–576 (1973)
Gelenbe, E.: On approximate computer system models. J. ACM 22, 261–263 (1975)
Kobayashi, H.: Application of the diffusion approximation to queueing networks: Parts I and II. J. ACM 21, 316–328, 459–469 (1974)
Reiser, M., Kobayashi, H.: Accuracy of the diffusion approximation for some queueing systems. IBM J. R. and D. 18, 110–124 (1974)
Chandy, M., Herzog, U., Woo, L.: Parametric analysis of queueing networks. IBM J. R. and D. 19, 36–42 (1975)
Chang, A., Lavenberg, S. S.: Work-rates in closed queueing networks with general independent servers. Operations Research 22, 838–847 (1974)
Gelenbe, E., Muntz, R. R.: Probabilistic models of computer systems, Part I (Exact results). Acta Informatica 7, 35–60 (1976)
Gelenbe, E.: Probabilistic models of computer systems, Part II (Diffusion approximations, waiting times, and batch arrivals) (to appear)
Burke, P. J.: The output of a queueing system. Operations Research 4, 699–704 (1956)
Reich, E.: Waiting times when queues are in tandem. Annals Mathematical Statistics 28, 768–773 (1957)
Pack, C. D.: The output of an M/D/1 queue. Operations Research 23, 750–760 (1975)
Marshall, K. T.: Some relationships between the distributions of waiting time, idle time, and inter-output time in GI/G/1 queue. SIAM J. Appl. Math. 16, 324–327 (1968)
Disney, R. L., Cherry, W. P.: Some topics in queueing network theory. In: Clarke, A. B. (ed.): Mathematical methods in queueing theory. Berlin: Springer 1974
Pouzin, L.: CIGALE, the packet-switching machine of the cyclades computer network. Proc. IFIP 74 Congress, Stockholm. Amsterdam: North-Holland 1974, p. 155–159
Irland, M.: Simulation of CIGALE, report on assumptions and results. University of Waterloo, CCNG Report E-32, January 1975
Anderson, H. A., Sargent, R.: The statistical evaluation of the performance of an experimental APL/360 system. In: Freiberger, W. (ed.): Statistical computer performance evaluation. London-New York: Academic Press 1972, p. 73–98
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gelenbe, E., Pujolle, G. The behaviour of a single queue in a general queueing network. Acta Informatica 7, 123–136 (1976). https://doi.org/10.1007/BF00265766
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265766