Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T00:05:54.103Z Has data issue: false hasContentIssue false
  • English
  • Français

NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES

Published online by Cambridge University Press:  25 September 2008

Henk Tijms
Henk Tijms
Affiliation:
Department of Econometrics and Operations Research, VRIJE University, 1081 HV Amsterdam E-mail: tijms@feweb.vu.nl
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.

This article shows that very accurate accurate approximations to performance measures in the multiserver M/D/c/c+N queue with finite buffer and deterministic service times can be obtained by replacing the deterministic service time by a two-phase process with exponential sojourn times and branching probabilities outside the interval [0, 1].

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 22 , Issue 4 , October 2008 , pp. 653 - 658
Copyright
Copyright © Cambridge University Press 2008

References

1.Nojo, S. & Watanabe, H. (1987). A new stage method getting arbitrary coefficient of variation through two stages. Transections of the IECIE 70: 33–36.Google Scholar
2.Tijms, H.C. (2003). A first course in stochastic models. Chichester: Wiley.CrossRefGoogle Scholar
3.Tijms, H.C. & Staats, K. (2007). Negative probabilities at work in the M/D/1 queue. Probability in the Engineering and Informational Sciences 21: 69–76.CrossRefGoogle Scholar
4.Van Hoorn, M.H. & Seelen, L.P. (1986). Approximations for the G/G/c queue. Journal of Applied Probability 23: 484–494.CrossRefGoogle Scholar