Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-18T08:54:09.368Z Has data issue: false hasContentIssue false
  • English
  • Français

Stochastic Monotonicities in Jackson Queueing Networks

Published online by Cambridge University Press:  27 July 2009

Torgny Lindvall
Torgny Lindvall
Affiliation:
Department of Mathematics, University of Göteborg, 41296 Göteborg, Sweden
Get access Rights & Permissions [Opens in a new window]

Abstract

When starting from 0, a standard M/M/k queueing process has a second-order stochastic monotonicity property of a strong kind: its increments are stochastically decreasing (the SDI property). A first attempt to generalize this to the Jackson queueing network fails. This gives us reason to reexamine the underlying theory for stochastic monotonicity of Markov processes starting from a zero-point, in order to find a condition on a function of a Jackson network process to have the SDI property. It turns out that the total number of customers at time t has the desired property, if the network is idle at time O. We use couplings in our analysis; they are also of value in the comparison of two networks with different parameters.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 11 , Issue 1 , January 1997 , pp. 1 - 9
Copyright
Copyright © Cambridge University Press 1997

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.)

References

1.Asmussen, S. (1993). A tutorial on queuing networks. In Barndorff-Nielsen, O.E., Jensen, J.L., & Kendall, W.S. (eds.), Networks and Chaos — Statistical and Probabilistic Aspects. London: Chapman and Hall, pp. 251–275.CrossRefGoogle Scholar
2.Ethier, S.N. & Kurtz, T. (1986). Markov Processes. New York: Wiley.CrossRefGoogle Scholar
3.Lindvall, T. (1992). Lectures on the Coupling Method. New York: Wiley.Google Scholar
4.Mosler, K. & Scarsini, M. (eds.). (1991). Stochastic Orders and Decision under Risk, Vol. 19. IMS Lecture Notes. Hayward, CA: Institute of Mathematical Statistics.CrossRefGoogle Scholar
5.Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. Chichester: Wiley.Google Scholar