Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-12-01T06:32:11.402Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on sojourn times in queuing networks with multiserver nodes

Published online by Cambridge University Press:  14 July 2016

Josef Hemker
Josef Hemker*
Affiliation:
Nixdorf Computer AG
*
∗Postal address: Nixdorf Computer AG, Pontanusstrasse 55, D-4790 Paderborn, West Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

Time-reversal arguments can be used to re-derive (and slightly generalize) previous results for sojourn-time distributions in product-form queuing networks.

Keywords

TIME-REVERSALPRODUCT-FORM NETWORKS
Type
Short Communications
Information
Journal of Applied Probability , Volume 27 , Issue 2 , June 1990 , pp. 469 - 474
Copyright
Copyright © Applied Probability Trust 1990 

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] Baskett, F., Chandy, K. M., Muntz, R. R., Palacios, F. G. (1975) Open, closed, and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260.CrossRefGoogle Scholar
[2] Kelly, F. P. (1976) Networks of queues. Adv. Appl. Prob. 8, 416–432.CrossRefGoogle Scholar
[3] Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
[4] Kelly, F. P. and Pollett, P. K. (1983) Sojourn times in closed queuing networks. Adv. Appl. Prob. 15, 638–656.CrossRefGoogle Scholar
[5] Schassberger, R. and Daduna, H. (1987) Sojourn times in queuing networks with multiserver nodes. J. Appl. Prob. 24, 511–521.CrossRefGoogle Scholar
[6] Walrand, J. and Varaiya, P. (1980) Sojourn times and the overtaking condition in Jacksonian networks. Adv. Appl. Prob. 12, 1000–1018.CrossRefGoogle Scholar