The Annals of Applied Probability

Markov network processes with string transitions

Richard F. Serfozo and Bingyi Yang

Full-text: Open access

Abstract

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.

Article information

Source
Ann. Appl. Probab., Volume 8, Number 3 (1998), 793-821.

Dates
First available in Project Euclid: 9 August 2002

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1028903451

Digital Object Identifier
doi:10.1214/aoap/1028903451

Mathematical Reviews number (MathSciNet)
MR1627787

Zentralblatt MATH identifier
0948.60085

Subjects
Primary: 60F05: Central limit and other weak theorems
Secondary: 60K25: Queueing theory [See also 68M20, 90B22]

Keywords
Markov processes queueing processes stochastic networks stationary distributions batch arrivals and services

Citation

Serfozo, Richard F.; Yang, Bingyi. Markov network processes with string transitions. Ann. Appl. Probab. 8 (1998), no. 3, 793--821. doi:10.1214/aoap/1028903451. https://projecteuclid.org/euclid.aoap/1028903451


Export citation

References

  • [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.
  • [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.
  • [3] Boucherie, R. and van Dijk, N. (1991). Local balances in queueing networks with positive and negative customers. Ann. Oper. Res. 48 463-492.
  • [4] Chao, X. (1995). Networks of queues with customers, signals and arbitrary service time distributions. Oper. Res. 43 537-544.
  • [5] Chao, X. (1995). A queueing network model with catastrophes and product form solution. Oper. Res. Lett. 18 75-79.
  • [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.
  • [8] Chao, X. and Pinedo, M. (1993). On generalized networks of queues with positive and negative arrivals. Probab. Engrg. Inform. Sci. 7 301-334.
  • [9] Chao, X. and Pinedo, M. (1995). Networks of queues with batch services, signals and product form solutions. Oper. Res. Lett. 17 237-242.
  • [10] Chao, X., Pinedo, M. and Shaw, D. (1996). An assembly network of queues with product form solution. J. Appl. Probab. To appear.
  • [11] Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Probab. 28 656-663.
  • [12] Gelenbe, E. (1992). Stability of product form G-networks. Probab. Engrg. Inform. Sci. 6 271-276.
  • [13] Gelenbe, E. (1993a). G-Networks with triggered customer movements. J. Appl. Probab. 30 931-942.
  • [14] Gelenbe, E. (1993b). G-Networks with signals and batch removals. Probab. Engrg. Inform. Sci. 7 335-342.
  • [15] Gelenbe, E., Gly nn, P. and Sigman, K. (1991). Queues with negative arrivals. J. Appl. Probab. 28 245-250.
  • [16] Gelenbe, E. and Schassberger, R. (1992). Stability of G-Networks. Probab. Engrg. Inform. Sci. 6 3271-3276.
  • [17] Gordon, W. J. and Newell, G. F. (1967). Cy clic queueing sy stems with restricted queue lengths. Oper. Res. 15 266-278.
  • [18] Henderson, W. (1993). Queueing networks with negative customers and negative queueing lengths. J. Appl. Probab. 30 931-942.
  • [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.
  • [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.
  • [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.
  • [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.
  • [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.
  • [24] Jackson, J. R. (1957). Networks of waiting lines. Oper. Res. 5 518-552.
  • [25] Kelly, F. P. (1979). Reversibility and Stochastic Networks. Wiley, London.
  • [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.
  • [27] Serfozo, R. F. (1989). Markovian network processes: congestion-dependent routing and processing. Queueing Sy stems Theory Appl. 5 5-36.
  • [28] Serfozo, R. F. (1991). Reversibility and compound birth-death and migration processes. Queueing Processes and Related Models. Oxford Univ. Press.
  • [29] Serfozo, R. F. (1993). Queueing networks with dependent nodes and concurrent movements. Queueing Sy stems Theory Appl. 13 143-182.
  • [30] Serfozo, R. F. (1994). Little laws for utility processes and waiting times in queues. Queueing Sy stems Theory Appl. 17 137-81.
  • [31] Walrand, J. (1988). Introduction to Queueing Networks. Prentice-Hall, Englewood Cliffs, NJ.
  • [32] Whittle, P. (1986). Sy stems in Stochastic Equilibrium. Wiley, New York.