Summary
Many analytical results are available for a network of queues when the nodes in the network have a simplifying property. This property, called here quasi-reversibility, was first identified by Muntz and has since been investigated by a number of authors. A closely related concept, partial balance, has been central to the investigation of insensitivity begun by Matthes.
Here we describe the concept of quasi-reversibility, provide new examples of quasi-reversible nodes, discuss the range of arrival rates for which a node remains quasi-reversible, and analyse a model of a communication network insensitive to patterns of dependence more general than have previously been considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbour, A. D. (1976) Networks of queues and the method of stages. Adv. in Appl. Probab. 8, 584–591.
Baskett, F., Chandy, K. M., Muntz, R. R., and Palacios, F. G. (1975) Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach., 22, 248–260.
Beutler, F. J., Melamed, B., and Zeigler, B. P. (1977) Equilibrium properties of arbitrarily interconnected queueing networks. In P. R. Krishnaiah (Ed.), Multivariate Analysis IV, North-Holland, Amsterdam, pp. 351–370.
Chandy, K. M., Herzog, U. and Woo, L. (1975) Parametric analysis of queueing networks. IBM J. Res. Develop. 19, 36–42.
Chandy, K. M., Howard, J. H., and Towsley, D. F. (1977) Product form and local balance in queueing networks. J. Assoc. Comput. Mach., 24, 250–263.
Kelly, F. P. (1975) Networks of queues with customers of different types. J. Appl. Probab., 12, 542–554.
Kelly, F. P. (1976) Networks of queues. Adv. in Appl. Probab., 8, 416–432.
Kelly, F. P. (1979) Reversibility and Stochastic Networks, Wiley, New York.
Kendall, D. G, and Reuter, G. E. H. (1957) The calculation of the ergodic projection for Markov chains and processes with a countable infinity of states. Acta Math., 97, 103–143.
Kingman, J. F. C. (1969) Markov population processes. J. Appl. Probab., 6, 1–18.
Konig, D., and Jansen, U. (1974) Stochastic processes and properties of invariance for queueing systems with speeds and temporary interruptions. Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, and Random Processes, and of the 1974 European Meeting of Statisticians, Czechoslovak Academy of Sciences, pp. 335–343.
Konig, D., Matthes, K., and Nawrotzki, K. (1967) Verallgemeinerungen der Erlangschen und Engsetschen Formeln ( Eine Methode in der Bedienungstheorie ), Akademie-Verlag, Berlin.
Lam, S. S. (1977) Queueing Networks with population size constraints. IBM J. Res. Develop., 21, 370–378.
Lavenberg, S. S. and Reiser, M. (1980) Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. J. Appl. Probab., 17, 1048–1061.
Matthes, K. (1962) Zur Theorie der Bedienungsprozesse. Transactions of the Third Prague Conference on Information Theory, Statistical Decision Functions, and Random Processes, Czechoslovak Academy of Sciences, pp. 513–528.
Melamed, B. (1979) On Poisson traffic processes in discrete-state Markovian systems with application to queueing theory. Adv. in Appl. Probab., 11, 218–239.
Muntz, R. R. (1972) Poisson Departure Processes and Queueing Networks, IBM Research Report RC4145. A shortened version appeared in Proceedings of the Seventh Annual Conference on Information Science and Systems, Princeton, 1973, pp. 435–440.
Schassberger, R. (1977) Insensitivity of steady-state distributions of generalized semi-Markov processes, Part I. Ann. Probab., 5, 87–99.
Schassberger, R. (1978) Insensitivity of steady-state distributions of generalized semi-Markov processes, Part II. Ann. Probab., 6, 85–93.
Schassberger, R. (1978) The insensitivity of stationary probabilities in networks of queues. Adv. in Appl. Probab., 10, 906–912.
Sevcik, K. C. and Mitrani, I. (1981) The distribution of queueing network states at input and output instants. J. Assoc. Comput. Mach., 28, 358–371.
Towsley, D. (1980) Queueing network models with state-dependent routing. J. Assoc. Comput. Mach., 27, 323–337.
Walrand, J. and Varaiya, P. (1980) Interconnections of Markov chains and quasi-reversible queueing networks. Stochastic Process. Appl., 10, 209–219.
Whittle, P. (1967) Nonlinear migration processes. Bull. Inst. Internat. Statist., 42, 642–647.
Whittle, P. (1972) Statistics and critical points of polymerization processes. Supplement Adv. in Appl. Probab., 199–220. Statistical Laboratory, University of Cambridge, 16 Mill Lane, Cambridge CB2 1SB, ENGLAND
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Birkhäuser Boston, Inc.
About this chapter
Cite this chapter
Kelly, F.P., Walrand, J. (1982). Networks of Quasi-Reversible Nodes. In: Disney, R.L., Ott, T.J. (eds) Applied Probability-Computer Science: The Interface Volume 1. Progress in Computer Science, vol 2. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-5791-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5791-2_1
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-5793-6
Online ISBN: 978-1-4612-5791-2
eBook Packages: Springer Book Archive