Abstract
We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages of this kind of queueing networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.J. Boucherie and N.M. van Dijk, Product forms for queueing networks with state-dependent multiple job transitions, Advances in Applied Probability 23 (1991) 152–187.
R.J. Boucherie and N.M. van Dijk, A generalization of Norton's theorem for queueing networks, Queueing Systems 13 (1993) 251–289.
X. Chao and M. Miyazawa, A probabilistic decomposition approach to quasi-reversibility and its applications in coupling of queues, preprint (1996).
X. Chao and M. Miyazawa, Queueing networks with instantaneous movements: A coupling approach by quasi-reversibility, preprint (1996).
X. Chao and M. Miyazawa, On quasi-reversibility and local balance: An alternative derivation of the product-form results, preprint (1996).
X. Chao and M. Pinedo, On generalized networks of queues with positive and negative arrivals, Probability in the Engineering and Informational Sciences 7 (1993) 301–334.
E. Çinlar, Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).
J.W. Cohen and O.J. Boxma, Boundary Value Problems in Queueing System Analysis (North-Holland, Amsterdam, 1983).
E. Gelenbe, G-networks with signals and batch removal, Probability in the Engineering and Informational Sciences 7 (1993) 335–342.
D. Gross and C.M. Harris, Fundamentals of Queueing Theory (Wiley, New York, second edition, 1985).
W. Henderson and P.G. Taylor, Product form in networks of queues with batch arrivals and batch services, Queueing Systems 6 (1990) 71–88.
W. Henderson and P.G. Taylor, Some new results of queueing networks with batch movement, Journal of Applied Probability 28 (1991) 409–421.
W. Henderson, C.E.M. Pearce, P.G. Taylor and N.M. van Dijk, Closed queueing networks with batch services, Queueing Systems 6 (1990) 59–70.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
I. Kino, Queueing networks and their applications, in: The Proceedings of Symposium on Performance Models for Information Communication Networks (1995) pp. 361–372 (in Japanese).
Y. Kobayashi, Analysis of discrete-time queueing networks with state-dependent routing, Master's thesis, Science University of Tokyo (1995) (in Japanese).
M. Miyazawa, Insensitivity and product-form decomposability of reallocatable GSMP, Advances in Applied Probability 25 (1993) 415–437.
M. Miyazawa, On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications, Queueing Systems 18 (1994) 149–166.
M. Miyazawa, A note on my paper: On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications, Queueing Systems 19 (1995) 445–448.
M. Miyazawa and P.G. Taylor, A geometric product-form distribution for a queueing network with nonstandard batch arrivals and batch transfers, to appear in Advances in Applied Probability (1997).
M. Miyazawa and R.W. Wolff, Symmetric queues with batch departures and their networks, Advances in Applied Probability 28 (1996) 308–326.
H. Ōsawa, Quasi-reversibility of a discrete-time queue and related models, Queueing Systems 18 (1994) 133–148.
R.F. Serfozo, Markovian network processes: Congestion-dependent routing and processing, Queueing Systems 5 (1989) 5–36.
R.F. Serfozo, Reversibility and compound birth-death and migration processes, in: Queueing and Related Models (Oxford Univ. Press, 1992) pp. 65–90.
R.F. Serfozo, Queueing networks with dependent nodes and concurrent movements, Queueing Systems 13 (1993) 143–182.
R.F. Serfozo and B. Yang, Markov network processes with string transitions, preprint (1996).
A. Shwartz and A. Weiss, Induced rare events: Analysis via large deviations and time reversal, Advances in Applied Probability 25 (1993) 667–689.
J. Walrand, An Introduction to Queueing Networks (Prentice-Hall, Englewood Cliffs, NJ, 1988).
P. Whittle, Systems in Stochastic Equilibrium (Wiley, New York, 1988).
Rights and permissions
About this article
Cite this article
Miyazawa, M. Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing. Queueing Systems 25, 45–75 (1997). https://doi.org/10.1023/A:1019192032066
Issue Date:
DOI: https://doi.org/10.1023/A:1019192032066