Hostname: page-component-54dcc4c588-br6xx Total loading time: 0 Render date: 2025-09-15T23:24:34.523Z Has data issue: false hasContentIssue false
  • English
  • Français

Connecting internally balanced quasi-reversible Markov processes

Part of: Special processes Markov processes Operations research and management science

Published online by Cambridge University Press:  01 July 2016

W. Henderson ,
C. E. M. Pearce ,
P. K. Pollett  and
P. G. Taylor
W. Henderson*
Affiliation:
University of Adelaide
C. E. M. Pearce*
Affiliation:
University of Adelaide
P. K. Pollett*
Affiliation:
University of Queensland
P. G. Taylor*
Affiliation:
University of Adelaide
*
∗Postal address: Department of Applied Mathematics, The University of Adelaide, GPO Box 498, Adelaide, SA 5001, Australia.
∗Postal address: Department of Applied Mathematics, The University of Adelaide, GPO Box 498, Adelaide, SA 5001, Australia.
∗∗Postal address: Department of Mathematics, The University of Queensland, QLD 4072, Australia.
∗Postal address: Department of Applied Mathematics, The University of Adelaide, GPO Box 498, Adelaide, SA 5001, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

We provide a general framework for interconnecting a collection of quasi-reversible nodes in such a way that the resulting process exhibits a product-form invariant measure. The individual nodes can be quite general, although some degree of internal balance will be assumed. Any of the nodes may possess a feedback mechanism. Indeed, we pay particular attention to a class of feedback queues, characterized by the fact that their state description allows one to maintain a record of the order in which events occur. We also examine in some detail the problem of determining for which values of the arrival rates a node does exhibit quasi-reversibility.

Keywords

NETWORKSCACHE MANAGEMENTLIBRARY MODELS

MSC classification

Primary: 60J27: Continuous-time Markov processes on discrete state spaces
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) 90B22: Queues and service

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 24 , Issue 4 , December 1992 , pp. 934 - 959
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research supported by the Australian Research Council.

References

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.CrossRefGoogle Scholar
Harrison, J. M. and Williams, R. J. (1990a) On the quasi-reversibility of a multiclass brownian service station. Ann. Prob. 18, 1249–1268.CrossRefGoogle Scholar
Harrison, J. M. and Williams, R. J. (1990b) Brownian models of feedforward queueing networks: quasi-reversibility and product form solutions. Preprint.Google Scholar
Kelly, F. P. (1975) Networks of queues with customers of different types. J. Appl. Prob. 12, 542–554.CrossRefGoogle Scholar
Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.Google Scholar
Kelly, F. P. (1979) Reversibility and Stochastic networks. Wiley, New York.Google Scholar
Kelly, F. P. (1981) Networks of quasi-reversible nodes. Applied Probability—Computer Science, The Interface. Birkhäuser-Boston, Cambridge, MA.Google Scholar
Kelly, F. P. (1983) Invariant measures and the q-matrix. In Probability, Statistics and Analysis , ed. Kingman, J. F. C. and Reuter, G. E. H., pp. 143–160. London Mathematical Society Lecture Notes Series 79, Cambridge University Press.Google Scholar
Kingman, J. F. C. (1969) Markov population processes. J. Appl. Prob. 6, 1–18.Google Scholar
Miller, R. G. Jr. (1963) Stationary equations in continuous time Markov chains. Trans. Amer. Math. Soc. 109, 35–44.Google Scholar
Ott, T. J. (1989) On a cache management problem which can be modelled by a network of queues with ordered customers. Preprint, Bell Communications Research, Morristown, NJ 07960.Google Scholar
Pollett, P. K. (1985) Altering the q-matrix: the problem of varied arrival rates. Proc. 7th Nat. Conf. Austral. Soc. Operat. Res. , ed. Cousins, E. A. and Pearce, C. E. M., pp. 206–234.Google Scholar
Pollett, P. K. (1986) Connecting reversible Markov processes. Adv. Appl. Prob. 18, 880–900.CrossRefGoogle Scholar
Pollett, P. K. (1987) Preserving partial balance in continuous-time Markov chains. Adv. Appl. Prob. 18, 431–453.Google Scholar
Walrand, J. and Varaiya, P. (1980) Interconnections of Markov chains and quasi-reversible queueing networks. Stoch. Proc. Appl. 10, 209–219.CrossRefGoogle Scholar
Whittle, P. (1965) Statistical processes of aggregation and polymerization. Proc. Camb. Phil. Soc. 61, 475–495.CrossRefGoogle Scholar
Whittle, P. (1984) Weak coupling in stochastic systems. Proc. R. Soc. A 395, 141–151.Google Scholar
Whittle, P. (1985) Scheduling and characterization problems for stochastic networks. J. R. Statist. Soc. B 47, 407–415.Google Scholar
Whittle, P. (1986a) Partial balance, insensitivity and weak coupling. Adv. Appl. Prob. 18, 706–723.Google Scholar
Whittle, P. (1986b) Systems in Stochastic Equilibrium. Wiley, New York.Google Scholar