Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T21:23:41.117Z Has data issue: false hasContentIssue false
  • English
  • Français

A stochastic lower bound for assemble-transfer batch service queueing networks

Part of: Special processes Markov processes

Published online by Cambridge University Press:  14 July 2016

Antonis Economou
Antonis Economou*
Affiliation:
University of Athens
*
∗ Postal address: 26 Papadiamandopoulou st., Athens 11528, Greece. Email address: aeconom@internet.gr
Get access Rights & Permissions [Opens in a new window]

Abstract

Miyazawa and Taylor (1997) introduced a class of assemble-transfer batch service queueing networks which do not have tractable stationary distribution. However by assuming a certain additional arrival process at each node when it is empty, they obtain a geometric product-form stationary distribution which is a stochastic upper bound for the stationary distribution of the original network. In this paper we develop a stochastic lower bound for the original network by introducing an additional departure process at each node which tends to remove all the customers present in it. This model in combination with the aforementioned upper bound model gives a better sense for the properties of the original network.

Keywords

Queueing networkbatch arrivalbatch serviceassemble-transferconcurrent movementproduct-formpartial balancegeometric distributionstochastic order

MSC classification

Primary: 60K25: Queueing theory 60J27: Continuous-time Markov processes on discrete state spaces

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 37 , Issue 3 , September 2000 , pp. 881 - 889
Copyright
Copyright © Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Boucherie, R., and van Dijk, N. M. (1991). Product forms for queueing networks with state-dependent multiple job transitions. Adv. Appl. Prob. 23, 152–187.CrossRefGoogle Scholar
Chao, X. (1997). Partial balances in batch arrival batch service and assemble-transfer queueing networks. J. Appl. Prob. 34, 745–752.CrossRefGoogle Scholar
Chao, X., Pinedo, M., and Shaw, D. (1996). Networks of queues with batch services and customer coalescence. J. Appl. Prob. 33, 858–869.CrossRefGoogle Scholar
Economou, A. (1999). Geometric-form bounds for the GIX/M/1 queueing system. Prob. Eng. Inf. Sci. 13, 509–520.Google Scholar
Gelenbe, E. (1991). Product form networks with negative and positive customers. J. Appl. Prob. 28, 656–663.Google Scholar
Gelenbe, E. (1993a). G-networks with signals and batch removal. Prob. Eng. Inf. Sci. 7, 335–342.Google Scholar
Gelenbe, E. (1993b). G-networks with triggered customer movement. J. Appl. Prob. 30, 742–748.Google Scholar
Henderson, W. (1993). Queueing networks with negative customers and negative queueing lengths. J. Appl. Prob. 30, 931–942.Google Scholar
Henderson, W., and Taylor, P. G. (1990). Product form in network of queues with batch arrival and batch services. Queueing Systems 6, 71–88.Google Scholar
Henderson, W., Pearce, C. E. M., Taylor, P. G., and van Dijk, N. M. (1990). Closed queueing networks with batch services. Queueing Systems 6, 59–70.Google Scholar
Henderson, W., Northcote, B. S., and Taylor, P. G. (1994). State-dependent signaling in queueing networks. Adv. Appl. Prob. 26, 436–455.Google Scholar
Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley, New York.Google Scholar
Massey, W. A. (1987). Stochastic orderings for Markov processes on partially ordered spaces. Math. Operat. Res. 12, 350–367.Google Scholar
Miyazawa, M., and Taylor, P. G. (1997). A geometric product-form distribution for a queueing network with non-standard batch arrivals and batch transfers. Adv. Appl. Prob. 29, 523–544.CrossRefGoogle Scholar
Serfozo, R. F. (1993). Queueing networks with dependent nodes and concurrent movements. Queueing Systems 13, 143–182.Google Scholar
Van Dijk, N. M. (1993). Queueing Networks and Product Forms: A Systems Approach. John Wiley, Chichester.Google Scholar
Whittle, P. (1986). Systems in Stochastic Equilibrium. John Wiley, New York.Google Scholar
Yamashita, H., and Miyazawa, M. (1998). Geometric product form queueing networks with concurrent batch movements. Adv. Appl. Prob. 30, 1111–1129.Google Scholar