Abstract
We introduce a discrete-time Jackson network with batch movements. Not more than one node simultaneously completes service, but arbitrary sizes of batch arrivals, departures and transfers are allowed under a Markovian routing of batches including changes of their sizes. This model corresponds with the continuous-time network work with batch movements studied by Miyazawa and Taylor [11], but needs a care for the discrete-time setting. It is shown that the stationary joint distribution of queue length vector is stochastically bounded by a product of geometric distributions under the stability condition. Its improvements and tightness are discussed. We also provide an algorithm to calculate the decay rates of the geometric distributions, which answers the stability of the network as well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boucherie, R.J. and van Dijk N.M., Product forms for queueing networks with state-dependent multiple job transitions, Adv. Appl. Prob. 23 (1991), 152–187.
Chang, C.S., Stability, queue length and delay of deterministic and stochastic queueing networks, IEEE Trans. Autom. Cont. 39 (1994), 913–931.
Chang, C.S., Sample path large deviations and intree networks, Queueing Systems 20 (1995), 7–36.
Chao, X. and Miyazawa, M., A Probabilistic Decomposition Approach to Quasi-Reversibility and Its Applications in Coupling of Queues, preprint, 1996.
Gelenbe, E. and Schassberger, R., Stability of product form G-network, Probability in the Engineering and Informational Sciences 6 (1992), 271–276.
Henderson, W. and Taylor, P.G., Product form in networks of queues with batch arrivals and batch services, Queueing Systems 6 (1990), 71–88.
Kelly, F.P., Reversibility and Stochastic Networks, John Wiley & Sons, New York, 1979.
Kelly, F.P., Effective bandwidths at multi-class queues Queueing Systems 9 (1991), 5–16.
Kingman, J.F.C. Inequalities in the theory of queues, J. Roy. Statist. Soc. B. 32 (1970), 102–110.
Miyazawa, M., On the characterization of departure rules for discrete-time queueing networks with batch movements and its applications, Queueing Systems 18 (1994), 149–166.
Miyazawa, M. and Taylor, P.G., A geometric product-form distribution for a queueing network with nonstandard batch arrivals and batch transfers, preprint, 1995.
Serfozo, R.F., Queueing networks with dependent nodes and concurrent movements, Queueing Systems 13 (1993), 143–182.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Miyazawa, M. (1996). Stability of Discrete-Time Jackson Networks with Batch Movements. In: Glasserman, P., Sigman, K., Yao, D.D. (eds) Stochastic Networks. Lecture Notes in Statistics, vol 117. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4062-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4062-4_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94828-7
Online ISBN: 978-1-4612-4062-4
eBook Packages: Springer Book Archive