Hostname: page-component-6bf8c574d5-9nwgx Total loading time: 0 Render date: 2025-02-22T23:02:23.943Z Has data issue: false hasContentIssue false
  • English
  • Français

Analytical and numerical methods for many server queues

Published online by Cambridge University Press:  01 July 2016

J. H. A. De Smit
J. H. A. De Smit*
Affiliation:
Twente University of Technology
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
I. Invited Review and Research Papers
Information
Advances in Applied Probability , Volume 9 , Issue 2 , June 1977 , pp. 192 - 193
Copyright
Copyright © Applied Probability Trust 1977 

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] De Smit, J. H. A. (1973) Some general results for many server queues. Adv. Appl. Prob. 5, 153–169.Google Scholar
[2] De Smit, J. H. A. (1972) The asymptotic behaviour of the queue length process in the system M/M/s. CORE Discussion Paper 7217.Google Scholar
[3] De Smit, J. H. A. (1973) The many server queues in discrete time. CORE Discussion Paper 7318.Google Scholar
[4] Oran Brigham, E. (1974) The Fast Fourier Transform. Prentice Hall, Englewood Cliffs, N.J. Google Scholar
[5] Pollaczek, F. (1961) Théorie Analytique des Problèmes Stochastiques Relatifs à un Groupe de Lignes Téléphoniques avec Dispositif d'Attente. Gauthier–Villars, Paris.Google Scholar