Hostname: page-component-6bb9c88b65-vpjdr Total loading time: 0 Render date: 2025-07-26T07:42:48.311Z Has data issue: false hasContentIssue false
  • English
  • Français

Positive correlations in a three-node Jackson queueing network

Published online by Cambridge University Press:  01 July 2016

Robert D. Foley  and
Peter C. Kiessler
Robert D. Foley*
Affiliation:
Georgia Institute of Technology
Peter C. Kiessler*
Affiliation:
Virginia Commonwealth University
*
∗Postal address: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA.
∗∗Postal address: Department of Mathematical Sciences, Virginia Commonwealth University, Richmond, VA 23284–2014, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show for the three-node Jackson network studied in [3] that a customer’s sojourn times in nodes 1 and 3 are positively correlated. We actually prove a stronger result, that the two sojourn times are associated random variables. Our proof uses a stochastic ordering argument similar to that in [4].

Information

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 21 , Issue 1 , March 1989 , pp. 241 - 242
Copyright
Copyright © Applied Probability Trust 1989 

References

Barlow, R. E. and Proschan, F. (1998) Statistical Theory of Reliability and Life Testing Probability Models. Holt, Rinehart and Winston, Silver Spring, MD.Google Scholar
Kiessler, P. C., Melamed, B., Yadin, M. and Foley, R. D. (1988) Analysis of a three node queueing network, Queueing Syst. Theory Appl. To appear.CrossRefGoogle Scholar
Simon, B. and Foley, R. D. (1979) Some results on sojourn times in acyclic Jackson networks. Management Sci. 25, 1027–1034.CrossRefGoogle Scholar
Whitt, W. (1981) Comparing counting processes and queues. Adv. Appl. Prob. 13, 207–220.CrossRefGoogle Scholar
Whitt, W. (1984) The amount of overtaking in a network of queues. Networks 14, 411–426.CrossRefGoogle Scholar