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

1. Introduction

It has been more than a century since Erlang published his pioneering work [1] in 1909. Since then, many authors have studied the M/D/c queue with Poisson arrivals, deterministic (constant) service time and c multiple servers. The M/D/c queue can be applied in wireless networks like the 5G (Fifth Generation) cellular network with fixed-size machine-to-machine packets [2]. Crommelin studied the delay probability of the M/D/c system in [3], while Franx worked out a simple solution for the waiting time distribution of this system [4]. In addition, Jansen and Van Leeuwaarden have derived explicit solutions for the roots of the equation for the M/D/c systems [5]. Tijms presented the mean number of customers for an M/D/c system in terms of the unsaturated probabilities of the number of customers in the system [6]. Furthermore, Knessl has closed-form expressions for the unsaturated probabilities of number of customers in the M/D/2 system [7]. On the other hand, Shortle et al. presented a method of solving the M/D/c system numerically [8]. Seelen, Tijms and Van Hoorn have also published exact numerical results on the mean number of customers in the queue for the M/D/c system [9].

The contributions of this paper are as follows. An alternate form of explicit root(s) of an equation for the M/D/c queue is/are presented in terms of the Lambert-W function. In addition, the unsaturated probabilities of the number of customers in the system are expressed in terms of the root(s). Finally, the mean number of customers in the system and the mean queueing delay in the system are derived in terms of the root(s). The mean queueing delay formula of the M/D/c system is not only exact and of closed-form, it is also a product of the form of the M/D/1 queueing formula and another term to account for the multiple servers. These are the main contributions of this paper.

2. The M/D/c Queueing Delay Formula

We start to find the solution(s) of the roots of the following equation for the roots of the M/D/c system with c servers and the system utilization, denoted by ρ, from [8].

$${z^c=e}^{-c\rho (1-z)},\mathrm{c}=2,3,\dots \mathrm{a}\mathrm{n}\mathrm{d}\rho =\lambda b/c,$$

(1)

and λ is the arrival rate to the system and b is the deterministic (constant) service time. Let W(x) be the Lambert-W function and it is given by

$$W\left(x\right)=\sum _{n=1}^{\infty }{\displaystyle \frac{{\left(-n\right)}^{n-1}}{n!}}{x}^n.$$

(2)

$$z_k=\left\{\begin{array}{c}{\displaystyle \frac{-W{({-(-1)}^{2k/c}\rho e}^{-\rho })}{\rho }},c=2,4,6,\dots ,k=1,2,\dots ,c–1,\\ {\displaystyle \frac{-W{({(-1)}^{k/c}\rho e}^{-\rho })}{\rho }},c=3,5,7,\dots ,k=1,2,\dots ,c–1.\end{array}\right.$$

(3)

The roots for c = 1, 2, 3, 4, 5, 6 are shown in Table 1. One of the advantages of using th Lambert-W function is that it is readily available in the Matlab software for numerical computation.

Let p_k be the unsaturated probabilities of the number of customers in the system, where k = 0, 1, 2, …, c – 1. From [8],

$$p_0={\displaystyle \frac{{\left(-1\right)}^{c-1}(1-\rho )c{\prod }_{k=1}^{c-1}{z}_k}{{\prod }_{k=1}^{c-1}(1-z_k)}},\mathrm{a}\mathrm{n}\mathrm{d}$$

(4)

the probabilities of p_k ’s are solved using the following equation.

$$\left[\begin{array}{ccc}{a}_{11}& \cdots & a_{1,c-1}\\ ⋮& \ddots & ⋮\\ a_{c-\mathrm{1,1}}& \cdots & a_{c-1,c-1}\end{array}\right]\left[\begin{array}{c}{p}_1\\ ⋮\\ p_{c-1}\end{array}\right]=\left[\begin{array}{c}{b}_1\\ ⋮\\ b_{c-1}\end{array}\right],$$

(5)

where

$$a_{mn}=z_m^n-z_m^c,m,n=1,2,\dots ,c–1,\mathrm{a}\mathrm{n}\mathrm{d}$$

(6)

$$b_m={(z}_m^c-1\}{p}_0,m=1,2,\dots ,c–1.$$

(7)

Solving equation (5), we have the unsaturated probabilities of the number of customers in the M/D/c system for c = 1, 2, 3, 4, 5, 6. They are tabulated in Table 2, Table 3, Table 4, Table 5 and Table 6.

Let us define the followings.

$$g_0=1,\mathrm{a}\mathrm{n}\mathrm{d}$$

(8)

$$g_k={\sum }_{i_1=1}^{c-1}{\sum }_{i_2=i_1+1}^{c-1}\dots .{\sum }_{i_k=i_{k-1}+1}^{c-1}{\prod }_{j=1}^k{z}_{i_j},k=1,2,\dots ,c–1.$$

(9)

From [6], the mean number of customers in the M/D/c queue, N_q, is given by

$$N_q={\displaystyle \frac{U}{2\left(1-\rho \right)c}},\mathrm{a}\mathrm{n}\mathrm{d}$$

(10)

$$U={\left(cp\right)}^2-c\left(c-1\right)+\sum _{k=0}^{c-1}(c\left(-1\right)-k\left(k-1\right)p_k.$$

(11)

Expressing the probabilities of p_k’s in terms of the g_k’s in equations (8) and (9), we have

$$p_k={\displaystyle \frac{{\left(-1\right)}^k(g_{c-k-1}+g_{c-k})}{{\prod }_{i=1}^{c-1}{z}_i}}{p}_0,k=1,2,\dots ,c–1$$

(12)

Furthermore, substituting them into equation (11), we have

$$U={\left(cp\right)}^2-c\left(c-1\right)+{\displaystyle \frac{2c\left(1-\rho \right)\sum _{k=1}^{c-1}{\left(-1\right)}^{k-1}\left(c-k\right)g_{k-1}}{{\prod }_{i=1}^{c-1}{(1-z}_i)}}.$$

(13)

Applying Little’s Law, the mean queueing delay of the M/D/c system, denoted by W, is given by

$$W={\displaystyle \frac{N_q}{\lambda }}.$$

(14)

Simplifying and rearranging some terms, we have

$$W={\displaystyle \frac{\lambda b^2}{2\left(1-\rho \right)c}}{\displaystyle \frac{U}{{\left(c\rho \right)}^2}}.$$

(15)

Note that the square of the deterministic (constant) service time is equal to the second moment of its service time. Substituting equation (13) into equation (15), we have

$$W={\displaystyle \frac{\lambda b^2}{2\left(1-\rho \right)c}}{\displaystyle \frac{{\left(cp\right)}^2-c\left(c-1\right)+\frac{2c(1-\rho )\sum _{k=1}^{c-1}{\left(-1\right)}^{k-1}(c-k)g_{k-1}}{{\prod }_{i=1}^{c-1}{(1-z}_i)}}{{\left(c\rho \right)}^2}}.$$

(16)

They are tabulated in Table 7 for the number of servers, c = 2, 3, 4, 5, 6. Note that c = 2, 3, …, in general. On further simplification of (16), we have

$$W={\displaystyle \frac{\lambda b^2}{2\left(1-\rho \right)c}}{\displaystyle \frac{{\left(cp\right)}^2-c\left(c-1\right)+2c(1-\rho )\sum _{k=1}^{c-1}\frac{1}{1-z_k}}{{\left(c\rho \right)}^2}}.$$

(17)

Equation (17) is the exact closed-form M/D/c queueing delay formula. Note that the service time, b, needs not be set to 1 and there is no need for any rescaling after that.

3. Results

We present the results of the M/D/c system with the number of servers, c = 2, 3, 4, 5, 6 and the constant service time, b = 1, to be consistent with [9] in this results section. The mean number of customers in the system, N_q, from analysis in Section 2 is compared with known exact numerical results from [9], while the exact mean queueing delay, W, from the analysis in Section 2 is also presented. Note that the constant service time needs not be set to 1 in (17) in general.

Table 8a and Table 8b present the results for the mean number of customers with our results as compared to available exact numerical results from [9]. Both results match excellently. Only available numerical results from [9] are presented for each system utilization value.

Table 9a and Table 9b present our results for the mean queueing delay with our exact closed-form M/D/c queueing delay formula. The results agree with Little’s Law and can also be derived from Table 8a and Table 8b.

4. Discussion

The result in Section 2 provides an exact closed-form M/D/c queueing delay formula. It is in a form that is extending the form of M/D/1 queue expression as well. In addition, this result is dependent on the roots which are expressed in terms of the Lambert-W function. Furthermore, this function is readily available in software like Matlab for ease of numerical computation. The M/D/c queueing system also has applications in wireless networks and other fields.

5. Conclusions

An exact closed-form M/D/c queueing delay formula has been derived. The final form of the result does not require the solution of a set of linear equations anymore. This formula depends on the roots of the solution to an equation for the M/D/c system. Furthermore, the roots are presented in an alternate explicit form in terms of the Lambert-W function for ease of numerical computation. Numerical results show that these results are in excellent agreement with published exact numerical results.

The significance of this queueing delay formula presented in this paper is that it moves us a step closer to an exact closed-form M/G/c queueing system as the exact closed form M/M/c queueing delay formula is also well-known [10].