Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Exact Closed-Form M/D/c Queueing Delay Formula

Version 1 : Received: 12 January 2024 / Approved: 15 January 2024 / Online: 15 January 2024 (08:50:49 CET)

How to cite: Wong, D.T.C. Exact Closed-Form M/D/c Queueing Delay Formula. Preprints 2024, 2024011070. https://doi.org/10.20944/preprints202401.1070.v1 Wong, D.T.C. Exact Closed-Form M/D/c Queueing Delay Formula. Preprints 2024, 2024011070. https://doi.org/10.20944/preprints202401.1070.v1

Abstract

It has been more than a century since Erlang published his paper in 1909. The classical queueing system for the M/D/c queue has been investigated by many authors. The key is to find the roots of an equation using explicit or numerical methods. We present an alternate form of explicit solution(s) of this/these root(s) using the Lambert-W function in this paper. In addition, the unsaturated probabilities of the number of customers in the system is derived explicitly in terms of this/these root(s). Finally, the mean number of customers in the system and the mean queueing delay are obtained from these probabilities. The exact queueing delay formula for the M/D/c queue is expressed in closed-form in terms of the root(s). Numerical results show that they are in excellent agreement with the numerical results published by Seelen, Tijms and Van Hoorn.

Keywords

M/D/c Queue; Poisson Arrivals; Deterministic (Constant) Service Time; c Multiple Servers; root(s) of an equation; mean number of customers; mean queueing delay

Subject

Computer Science and Mathematics, Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.