Research Article | Open Access

# Analytically Explicit Results for the Distribution of the Number of Customers Served during a Busy Period for Special Cases of the *M/G/*1 Queue

**Academic Editor:**Aera Thavaneswaran

#### Abstract

This paper presents analytically explicit results for the distribution of the number of customers served during a busy period for special cases of the queues when initiated with *m* customers. The functional equation for the Laplace transform of the number of customers served during a busy period is widely known, but several researchers state that, in general, it is not easy to invert it except for some simple cases such as and queues. Using the Lagrange inversion theorem, we give an elegant solution to this equation. We obtain the distribution of the number of customers served during a busy period for various service-time distributions such as exponential, deterministic, Erlang-*k*, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. Further, we also provide computational results using our method. The derivations are very fast and robust due to the lucidity of the expressions.

#### 1. Introduction

Emphasis on numerical transform inversion has become an important method for computing probability distributions in stochastic models [1–3]. In queueing theory, as transforms can often represent probability distributions, it is necessary to find the numerical inversion technique. Generally, the analytical inverse transform is difficult to evaluate or obtain in closed explicit form. For example, in an queueing system, the probability generating function (PGF) of the distribution of the number of customers served during a busy period and the Laplace transform (LT) of the busy period distribution are represented as functional equations.

Queueing systems are directly applicable to many fields such as telecommunication, production, and computer systems. Most performance measures analyze the system to reduce the delays experienced by a customer. The analysis of the busy period is a significant component of any queueing system from the server’s viewpoint, which helps in the efficient planning of the system. Understanding the characteristics of the busy period could manage to prevent server overload. When an arriving customer gets the system empty, a busy period begins and ends when the system next becomes empty.

In the case of queue, Borel [4] first found the distribution of the number of customers served during the busy period when by a geometric argument, and Tanner [5] showed that Borel’s argument is valid for general *m*, where *m* is the number that initiates the busy period. Kendall [6] also obtained a continuous analogue of this distribution. Haight [7] studied the distribution in the case of queue, analogous to the method used by Borel–Tanner. Using different approaches, the distribution of the number served during a busy period has been considered by Prabhu [8, 9], Haight [7, 10, 11], Takács [12, 13], Kemp and Kemp [14], and Feller [15]. Takács studied using a generalization of the classical ballot theorem [16]. Heyman [17] obtained an approximation for the busy period of the queue using a diffusion model. The joint distribution of the length of the busy period and the number of customers served during that busy period for the queues has been studied by Prabhu [9]. Consul and Shenton [18] showed that Lagrange distributions give a general form for the probability distribution of the number of customers served at a single counter in a busy period with the inputs following a discrete distribution and the service-time being constant.

For the queueing system , one of the important distributions is the number of customers served during a busy period. This distribution has been discussed by many researchers. In particular, see [19, 20, 21] and references therein. Most of the researchers mentioned there either give only the functional equation or using that they give a few moments or solve that equation numerically (see, e.g., [21]). In general, as stated by them that getting an explicit form of this distribution being difficult, they give results only in some simple cases such as and (see, e.g., [20, 21]). In this paper, for the queueing system , using the well-known Lagrange inversion theorem, we give explicit results for the distribution of the number of customers served during a busy period by considering many service-time distributions such as exponential, deterministic, Erlang-*k*, gamma, chi-square, inverse Gaussian, generalized Erlang, matrix exponential, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process. In addition, we also give numerical results. The benefit of these closed-form expressions is that they are comparatively simple, elegant, and can be easily computed numerically. The problem of finding the number of customers served during a busy period in various systems such as computer communication systems is useful in developing congestion control strategies.

The paper is organized as follows. In Section 2, we describe the model in detail, derive an equation for the Laplace transform of the number of customers served during a busy period, and find the moments of the number served during a busy period using functional equation. We also present an analytical derivation of the distribution of the number of customers served during a busy period for the system using Lagrange inversion theorem. Section 3 gives analytically explicit results for the distribution of the number of customers served during a busy period by considering many service-time distributions. Section 4 provides computational results. Section 5 concludes the paper.

#### 2. *M/G*/1 Queue

In this section, we consider the distribution of the number of customers served during a busy period for the continuous-time queueing system when initiated by *m* customers. We assume that the interarrival times of customers are independent and follow an exponential distribution with common mean interarrival time . The service-times are independent and identically distributed as a random variable *S* with a general distribution function , probability density function (pdf) , Laplace transform (LT) , and mean service-time , where denotes the first derivative of evaluated at . We assume that . For any integer , let be the probability that *j* customers arrive during the service period of a single customer. Let be the generating function of and it is given by ; that is,

In this paper, we assume that customers initiate a busy period when . The case can be considered as the initial busy period where a queue is permitted to build before the server starts working. The case presents subsequent busy periods where the arrival of a single customer terminates the idle period. We also assume that , so that all busy periods will terminate with probability one. For the queueing system , one of the important distributions is the number of customers served during a busy period. Most of the researchers either give only the functional equation which we derive below for completeness sake or using that equation, they give a few moments or solve that equation numerically [19, 20, 21].

##### 2.1. Functional Equation for the Number of Customers Served during a Busy Period

We present the distribution of the number of customers served during a busy period for the continuous-time queueing system. A busy period is initiated by a single customer. It begins at the instant of the arrival of a customer to an empty system and ends at the instant the server becomes idle for the first time. When the busy period ends, the idle period starts and ends when the next customer arrives. Let be the number of customers served during a busy period *T*. Since the arrivals are Poisson distributed, it implies that the lengths of subbusy periods are independent and identically distributed random variables and equal to the distribution of the length of the total busy period *T*. The number of customers served during each busy period is independent and identically distributed and equal to the distribution of number of customers served during a complete busy period. Let be the number of customers served during the busy period generated by the *i*th arrival, *A* a random variable representing the number of arrivals that arrive during *S*, *N* the number served during the entire busy period, and its probability generating function . Then, since each arrival during the initial service-time of the busy period will generate its own distribution of the number served, we may write with . Now, since the arrivals follow a Poisson process, are independent of *A* and *S* and are also independent random variables identically distributed as *N*, we may write the following by conditioning *N* by *A* and *S*:which shows that the probability generating function for the number of customers served during a busy period satisfies the above functional equation.

##### 2.2. Distribution of the Number of Customers Served during a Busy Period for the M/G/1 System

In this subsection, we present the derivation of the distribution of a number of customers served during a busy period for the system using Lagrange inversion theorem. In mathematical analysis, the Lagrange inversion theorem provides the Taylor series expansion of the inverse of an analytic function. Closed-form solutions of (2) can be found using Lagrange’s inversion theorem. Applying (1) in (2), we may rewrite as

By Lagrange inversion theorem, we getwhere denotes the *x*th derivative of with respect to *z* evaluated at and . For a particular service-time distribution , we can easily get an expression for and thus an expression for . For more details, one may refer studies of Consul and Famoye [22] and Jain et al. [23]. Suppose that there are customers at the beginning of the busy period *T*. Then, the PGF of the number served during the busy period is given by , where is the PGF of the number served during the busy period that begins by a single customer. The probability generating function of is , and its Lagrange’s series expansion simplifies to

This provides

Equation (6) provides the distribution of a number of customers served during a busy period for the system when initiated with *m* customers. Taking into consideration various service-time distributions, we present the distribution of a number of customers served during a busy period in Section 3. In the derivation of analytical results, we also use Leibniz’s rule. The general Leibniz’s rule states that if and are *n*-times differentiable functions, then the product is also *n*-times differentiable and its *n*th derivative is given by

The formula can be generalized to the product of *k* differentiable functions :where the sum extends over all *k*-tuples of nonnegative integers with and are the multinomial coefficients.

##### 2.3. Moments of the Number Served during a Busy Period Using Functional Equation

Here, we obtain mean and variance of the number of customers served during a busy period for the queueing system . Let be the *k*th moment of the service-time; that is, and variance . Here, . Let be the *r*th moment of the number served during a busy period when initiated by single customer. We obtain from (2) the followingimplyinggiving

Since , we have

The variance of the number of customers served during a busy period when initiated by single customer is

When a busy period begins with an initial number of *m* customers in the system, the transition of the underlying Markov process from *m* to 0 can be made up of *m* intervals with the same distribution corresponding the transitions from because of the Markovian property of the arrival process. These *m*-independent busy periods start with single customer in the system so that . Hence, if is the random variable representing a busy period initiated by *m* customers, we haveNote that higher order moments can be obtained similarly.

#### 3. Distributions

In this section, we derive the distribution of the number of customers served during a busy period for different service-time distributions. Using Lagrange’s expansion, we find the number of customers served during a busy period when initiated with *m* customers for the exponential, deterministic, gamma, chi-square, mixed generalized Erlang, matrix exponential, inverse Gaussian, hyperexponential, uniform, Coxian, phase-type, Markov-modulated Poisson process, and interrupted Poisson process service-time distributions. In the literature, explicit results are available only for exponential and deterministic service-time distributions.

##### 3.1. Exponential Distribution

The exponential distribution has probability density function (pdf) , where the parameter *µ* is a real, positive constant. The Laplace transform (LT) is . The mean, second moment, and variance of the exponential distribution are , , and , respectively. Substituting the LT of exponential service-time distribution in functional equation (2), we have

Using (16) in (5) and (6), we getwhich matches with the results of Medhi [20]. From (14) and (15), the mean and variance of the number of customers served during a busy period when initiated by *m* customers can be obtained as follows:

When , the distribution of the number of customers served during a busy period initiated by a single customer is

*Remark. *We could have obtained mean and variance from the distribution presented above in equation (17), but we have used (14) and (15) to find the mean and variance, respectively. This is because, in simple cases like the one presented in equation (17), we can find the mean and variance easily, but in more complex situations that arise later, it is not that simple to get the mean and variance from the distributions derived there. However, the accuracy of the analytic results was checked numerically.

##### 3.2. Deterministic Distribution

We consider the deterministic distribution with pdf , where is the Dirac delta function. The LT is given by . The mean, second moment, and variance of the deterministic distribution are , , and , respectively. Substituting the LT of deterministic service-time distribution in functional equation (2), we have

Using (20) in (5) and (6), we getwhich is the Borel–Tanner distribution with . This corresponds to the distribution derived by Tanner [5] as the distribution of the number of customers served during a busy period. The mean and variance of the distribution of the number of customers served during a busy period can be obtained aswhich match with the results reported in [20].

##### 3.3. Erlang-*k* Distribution

A random variable *X* has an Erlang-*k * distribution if *X* is the sum of *k* independent random variables having a common exponential distribution with mean . The probability density function of the Erlang-*k* distribution is The Laplace transform is given by . The Erlang distribution is a special case of the gamma distribution. It is defined by two parameters, *µ* and *k*, where *µ* is the scale parameter and *k* is the shape parameter which must be a positive integer. In the gamma distribution, *k* can be any real number, including fractions. The mean, second moment, and variance of the Erlang-*k* distribution are , , and , respectively. Substituting the LT of Erlang-*k* service-time distribution in functional equation (2), we have

Using (23) in (5) and (6), we get

The mean and variance of the number of customers served during a busy period can be obtained aswhere .

##### 3.4. Gamma Distribution

Let us consider the gamma distribution with probability density function , and for . The parameters are and . The parameters *γ* and *µ* are called the shape and scale parameters, respectively. The mean, second moment, and variance of the gamma distribution are , , and , respectively. The Laplace transform is . It resembles the function involved in defining the Erlang-*k* distribution. Substituting the LT of gamma service-time distribution in functional equation (2) and using Lagrange’s inversion theorem, the distribution of the number of customers served during a busy period initiated by *m* customers is

The mean and variance of the number of customers served during a busy period can be obtained as

##### 3.5. Chi-Square Distribution

Let be normal independent random variables with mean 0 and variance 1. Then, the random variable has the probability density function , and is said to follow the chi-square distribution with *k* degrees of freedom, abbreviated . The mean, second moment, and variance of the distribution are , , and , respectively. The special case of the gamma distribution is the chi-square distribution by setting and . The LT is . Substituting the LT of chi-square service-time distribution in functional equation (2) and using Lagrange’s inversion theorem, the distribution of the number of customers served during a busy period initiated by *m* customers is

The mean and variance of the number of customers served during a busy period can be obtained as

##### 3.6. Inverse Gaussian Distribution

We consider the inverse Gaussian distribution with pdf and LT , where and . The mean, second moment, and variance of the inverse Gaussian distribution are , , and , respectively. Substituting the LT of inverse Gaussian service-time distribution in functional equation (2) and applying Lagrange’s inversion theorem, we get

The mean and variance of the number of customers served during a busy period can be obtained as

##### 3.7. Generalized Erlang Distribution

We assume the generalized Erlang distribution or hypoexponential distribution of a series of 2 exponential distributions each with their own rates with probability density function and Laplace transform . The mean, second moment, and variance of the Generalized Erlang distribution are , , and , respectively.

Substituting the LT of generalized Erlang service-time distribution in functional equation (2) and applying Lagrange’s inversion theorem, we get

The mean and variance of the number of customers served during a busy period can be obtained as

##### 3.8. Matrix Exponential Distribution

We consider the matrix exponential distribution with pdf and Laplace transform , where . The mean, second moment, and variance of the matrix exponential distribution are , , and , respectively. Substituting the LT of matrix exponential service-time distribution in functional equation (2) and using Lagrange’s expansion, we have

The mean and variance of the number of customers served during a busy period is

##### 3.9. Hyperexponential Distribution

We assume the hyperexponential distribution with probability density function such that and Laplace transform . The mean, second moment, and variance of the hyperexponential distribution are , , and , respectively. Taking and substituting the LT of hyperexponential service-time distribution in functional equation (2), we have

Applying Lagrange’s expansion and Leibniz rule, we get

The mean and variance of the number of customers served during a busy period can be obtained from as

##### 3.10. Uniform Distribution

We assume the uniform distribution with probability density function , where *a* and *b* are real constants with . The Laplace transform is . The mean, second moment, and variance of the uniform distribution are , , and , respectively. Substituting the LT of uniform service-time distribution in functional equation (2) and applying Lagrange’s inversion theorem, we get

The mean and variance of the number of customers served during a busy period can be obtained as

##### 3.11. Two-Phase Coxian Distribution: Cox-*C*_{2}

The Coxian distribution is a generalization of the hypoexponential distribution. Instead of only being able to get into the absorbing state from state *k*, it can be arrived from any phase. Here, we assume that follows the two-phase Coxian distribution and its Laplace transform is . The mean, second moment, and variance of the distribution are , , and , respectively.

Substituting the LT of Cox service-time distribution in functional equation (2) and using Lagrange’s inversion theorem and Leibniz’s rule, we have

The mean and variance of the number of customers served during a busy period can be given as

##### 3.12. Phase-Type Distribution

A phase-type (PH) distribution is constructed by a mixture of exponentially distributed phases. It results from a system of one or more inter-related Poisson processes occurring in sequence, or phases. Let *ω* denote the number of phases. The process begins in phase *i* with probability . Let be the transition rate out of phase *i*. After completion of a phase, the process may join the absorbing state or continue with a nonabsorbing phase. Let be the probability of transition from phase *i* to phase *j*, , and let be the probability of transition from phase *i* to the absorbing state, . The parameters must satisfy the following conditions: . Let the row vector *α* denote the *ω*-dimensional vector of the initial state distribution of the underlying Markov process, the square matrix *T* denote the sub-generator of the underlying Markov process held to the transient states . Let denote the *ω*-dimensional column vector of transition rates to the absorbing state. Hence,

The LT of phase-type distribution for the case , that is, is given by

Substituting the LT of service-time distribution in functional equation (2) and using Lagrange’s inversion theorem, we getwhere

The mean and second moment of the distribution are and , respectively. Here, . Thus, the mean and variance of the number of customers served during a busy period is

##### 3.13. Markov-Modulated Poisson Process

A Markov-modulated Poisson process (MMPP) is a doubly stochastic Poisson process whose intensities vary according to the state of a Markov chain. An MMPP can be categorized by the number of states the modulating Markov chain contains, for example, a Markov chain with two states and two intensities is denoted MMPP-2, or sometimes switched Poisson process (SPP). If the two intensities are equal, the model becomes an ordinary Poisson process. A two-state MMPP has only two states in its underlying modulating Markov chain, described by

The Laplace transform is given by

Substituting the LT of MMPP-2 service-time distribution in functional equation (2) and applying Lagrange’s inversion theorem, we getwhere