Note on approximations for the multi-server queue with finite buffer and deterministic service times

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]. © 2008 Cambridge University Press