Abstract
A broad class of network Markov processes (including open queueing networks) with multiaddress routing and one type of calls is considered. Under such routing, the same call can simultaneously arrive at several nodes. For these processes, we found necessary and sufficient conditions of multiplicativity, that is, conditions of representability of a stationary distribution as a product of factors characterizing separate nodes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Chao, X., Miyazawa, M., Serfozo, R.F., and Takada, H., Markov Network Processes with Product Form Stationary Distributions, Queueing Syst., 1998, vol. 28, no. 4, pp. 377–401.
Malinkovsky, Yu.V., Open Queueing Networks with Standard Nodes and One Type of the Customers, Preprint of Scorina Gomel State Univ., Gomel, Belarus, 1996, no. 1.
Malinkovsky, Yu.V., Multiplicativity of a Stationary Distribution of an Open Queueing Network with Standard Nodes and Single-Type Calls, Probl. Peredachi Inf., 1999, vol. 35, no. 1, pp. 75–89 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 1, pp. 63-75].
Chao, X. and Miyazawa, M., A Probabilistic Decomposition Approach to Quasi-Reversibility and Its Applications in Coupling of Queues, Preprint of New Jersey Inst. of Technology and Sci. Univ. of Tokyo, 1996, pp. 1-18.
Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G., Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, J. ACM, 1975, vol. 22, no. 2, pp. 248–260.
Chandy, K.M., Howard, J.H., and Towsley, D.F., Jr., Product Form and Local Balance in Queueing Networks, J. ACM, 1977, vol. 24, no. 2, pp. 250–263.
Henderson, W., Pearce, C.E., Pollett, P.K., and Taylor, P.G., Connecting Internally Balanced Quasi-Reversible Markov Processes, Adv. Appl. Probab., 1992, vol. 24, no. 4, pp. 934–959.
Jackson, J.R., Jobshop-like Queueing Systems, Manag. Sci., 1963, vol. 10, no. 1, pp. 131–142.
Kelly, F.P., Networks of Queues with Customers of Different Types, J. Appl. Probab., 1975, vol. 12, no. 3, pp. 542–554.
Kelly, F.P., Networks of Queues, Adv. Appl. Probab., 1976, vol. 8, no. 2, pp. 416–432.
Kelly, F.P., Networks of Quasi-Reversible Nodes, Applied Probability Computer Science: The Interface, Disney, R.L. and Ott, T.J., Eds., Boston: Birkhäuser, 1982, vol. 1, pp. 3–26.
Pollet, P.K., Preserving Partial Balance in Continuous-Time Markov Chains, Adv. Appl. Probab., 1987, vol. 19, no. 2, pp. 431–453.
Varaiya, P. and Walrand, J., Interconnections of Markov Chains and Quasi-Reversible Queueing Networks, Stoch. Proc. Appl., 1980, vol. 10, pp. 209–219.
Walrand, J., An Inroduction to Queueing Networks, Englewood Cliffs: Prentice Hall, 1988. Translated under the title Vvedenie v teoriyu setei massovogo obsluzhivaniya, Moscow: Mir, 1993.
Whittle, P., Systems in Stochastic Equilibrium, London: Wiley, 1986.
Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.
Pollett, P.K., Connecting Reversible Processes, Adv. Appl. Probab., 1986, vol. 18, pp. 880–900.
Malinkovsky, Yu.V., Criterion of Pointwise Independence of Open StationaryMarkov Queueing Networks with One Type of Customers, Teor. Veroyatn. Primen., 1990, vol. 35, no. 4, pp. 779–784.
Malinkovsky, Yu.V., Criterion of Product-Form Representability of Stationary Distribution of States of Open Markov Queueing Networks with Several Classes of Customers, Avtomat. Telemekh., 1991, no. 4, pp. 75–83.
Rights and permissions
About this article
Cite this article
Tyurikov, M.Y. Multiplicativity of Markov Chains with Multiaddress Routing. Problems of Information Transmission 38, 227–236 (2002). https://doi.org/10.1023/A:1020317303239
Issue Date:
DOI: https://doi.org/10.1023/A:1020317303239