Skip to main content Accessibility help
×
×
Home

On the stochastic domination for batch-arrival, batch-service and assemble-transfer queueing networks

  • Antonis Economou (a1)

Abstract

Stochastic monotonicity properties for various classes of queueing networks have been established in the literature mainly with the use of coupling constructions. Miyazawa and Taylor (1997) introduced a class of batch-arrival, batch-service and assemble-transfer queueing networks which can be thought of as generalized Jackson networks with batch movements. We study conditions for stochastic domination within this class of networks. The proofs are based on a certain characterization of the stochastic order for continuous-time Markov chains, written in terms of their associated intensity matrices.

Copyright

Corresponding author

Postal address: Department of Mathematics, University of Athens, Panepistemiopolis, Athens 15784, Greece. Email address: aeconom@math.uoa.gr

References

Hide All
Chao, X. (1997). Partial balances in batch arrival batch service and assemble-transfer queueing networks. J. Appl. Prob. 34, 745752.
Chao, X., and Serfozo, R. (1998). Queueing networks with instantaneous sequential batch arrivals and sequential batch departures. Preprint.
Economou, A. (2000). A stochastic lower bound for assemble-transfer batch service queueing networks. J. Appl. Prob. 37, 881889.
Economou, A. (2002). An alternative model for queueing systems with single arrivals, batch services and customer coalescence. Queueing Systems 40, 407432.
Economou, A. (2003). Necessary and sufficient conditions for the stochastic comparison of Jackson networks. Prob. Eng. Inf. Sci. 17, 143151.
Lindvall, T. (1992). Lectures on the Coupling Method. John Wiley, New York.
López, F. J., Martínez, S., and Sanz, G. (2000). Stochastic domination and Markovian couplings. Adv. Appl. Prob. 32, 10641076.
Massey, W. A. (1987). Stochastic orderings for Markov processes on partially ordered spaces. Math. Operat. Res. 12, 350367.
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, 523544.
Shaked, M., and Shanthikumar, J. G. (1994). Stochastic Orders and Their Applications. Academic Press, San Diego, CA.
Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. John Wiley, Berlin.
Szekli, R. (1995). Stochastic Ordering and Dependence in Applied Probability (Lecture Notes Statist. 97). Springer, New York.
Yamashita, H., and Miyazawa, M. (1998). Geometric product form queueing networks with concurrent batch movements. Adv. Appl. Prob. 30, 11111129.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed