Hostname: page-component-669899f699-b58lm Total loading time: 0 Render date: 2025-04-26T08:09:17.985Z Has data issue: false hasContentIssue false
  • English
  • Français

Queueing networks—insensitivity and a heuristic approximation

Published online by Cambridge University Press:  01 July 2016

Dietrich Stoyan
Dietrich Stoyan*
Affiliation:
Bergakademie Freiberg
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
II. Contributed Papers
Information
Advances in Applied Probability , Volume 10 , Issue 2 , June 1978 , pp. 318
Copyright
Copyright © Applied Probability Trust 1978 

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

[1] Baskett, F., Chandy, K. M., Muntz, R. P. and 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] König, D., Matthes, K. and Nawrotzki, K. (1967) Verallgemeinerungen der Erlangschen und Engsetschen Formeln. Akademie-Verlag, Berlin.Google Scholar
[3] König, D. and Stoyan, D. (1976) Methoden der Bedienungstheorie. Akademie-Verlag, Berlin.Google Scholar
[4] Stoyan, D. (1976) Approximations for M/G/s queues. Math. Operationsforsch. Statist. 7, 587–594.Google Scholar
[5] Stoyan, D. (1978) Queueing networks—insensitivity and a heuristic approximation. Elektron. Informationsverarbeit. Kybernetik. 14(3).Google Scholar