Abstract
This article derives amazingly accurate approximations to the state probabilities and waiting-time probabilities in the M/D/1 queue using a two-phase process with negative probabilities to approximate the deterministic service time. The approximations are in the form of explicit expressions involving geometric and exponential terms. The approximations extend to the finite-capacity M/D/1/N + 1 queue. © 2007 Cambridge University Press.
Original language | English |
---|---|
Pages (from-to) | 67-76 |
Number of pages | 10 |
Journal | Probability in the Engineering and Informational Sciences |
Volume | 21 |
DOIs | |
Publication status | Published - 2007 |