Abstract
This paper supplements and generalizes the results of Ōsawa [11] in this special issue from the viewpoint of discrete-time networks of queues with batch arrivals and batch departures, due to Henderson and Taylor [7]. We first note that the D-rule of Ōsawa [11] is equivalent to the specific form for the release rate function, introduced in [7]. Such forms have widely appeared in the literature, too. Ōsawa [11] found that the D-rule can be characterized in terms of the reversed-time process of a certain vector-valued process. He obtained this characterization for a single node model. We generalize this result for networks of queues with batch arrivals and batch departures. This reveals why the specific form of the release rate function is common in the literature. Furthermore, the characterization is useful to consider traffic flows in a discrete-time queueing network.
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, Adv. Appl. Prob. 23 (1991) 152–187.
R.J. Boucherie and N.M. van Dijk, A generalization of Norton's theorem for queueing networks, Queueing Syst. 13 (1993) 251–289.
X. Chao, Networks of queues with customers, signals and arbitrary service time distributions, Oper. Res. (1993), to appear.
X. Chao and M. Pinedo, On generalized networks of queues with positive and negative arrivals, Prob. Eng. Inf. Sci. 7 (1993) 301–334.
E. Gelenbe, G-networks with signals and batch removal, Prob. Eng. Inf. Sci. 7 (1993) 335–342.
E. Gelenbe, G-networks with triggered customer movement, J. Appl. Prob. 30 (1993) 742–748.
W. Henderson and P.G. Taylor, Product form in networks of queues with batch arrivals and batch services, Queueing Syst. 6 (1990) 71–88.
W. Henderson and P.G. Taylor, Some new results of queueing networks with batch movement, J. Appl. Prob. 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 Syst. 6 (1990) 59–70.
F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).
H. Ōsawa, Reversibility of a Markov chain and its applications to discrete-time queues, Queueing Syst. 18 (1994), this issue.
R.F. Serfozo, Markovian network processes: Congestion-dependent routing and processing, Queueing Syst. 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 Syst. 13 (1993) 143–182.
J. Walrand, A discrete-time queueing network. J. Appl. Prob. 20 (1983) 903–909.
J. Walrand,An Introduction to Queueing Networks (Prentice-Hall, 1988).
Author information
Authors and Affiliations
Additional information
This research is partially supported by NEC C&C Laboratories.
Rights and permissions
About this article
Cite this article
Miyazawa, M. On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications. Queueing Syst 18, 149–166 (1994). https://doi.org/10.1007/BF01158779
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158779