The well-known formula for the waiting time distribution of M/D/1 queueing systems is numerically unsuitable when the load is close to 1.0 and/or the results for a large waiting time are required. An algorithm for any load and waiting time is presented, based on the state probabilities of M/D/1. The principles are also applicable for other queueing systems.
No takes yet. Share an insight, caveat, or question.
Iversen et al. (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: