Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-06T01:21:20.141Z 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
Get access Rights & Permissions [Opens in a new window]

Abstract

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

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.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