This study introduces a Markov network process called a string-net. Its state is the vector of quantities of customers or units that move among the nodes, and a transition of the network consists of a string of instantaneous vector increments in the state. The rate of such a string transition is a product of a transition-initiation rate and a string-generation rate. The main result characterizes the stationary distribution of a string-net. Key parameters in this distribution satisfy certain "polynomial traffic equations" involving the string-generation rates. We identify sufficient conditions for the existence of a solution of the polynomial equations, and we relate these equations to a partial balance property and throughputs of the network. Other results describe the stationary behavior of a large class of string-nets in which the vectors in the strings are unit vectors and a string-generation rate is a product of Markov routing probabilities. This class includes recently studied open networks with Jackson-type transitions augmented by transitions in which a signal (or negative customer) deletes units at nodes in one or two stages. The family of string-nets contains essentially all Markov queueing network processes, aside from reversible networks, that have known formulas for their stationary distributions. We discuss old and new variations of Jackson networks with batch services, concurrent or multiple-unit movements of units, state-dependent routings and multiple types of units and routes.
Ann. Appl. Probab.
8(3):
793-821
(August 1998).
DOI: 10.1214/aoap/1028903451
[1] Boucherie, R. and van Dijk, N. (1990). Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes. Adv. in Appl. Probab. 22 433-455. MR91f:60123 0699.60083 10.2307/1427544[1] Boucherie, R. and van Dijk, N. (1990). Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes. Adv. in Appl. Probab. 22 433-455. MR91f:60123 0699.60083 10.2307/1427544
[2] Boucherie, R. and van Dijk, N. (1990). Product forms for queueing networks with state dependent multiple job transitions. Adv. in Appl. Probab. 23 152-187. MR1091097 0722.60092 10.2307/1427516[2] Boucherie, R. and van Dijk, N. (1990). Product forms for queueing networks with state dependent multiple job transitions. Adv. in Appl. Probab. 23 152-187. MR1091097 0722.60092 10.2307/1427516
[3] Boucherie, R. and van Dijk, N. (1991). Local balances in queueing networks with positive and negative customers. Ann. Oper. Res. 48 463-492. MR1264695 0792.90029 10.1007/BF02033315[3] Boucherie, R. and van Dijk, N. (1991). Local balances in queueing networks with positive and negative customers. Ann. Oper. Res. 48 463-492. MR1264695 0792.90029 10.1007/BF02033315
[4] Chao, X. (1995). Networks of queues with customers, signals and arbitrary service time distributions. Oper. Res. 43 537-544. MR1337466 0841.90065 10.1287/opre.43.3.537 0030-364X%28199505%2F06%2943%3A3%3C537%3ANOQWCS%3E2.0.CO%3B2-Z[4] Chao, X. (1995). Networks of queues with customers, signals and arbitrary service time distributions. Oper. Res. 43 537-544. MR1337466 0841.90065 10.1287/opre.43.3.537 0030-364X%28199505%2F06%2943%3A3%3C537%3ANOQWCS%3E2.0.CO%3B2-Z
[5] Chao, X. (1995). A queueing network model with catastrophes and product form solution. Oper. Res. Lett. 18 75-79. MR1361864 0857.90042 10.1016/0167-6377(95)00029-0[5] Chao, X. (1995). A queueing network model with catastrophes and product form solution. Oper. Res. Lett. 18 75-79. MR1361864 0857.90042 10.1016/0167-6377(95)00029-0
[6] Chao, X. and Miy azawa, M. (1995). A probabilistic decomposition approach to quasireversibility and its applications in coupling of queues. Technical report, New Jersey Institute of Technology and Science Univ. Toky o. [6] Chao, X. and Miy azawa, M. (1995). A probabilistic decomposition approach to quasireversibility and its applications in coupling of queues. Technical report, New Jersey Institute of Technology and Science Univ. Toky o.
[7] Chao, X. and Miy azawa, M. (1996). Queueing networks with instantaneous movements: a couping approach by quasi-reversibility. Technical report, New Jersey Institute of Technology and Science Univ. Toky o. [7] Chao, X. and Miy azawa, M. (1996). Queueing networks with instantaneous movements: a couping approach by quasi-reversibility. Technical report, New Jersey Institute of Technology and Science Univ. Toky o.
[9] Chao, X. and Pinedo, M. (1995). Networks of queues with batch services, signals and product form solutions. Oper. Res. Lett. 17 237-242. MR96h:90047 0858.90056 10.1016/0167-6377(95)00026-G[9] Chao, X. and Pinedo, M. (1995). Networks of queues with batch services, signals and product form solutions. Oper. Res. Lett. 17 237-242. MR96h:90047 0858.90056 10.1016/0167-6377(95)00026-G
[10] Chao, X., Pinedo, M. and Shaw, D. (1996). An assembly network of queues with product form solution. J. Appl. Probab. To appear. MR1401480 0859.60086 10.2307/3215364[10] Chao, X., Pinedo, M. and Shaw, D. (1996). An assembly network of queues with product form solution. J. Appl. Probab. To appear. MR1401480 0859.60086 10.2307/3215364
[11] Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Probab. 28 656-663. MR92k:60210 0741.60091 10.2307/3214499[11] Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Probab. 28 656-663. MR92k:60210 0741.60091 10.2307/3214499
[13] Gelenbe, E. (1993a). G-Networks with triggered customer movements. J. Appl. Probab. 30 931-942. MR1232750 0781.60088 10.2307/3214781[13] Gelenbe, E. (1993a). G-Networks with triggered customer movements. J. Appl. Probab. 30 931-942. MR1232750 0781.60088 10.2307/3214781
[15] Gelenbe, E., Gly nn, P. and Sigman, K. (1991). Queues with negative arrivals. J. Appl. Probab. 28 245-250. MR92k:60209 0744.60110 10.2307/3214756[15] Gelenbe, E., Gly nn, P. and Sigman, K. (1991). Queues with negative arrivals. J. Appl. Probab. 28 245-250. MR92k:60209 0744.60110 10.2307/3214756
[18] Henderson, W. (1993). Queueing networks with negative customers and negative queueing lengths. J. Appl. Probab. 30 931-942. MR94m:60187 0787.60115 10.2307/3214523[18] Henderson, W. (1993). Queueing networks with negative customers and negative queueing lengths. J. Appl. Probab. 30 931-942. MR94m:60187 0787.60115 10.2307/3214523
[19] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1994). State-dependent signaling in queueing networks. Adv. in Appl. Probab. 24 934-959. MR1272721 0804.60082 10.2307/1427445[19] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1994). State-dependent signaling in queueing networks. Adv. in Appl. Probab. 24 934-959. MR1272721 0804.60082 10.2307/1427445
[20] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1994). Geometric equilibrium distributions for queues with interactive batch departures. Ann. Oper. Res. 48 463-492. MR1264696 0818.90051 10.1007/BF02033316[20] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1994). Geometric equilibrium distributions for queues with interactive batch departures. Ann. Oper. Res. 48 463-492. MR1264696 0818.90051 10.1007/BF02033316
[21] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1995). Triggered batch movements in queueing networks. Queueing Sy stems Theory Appl. 21 125-141. MR97b:60160 10.1007/BF01158577[21] Henderson, W., Northcote, B. S. and Tay lor, P. G. (1995). Triggered batch movements in queueing networks. Queueing Sy stems Theory Appl. 21 125-141. MR97b:60160 10.1007/BF01158577
[22] Henderson, W., Pearce, C. E. M., Tay lor, P. G. and van Dijk, N. M. (1990). Closed queueing networks with batch services. Queueing Sy stems Theory Appl. 6 59-70. MR91h:60102 10.1007/BF02411465[22] Henderson, W., Pearce, C. E. M., Tay lor, P. G. and van Dijk, N. M. (1990). Closed queueing networks with batch services. Queueing Sy stems Theory Appl. 6 59-70. MR91h:60102 10.1007/BF02411465
[23] Henderson, W. and Tay lor, P. G. (1990). Product form in networks of queues with batch arrivals and batch services. Queueing Sy stems Theory Appl. 6 71-78. MR91h:60103 10.1007/BF02411466[23] Henderson, W. and Tay lor, P. G. (1990). Product form in networks of queues with batch arrivals and batch services. Queueing Sy stems Theory Appl. 6 71-78. MR91h:60103 10.1007/BF02411466
[24] Jackson, J. R. (1957). Networks of waiting lines. Oper. Res. 5 518-552. MR93061 10.1287/opre.5.4.518 0030-364X%28195708%295%3A4%3C518%3ANOWL%3E2.0.CO%3B2-B[24] Jackson, J. R. (1957). Networks of waiting lines. Oper. Res. 5 518-552. MR93061 10.1287/opre.5.4.518 0030-364X%28195708%295%3A4%3C518%3ANOWL%3E2.0.CO%3B2-B
[25] Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, London. MR554920 0422.60001[25] Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, London. MR554920 0422.60001
[26] Miy azawa, M. and Tay lor, P. G. (1997). A geometric product-form distribution for a queueing network with nonstandard batch arrivals and batch transfers. Adv. in Appl. Probab. To appear. MR98j:60132 0890.60086 10.2307/1428015[26] Miy azawa, M. and Tay lor, P. G. (1997). A geometric product-form distribution for a queueing network with nonstandard batch arrivals and batch transfers. Adv. in Appl. Probab. To appear. MR98j:60132 0890.60086 10.2307/1428015
[27] Serfozo, R. F. (1989). Markovian network processes: congestion-dependent routing and processing. Queueing Sy stems Theory Appl. 5 5-36. MR91g:60114 10.1007/BF01149184[27] Serfozo, R. F. (1989). Markovian network processes: congestion-dependent routing and processing. Queueing Sy stems Theory Appl. 5 5-36. MR91g:60114 10.1007/BF01149184
[28] Serfozo, R. F. (1991). Reversibility and compound birth-death and migration processes. Queueing Processes and Related Models. Oxford Univ. Press. MR1210560 0783.60082[28] Serfozo, R. F. (1991). Reversibility and compound birth-death and migration processes. Queueing Processes and Related Models. Oxford Univ. Press. MR1210560 0783.60082
[29] Serfozo, R. F. (1993). Queueing networks with dependent nodes and concurrent movements. Queueing Sy stems Theory Appl. 13 143-182. MR94m:60193 10.1007/BF01158932[29] Serfozo, R. F. (1993). Queueing networks with dependent nodes and concurrent movements. Queueing Sy stems Theory Appl. 13 143-182. MR94m:60193 10.1007/BF01158932
[30] Serfozo, R. F. (1994). Little laws for utility processes and waiting times in queues. Queueing Sy stems Theory Appl. 17 137-81. MR95k:60243 10.1007/BF01158693[30] Serfozo, R. F. (1994). Little laws for utility processes and waiting times in queues. Queueing Sy stems Theory Appl. 17 137-81. MR95k:60243 10.1007/BF01158693
[32] Whittle, P. (1986). Sy stems in Stochastic Equilibrium. Wiley, New York. MR88c:60162 0665.60107[32] Whittle, P. (1986). Sy stems in Stochastic Equilibrium. Wiley, New York. MR88c:60162 0665.60107