×

Further remarks on queueing network theory. (English) Zbl 0659.60123

Because the authors have tried to write a short review updating a number of aspects of the theory of queueing networks, they have had to deal with major topics in only a few paragraphs. The result is a review paper which, in some areas, devotes insufficient space and consequently leaves out a number of relevant papers and ideas. In future it may be preferable for short reviews to concentrate on the relations between queueing networks and just one of the topics quasi reversibility, sojourn times, insensitivity and traffic processes.
Reviewer: W.Henderson

MSC:

60K20 Applications of Markov renewal processes (reliability, queueing networks, etc.)
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
Full Text: DOI

References:

[1] Baccelli, F.; Brémaud, P., Palm Probabilities and Stationary Queues, (Lecture Notes in Statistics, 41 (1987), Springer: Springer Berlin) · Zbl 0624.60107
[2] Barbour, A., Generalized semi-Markov schemes and open queueing networks, Journal of Applied Probability, 19, 469-474 (1982) · Zbl 0481.60085
[3] Baskett, F.; Chandy, K. M.; Muntz, R.; Palacios, J., Open, closed, and mixed networks of queues with different classes of customers, Journal of the Association for Computing Machinery, 22, 248-260 (1975) · Zbl 0313.68055
[4] Berman, M.; Westcott, M., On queueing systems with renewal departures, Advances in Applied Probability, 15, 657-673 (1983) · Zbl 0519.60091
[5] Brockmeyer, E.; Halstrøm, H. L.; Jensen, A., The life and works of A.K. Erlang, Transactions of the Danish Academy of Sciences, 2 (1948), Copenhagen · Zbl 0033.05101
[6] Burke, P. J., The output of a queueing system, Operations Research, 4, 699-704 (1956) · Zbl 1414.90097
[7] Buzen, J. P., Computational algorithm for closed queueing networks with exponential servers, Communications of the Association for Computing Machinery, 16, 527-531 (1973) · Zbl 0261.68031
[8] Çinlar, E., Introduction to Stochastic Processes (1975), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0341.60019
[9] Daley, D., The correlation structure of the output process of some single server queueing systems, Annals of Mathematical Statistics, 39, 1007-1019 (1968) · Zbl 0162.49202
[10] Disney, R. L.; Farrell, R. L.; de Morais, P. R., A characterization of M/G/1/N queues with renewal departures, Management Science, 20, 1222-1228 (1973) · Zbl 0272.60060
[11] Disney, R. L.; de Morais, P. R., Covariance properties for the departure process of M/\(E_k/1/N\) queues, American Institute of Industrial Engineers Transactions, 8, 169-175 (1976)
[12] Disney, R. L.; König, D., Queueing networks: A survey of their random processes, SIAM Review, 27, 335-403 (1985) · Zbl 0581.60075
[13] Disney, R. L.; Kiessler, P. C., Traffic Processes in Queueing Networks: A Markov Renewal Approach (1987), John Hopkins University Press: John Hopkins University Press Baltimore, MD · Zbl 0713.90032
[14] Ellis, R. S., Entropy, Large Deviations, and Statistical Mechanics (1985), Springer: Springer New York · Zbl 0566.60097
[15] Feller, W., An Introduction to Probability Theory and its Applications (1966), Wiley: Wiley New York · Zbl 0138.10207
[16] Franken, P.; König, D.; Arndt, U.; Schmidt, V., Queues and Point Processes (1982), Wiley: Wiley New York · Zbl 0505.60058
[17] Gordon, W. J.; Newell, G. F., Closed queueing systems with exponential servers, Operations Research, 15, 254-265 (1967) · Zbl 0168.16603
[18] Harrison, J. M., Brownian Motion and Stochastic Flow Systems (1985), Wiley: Wiley New York · Zbl 0659.60112
[19] Jackson, J. R., Networks of waiting lines, Operations Research, 5, 518-521 (1957) · Zbl 1414.90067
[20] Jacobs, D. R.; Schach, S., Stochastic order relations between GI/G/K systems, Annals of Mathematical Statistics, 43, 1623-1633 (1972) · Zbl 0255.60065
[21] Jansen, U.; König, D.; Nawrotski, K., A criterion for insensitivity for a class of queueing systems with random marked point process, Mathematische Operations-forschung und Statistik Series Optimization, 10, 379-403 (1979) · Zbl 0417.60088
[22] Kelly, F. P., Reversibility and Stochastic Networks (1979), Wiley: Wiley New York · Zbl 0422.60001
[23] Kiessler, P. C., A note on the equivalence of input and output intervals in Jackson networks, Operations Research (1988), (in revision)
[24] Kiessler, P. C.; Foley, R. D.; Melamed, B.; Yadin, M., Analysis of a three node Jackson network, Queueing Systems (1988), (to appear) · Zbl 0654.60078
[25] König, D.; Matthes, K.; Nawrotski, K., Generalization of the Erlang and Engset Formulae (A Method in Queueing Theory) (1967), Akademie: Akademie Berlin
[26] König, D.; Schmidt, V., Relationships between time and customer-stationary characteristics of service systems, (Proceedings of the Conference on Point Processes and Queueing Theory. Proceedings of the Conference on Point Processes and Queueing Theory, Kesthely, 1978 (1978), North-Holland: North-Holland Amsterdam), 181-225 · Zbl 0475.60079
[27] König, D., Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes, Journal of Applied Probability, 17, 521-543 (1980) · Zbl 0435.60094
[28] Labetoulle, J.; Pujolle, G.; Soula, C., Stationary distributions of flows in Jackson networks, Mathematics of Operations Research, 6, 173-185 (1981) · Zbl 0502.90030
[29] Lemoine, A., On sojourn times in Jackson networks of queues, Journal of Applied Probability, 24, 495-510 (1987) · Zbl 0627.60092
[30] Lindly, D. V., The theory of queues with a single server, (Proceedings of the Cambridge Philosophical Society, 48 (1952)), 277-289 · Zbl 0046.35501
[31] Matthes, K., On the theory of queueing processes, (Transactions of the Prague Conference on Information Theory, Statistics, Decision Functions and Random Processes. Transactions of the Prague Conference on Information Theory, Statistics, Decision Functions and Random Processes, Prague, 1964 (1962)), 513-528 · Zbl 0134.14303
[32] Melamed, B., Characterizations of Poisson traffic streams in Jackson queueing networks, Advances in Applied Probability, 11, 422-438 (1979) · Zbl 0399.60088
[33] Melamed, B., Sojourn times in queueing networks, Mathematics of Operations Research, 7, 223-244 (1982) · Zbl 0502.90029
[34] Melamed, B., On Markov jump processes imbedded at jump epochs and their queueing theoretic application, Mathematics of Operations Research, 7, 111-128 (1982) · Zbl 0497.60075
[35] Melamed, B.; Yadin, M., Numerical computation of sojourn time distributions in queueing networks, Journal of the Association for Computing Machinery, 31, 839-854 (1984) · Zbl 0628.68037
[36] Reich, E., Waiting times when queues are in tandem, Annals of Mathematical Statistics, 34, 768-773 (1957) · Zbl 0085.34705
[37] Ross, S., Stochastic Processes (1983), Wiley: Wiley New York · Zbl 0555.60002
[38] Schassberger, R., Insensitivity of steady-state distribution of generalized semi-Markov processes—Part I, The Annals of Probability, 5, 87-99 (1977) · Zbl 0363.60094
[39] Schassberger, R., Insensitivity of steady state distribution of generalized semi-Markov processes with speeds, Advances in Applied Probability, 10, 836-851 (1978) · Zbl 0396.60085
[40] schassberger, R., The insensitivity of stationary probabilities in networks of queues, Advances in Applied Probability, 10, 906-912 (1978) · Zbl 0396.60087
[41] Schassberger, R., Two remarks on insensitive stochastic models, Advances in Applied Probability, 18, 719-814 (1986) · Zbl 0623.60110
[42] Schassberger, R.; Daduna, H., Sojourn times in queueing networks with multiserver nodes, Journal of Applied Probability, 24, 511-521 (1987) · Zbl 0629.60101
[43] Simon, B.; Foley, R. D., Some results on sojourn times in acyclic Jackson networks, Management Science, 25, 1027-1034 (1979) · Zbl 0465.90034
[44] Sonderman, D., Comparing multi-server queues with finite waiting rooms I: Same number of servers, Advances in Applied Probability, 11, 439-447 (1979) · Zbl 0398.60092
[45] Sonderman, D., Comparing multi-server queues with finite waiting rooms II: different number of servers, Advances in Applied Probability, 11, 448-455 (1979) · Zbl 0398.60093
[46] Stoyan, D., (Daley, D., Comparison Methods for Queues and Other Stochastic Models (1983), Wiley: Wiley New York) · Zbl 0536.60085
[47] Syski, R., Introduction to Congestion Theory in Telephone Systems (1960), Oliver and Boyd: Oliver and Boyd Edinburgh · Zbl 0095.32801
[48] Takács, L., Introduction to Queueing Theory (1962), Oxford University Press: Oxford University Press New York · Zbl 0118.13503
[49] Walrand, J., Poisson flows in single class open networks of quasi-reversible queues, Stochastic Processes and their Applications, 13, 293-303 (1982) · Zbl 0486.60085
[50] Walrand, J., Discussant report of networks of quasi-reversible nodes, (Disney, R. L.; Ott, T. J., Applied Probability—Computer Science, The Interface, Volume I (1982), Birkhauser: Birkhauser Boston, MA), 27-30, by F.P. Kelly · Zbl 0636.00014
[51] Whitt, W., Comparing counting processes and queues, Advances in Applied Probability, 13, 207-220 (1981) · Zbl 0449.60064
[52] Whittle, P., Systems in Stochastic Equilibrium (1986), Wiley: Wiley New York · Zbl 0589.93072
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.