Research Article  Open Access
Mohan L. Chaudhry, James J. Kim, Abhijit D. Banik, "Analytically Simple and Computationally Efficient Results for the GI^{X}/Geo/c Queues", Journal of Probability and Statistics, vol. 2019, Article ID 6480139, 18 pages, 2019. https://doi.org/10.1155/2019/6480139
Analytically Simple and Computationally Efficient Results for the GI^{X}/Geo/c Queues
Abstract
A simple solution to determine the distributions of queuelengths at different observation epochs for the model GI^{X}/Geo/c is presented. In the past, various discretetime queueing models, particularly the multiserver bulkarrival queues, have been solved using complicated methods that lead to incomplete results. The purpose of this paper is to use the roots method to solve the model GI^{X}/Geo/c that leads to a result that is analytically elegant and computationally efficient. This method works well even for the case when the interbatcharrival times follow heavytailed distributions. The roots of the underlying characteristic equation form the basis for all distributions of queuelengths at different time epochs.
1. Introduction
The study of discretetime queues is relatively recent compared to its continuoustime counterpart. Over the last few decades, the field quickly gained value among queueing theorists and researchers due to the digitization of information technology, particularly in the area of signal processing devices, microcomputers, and computer networks. In analyzing the discretetime queues, many researchers have recognized that the continuoustime models are no longer suitable to accurately measure the performance of systems in which the basic operational units are digital, such as machine cycle time, bits, and packets (see Miyazawa and Takagi [1] for details). For further details on the discretetime models and telecommunications, one may see Bruneel and Kim [2]. In this connection, see also Takagi [3].
In discretetime queueing theory, various techniques have been introduced by many researchers to analyze the GI/Geo/1 queues. Some of their techniques include the imbedded Markov chain, supplementary variable, semiMarkov process, birth and death process, matrixanalytic, combinatorial, and numerical methods. What is pervasive across these techniques is in their final product: The GI/Geo/1 queue has three distinct queuelength distributions at three different time epochs. Though each queuelength distribution has its own importance, they all have other purposes as well. For instance, the queuelength distribution at a prearrival time epoch is used to compute the actual waitingtime distribution, and in the case of queues with finite capacity, it is used to evaluate the blocking probabilities (see Chaudhry and Gupta [4]). The queuelength distribution at a random time epoch is needed to compute the virtual waitingtime distribution, whereas the queuelength distribution at an outside observer’s time epoch is used to obtain the mean waitingtimeinqueue using Little’s law. Moreover, relations between the queuelength distributions at different time epochs involve interesting mathematical derivations. For some of the earlier work on the discretetime singleserver queueing models, see Zukerman and Rubin [5].
In comparing the GI/Geo/1 queue with its continuoustime counterpart GI/M/1, the main difference between the two models is in the measurement of time. While a continuoustime model has a time parameter that is a real number, a discretetime model has a time parameter that is an integer. In the model GI/Geo/1, the time axis is divided into individual time slots where the duration of one time slot is a single unit of time. In each individual time slot, two events may occur: arrival and departure. When an arrival occurs before a departure, it is called GI/Geo/1 with early arrival system (EAS), and when a departure occurs before an arrival, it is called GI/Geo/1 with late arrival system (LAS). Further, in GI/Geo/1 with LAS, if a server is idle and a customer arrives, then either his service can start immediately or in the next time slot. In the former case, it is known as an immediate access (IA), whereas in the latter case, it is known as a delayed access (DA). When discussing the GI/Geo/1 type queues, there exist six queuelength distributions: prearrival, random, and outside observer’s time epochs (three for EAS and three for LASDA).
The queueing model GI^{X}/Geo/1 considers the model GI/Geo/1 with a batch arrival. The earliest work on GI^{X}/Geo/1 appears to be that of Vinck and Bruneel [6] who use the complex contour integration technique. Though they provide an analytical solution to GI^{X}/Geo/1 with EAS at different time epochs, they do not provide the corresponding numerical results. Furthermore, in their work, the analysis of GI^{X}/Geo/1 with LASDA is missing, yet it is deemed to be an important aspect of GI^{X}/Geo/1 when considering applications in telecommunications (see Takagi [3]). In response to this, Chaudhry and Gupta [7] provide the first complete solution to GI^{X}/Geo/1 using the supplementary variable technique. One of the main contribution of their work is that they do not stop after finding the probability generation function (p.g.f.) which was a common way to conclude the analysis of a queueing model at that time, but perform the inversion of the p.g.f. Doing so enables the finding of steadystate queuelength distributions in terms of the roots of the model’s characteristic equation. This technique is referred to as the roots method.
Historically, the roots method was dismissed by some queueing theorists due to perceived difficulties in computing the roots of a model’s characteristic equation. Neuts states (see Stidham [8]) “in discussing matrixanalytic solutions, I had pointed out that when the Rouché roots coincide or are close together, the method of roots could be numerically inaccurate. When I finally got copies of Crommelin’s papers, I was elated to read that, for the same reasons as I, he was concerned about the clustering of roots. In 1932, Crommelin knew; in 1980, many of my colleagues did not….” Readers can refer to Neuts [9] for his other comments on the roots method. In the 1980s, commercial computing software such as MAPLE were not able to find the roots (they do now). To address the issue of rootfinding in queueing theory, the QROOT software was developed by M. L. Chaudhry in the early 1990s and demonstrated that such roots can be found (see Chaudhry [10]). The roots method was then successfully adopted to solve a wide variety of queueing problems as noted by Janssen and van Leeuwaarden [11] who write “initially, the potential difficulties of rootfinding were considered to be a slur on the unblemished transforms since the determination of the roots can be numerically hazardous and the roots themselves have no probabilistic interpretation. However, Chaudhry et al. [12] have made every effort to dispel the skepticism towards rootfinding in queueing theory….”
While the roots method is simply another way of solving queueing problems, there are added advantages to it as well. Gouweleeuw [13] states “it is more efficient to use the roots method to get explicit expressions for probabilities from generating functions.” Furthermore, a recent paper by Maity and Gupta [14] compares the spectral theory approach against the roots method. Maity and Gupta [14] identify several difficulties in getting results using the spectral theory approach, an approach which may be simpler than the matrixgeometric approach as stated in several papers by Chakka (see, e.g., Chakka [15]). As well, Daigle and Lucantoni [16] state “whenever the roots method works, it works blindingly fast.”
However, while the roots method historically only dealt with queues with lighttailed distributions, more recent research by Harris et al. [17] conclude that the roots method cannot solve queues with heavytailed interarrival times. The heavytailed distributions constitute a class of probability distributions that are characterized by slower decay rate than the exponential or geometric distribution. When considering the heavytailed distributions as an interarrival time distribution, the consensus among some researchers is that the roots method cannot be applied due to the unique probabilistic properties of the heavytailed random variables. In sharing this view, Harris et al. [17] state that “the standard rootfinding problem gets complicated particularly when the interarrival time distribution possesses a complicated nonclosed form or nonanalytic LaplaceStieltjes transform (LST).” The same difficulty persists in discretetime queues since the discrete heavytailed probability distributions such as Weibull and LogNormal distributions do not have a closed form of probability generating function (p.g.f.). In addition, the discrete Pareto distribution, for certain values of its parameter, has an infinite mean just like the continuous Pareto distribution.
Nevertheless, the heavytailed distributions are useful tools in modeling reallife examples (see Willinger and Paxon [18], Leland et al. [19], Park et al. [20, 21], and Pitkow [22]). In particular, the heavytailed distributions (or synonymously referred to as the power, long, or fattailed distribution) are particularly useful when modeling the interarrival times of network packets and connection sizes under heavy traffic congestion (see Harris et al. [17]). While the use of heavytailed distributions has predominantly been in the continuoustime realm, the use of discrete heavytailed distributions in probabilistic modeling is evident in a number of synchronous Time Division Multiplexed (TDM) communication systems such as slotted wireless communications channels, asynchronous transfer mode, and optical packet switching (see Hernández et al. [23]). In the field of medical science and biostatistics, Para and Jan [24] have recently discovered that the Burrtype XIII and Lomax distributions are helpful in modeling a discrete data which exhibits heavy tails.
In this paper, we show that the model GI^{X}/Geo/c including the heavytailed interbatcharrival times can be solved through roots. In doing so, we express all queuelength distributions of GI^{X}/Geo/c in terms of the roots of the model’s characteristic equation.
Our analytical proof on the existence of roots (see Appendix A) and the rootfinding algorithm (see Section 11) form the foundation of our contribution. In our numerical analysis, we demonstrate how the roots of the characteristic equation behave within the contour of a unit circle. In doing so, several interesting results appear as we vary the traffic intensity, the batch size distribution, interbatcharrival times, and the maximum batch size.
While solving the model GI^{X}/Geo/c through roots directly addresses some statements made by several authors, there are added benefits to it as well. Queueing theory, under the scope of algorithmic efficiency, places heavy emphasis on achieving a simpler and more efficient solution procedure as it saves memory usage and computingtime. In our method, the roots are quickly found and the queuelengths (which are all in terms of roots) can be computed efficiently. Efficiency equates to higher engineering productivity, whereas in a purely mathematical sense, a new approach to GI^{X}/Geo/c through roots reveals something new in the literature. For instance, the real root from the characteristic equation of GI^{X}/Geo/c can also be used to approximate the asymptotic loss probability in GI^{X}/Geo/c/S with a moderately sized , where is the maximum capacity of the system. Also, the characteristic equation of GI^{X}/Geo/c can be transformed into that of GI^{X}/M/c. Doing so enables us to compute the roots of the characteristic equation of GI^{X}/M/c with an interbatcharrival time distribution that has nonclosed and nonexistent LSTs. Lastly, it is identified that that some of the preexisting derivations in a model with lighttailed distributions are no longer applicable if the mean interbatcharrival time is infinite.
The roots method significantly simplifies and extends the similar work done by others using different techniques: In solving the nonbulkarrival queue GI/Geo/c, Chan and Maa [25] use the imbedded Markov chain technique to derive the queuelength distribution for EAS at the prearrival epoch only. In this connection, one may also see Gao et al. who use the generating function approach to solve their nonbulk queues GI/Geo/c [26, 27] and GI/D/c [28, 29]. We have avoided that approach by using the differenceequation approach. Besides, none of the above authors consider heavytailed interarrival times. Similarly, Wittevrongel et al. [30] solve using complex analysis and contour integration while only considering the EAS with no numerical results. Lastly, Chaudhry et al. [31] solve using the supplementary variable technique that consider the lighttailed interbatcharrival times only. The results by Chaudhry et al. [31] are in terms of iterative relations between different queuelength distributions which can be analytically laborious and numerically inefficient. Our work also responds to the comments made by several mathematicians such as Kendall, Kleinrock, and Neuts [9]. Kendall [32] made a famous remark that queueing theory wears the Laplacian curtain. Kleinrock [33] states “one of the most difficult parts of this method of spectrum factorization is to solve for the roots.”
2. Model Description
Consider the model GI^{X}/Geo/c in which customers arrive in batches of size with a maximum size . The probability mass function (p.m.f.) of is with mean and p.g.f. . The th interbatcharrival time, say , is a discretetime period that is measured from the moment just before the nth batcharrival (say at time to the moment just before the th batcharrival (say at time ). Interbatcharrival times are independent identically distributed random variables (i.i.d.r.v.’s) distributed as which is divided into time slots. The random variable has a p.m.f. , mean , and p.g.f. . The batch size and the interbatcharrival times are independent. There are servers in the model where each has service time that is independent to one another and geometrically distributed as
The mean service time of one server is and the traffic intensity of the model is . In addition, let be the probability of an event that customers are served out of customers within a single time slot. The conditional probability then follows the binomial distributionwith and for or . Lastly, given that GI^{X}/Geo/c is a discretetime queueing model, it has two different but related aspects (EAS and LASDA). Since the model is solved under the steadystate condition, the queuelength distribution of the Late Arrival System with Immediate Access (LASIA) is identical to that of the EAS.
3. GI^{X}/Geo/c with EAS at a PreArrival Time Epoch
In GI^{X}/Geo/c with EAS, the th batch arrival occurs before the departures in the th interbatch arrival time. This is illustrated in Figure 1.
Let be the number of customers in the system, including those, if any, receiving service just before the th batch arrival (i.e., at the th prearrival time epoch). The stochastic process forms a homogenous Markov chain:where is the number of customer departures during and is the size of the th batch arrival. In considering the steadystate aspect of GI^{X}/Geo/c with EAS, becomes as with a p.m.f. and becomes as . Let be the nstep transition probabilities of . We define and then using the imbedded Markov chain analysis, we have the following transition probabilities:where for . As becomes with p.m.f. which is defined asfor The ’s given above can be derived by replacing the singlearrival notion with a batcharrival condition in the onestep transition probabilities of GI/Geo/c which are available in Chan and Maa [25]. Furthermore, the same results are also available in Chaudhry et al. [31]. Lastly, in expressing in terms of roots, the ChapmanKolmogorov equation,is used extensively. Since (6) is a set of firstorder linear difference equations with being the unknown functions to be determined, we can assume a solution of a general formwhere is a nonzero constant. Note that is the prearrival queuelength distribution for the overloaded servers of GI^{X}/Geo/c with EAS since indicates that all servers are busy throughout . Substituting the above into (6) yields the characteristic equation of GI^{X}/Geo/cwhere . Since (8) has roots inside the unit circle (see Appendix A for proof), let these roots be . Hence, for becomes fold and is expressed aswhere (yet to be evaluated) for are the nonzero constants. In completely finding , we replace in (6) with (9) such that
The normalizing conditionis used in conjunction with (10) such that when we let in (10) to have equations that are required to solve for and . On the contrary, when we let in (10), and with the normalizing condition we have equations that are required to solve for and (the ’s when are different from those when ). Solving these equations leads to the solution
4. GI^{X}/Geo/c with EAS at a Random Time Epoch
In the steadystate GI^{X}/Geo/c with EAS, a prearrival time epoch falls just before a batcharrival, whereas a random time epoch falls at any instant between two consecutive batch arrivals. Let be the discretetime period measured from to . In addition, are i.i.d.r.v.’s distributed as with p.m.f. . Visual illustration of and for GI^{X}/Geo/c with EAS are provided in Figure 2, where is the duration of time measured from the th prearrival time epoch to the th random time epoch, whereas is the duration of time measured from the th prearrival time epoch to the th prearrival time epoch.
Based on discrete renewal theory and the lengthbiased sampling phenomenon (see Chaudhry and Templeton [34] for definition and Kim [35] for similar application in continuoustime queues), if consists of time slots, then its p.m.f. can be expressed in terms of such that
As , the above expression becomes
In addition, let be the steadystate p.m.f. of the number of customers in the system at a random time epoch for GI^{X}/Geo/c with EAS. Using the above relation, we can determine with the following ChapmanKolmogorov equation:where are already known and ’s are the transition probabilities from Section 3, except that is replaced with . In addition, holds. The GASTA property (Geometric Arrivals See Time Averages; see Takagi [3]) holds if is substituted into the relation between and . Doing so leads to ; hence, due to this property, in Geo^{X}/Geo/c.
5. GI^{X}/Geo/c with EAS at an Outside Observer’s Time Epoch
By definition, an outside observer’s time epoch in GI^{X}/Geo/c with EAS falls anywhere just after a batcharrival and immediately before an event of departures. Let be the steadystate queuelength distribution of GI^{X}/Geo/c with EAS at an outside observer’s time epoch.
In Figure 3, the th interbatcharrival time period is a single time slot ; hence, the th random time epoch and the th prearrival time epoch coincide at (this can be checked by letting in Figure 2).
In Figure 3, if there are customers in the system at an outside observer’s time epoch (with probability ) and there are customers in the system at a random time epoch (with probability ), then there must be an event of customer departures (with probability ) between an outside observer’s time epoch and a random time epoch. Based on this notion, we form the relation
Since (16) is an set of firstorder linear difference equations with being the unknown functions to be determined, we assume that for is a geometric sum that consists of the same roots of (8) but with different constant coefficients (hence they are unknown). Let these unknown constant terms be , then we havewhich is the p.m.f. of the steadystate number of customers in the system for the overloaded servers of GI^{X}/Geo/c with EAS at an outside observer’s time epoch. By replacing in (16) with the above geometric sum, we havewith the normalizing condition
When we let in (18), and with (19) it leads to equations that are required to solve for and . On the contrary, when we let in (18), and with (19) it leads to equations that are required to solve for and (the ’s when are different from those when ). Solving these equations leads to an expression of for as
6. GI^{X}/Geo/c with LASDA at a PreArrival Time Epoch
In GI^{X}/Geo/c with LASDA, the th batch arrival occurs after the departures in the th interbatch arrival time. This is illustrated in Figure 4.
Let be the number of customers in the system, including the ones, if any, in service just before the th batcharrival. The random variable becomes and has a p.m.f. as we assume the steadystate condition . Before proceeding to find , it is worth noting that can be found independently of (as done by Chaudhry and Kim [36] in solving the model GI^{X}/Geo/1). However, we leverage from Section 3 to determine for the purpose of demonstrating continuity in our solution procedure. Let be the p.m.f. of there being customers in the system GI^{X}/Geo/c with LASDA at time , and let be the p.m.f. of there being customers in the system GI^{X}/Geo/c with EAS at time . Figure 5 illustrates that in EAS, the th batch arrives at the beginning of the time slot , whereas in LASDA, the same th batch would arrive at the end of the time slot .
If up to customers depart during , then we can develop a relation between and as
As a remark, indicates that if no customers depart during , then with probability , whereas any customer departures during result in with probability . By letting and , so that we have the steadystate queuelength distributions, we have
Since (22) is a set of firstorder linear difference equations with being the unknown functions to be determined, we can make a similar assumption as the one made in Sections 3 and 5, and letbe the p.m.f. of the steadystate number of customers in the system for the overloaded servers of GI^{X}/Geo/c with LASDA at a prearrival time epoch. The ’s in (23) are the unknown nonzero constants. As a remark, (23) differs from (9) since we have in (23) but in (9). This difference is due to the property of GI^{X}/Geo/c with LASDA: assume that there are initially no customers in the system and then a batch of customers arrives after some interbatcharrival time. If the next interbatcharrival time is one time slot (with probability ), then no customers access any of the servers, whereas if the interbatcharrival time is at least two time slots (with probability ), then customers start accessing the idle servers at the beginning of the second time slot. This property results in the definition of the overloaded servers of GI^{X}/Geo/c with LASDA to come into effect when . To solve for and s, (22) is alternatively expressed as
We also consider the normalizing conditionsuch that when we let in (24), and with (25) it leads to equations that are required to solve for and . On the contrary, when we let in (24), and with (25) it leads to equations that are required to solve for and (the ’s when are different from those when ). Solving these equations leads to as
7. GI^{X}/Geo/c with LASDA at Random and OutsideObserver’s Time Epochs
Let and be the p.m.f.’s of the number of customers in system in GI^{X}/Geo/c with LASDA at random and outside observer’s time epochs, respectively. In LASDA, an outside observer’s time epoch falls in a time interval that begins just after a departure and immediately before a batcharrival. Based on this notion, is the same as . In addition, we havewhere is available in (20).
8. p.m.f. of WaitingTimeinQueue and Performance Measures
Let be the amount of time an arbitrary customer of an incoming batch spends in queue upon batcharrival and until entering service. As mentioned by Chaudhry and Templeton [34], if the position of an arbitrary customer of an incoming batch is , then its p.m.f. is . Since the system capacity of the GI^{X}/Geo/c queues is infinite, the waiting time distribution remains the same in both LASDA and EAS (see Hunter [37] and Chaudhry and Gupta [7]). Let the p.m.f. of be . As stated by Chaudhry et al. [31], iswhere .
9. Performance Measures
The model GI^{X}/Geo/c has various performance measures. Since the distributions are known, various moments can be calculated. In particular, denote as the mean number of customers in the system and as the mean number of customers in queue, both at an outside observer’s time epoch. and can be found in terms of such that
The mean waitingtime in the system and the mean waitingtimeinqueue can also be found using Little’s law:
In addition, can be found separately by using the result in Section 8, which is . Furthermore, it can be shown that the average number of idle servers can be found using the expression
The lefthand side of (32) determines the average number of idle servers using the queuelengthdistribution at an outside observer’s time epoch. The righthand side of (32) determines the same number, except that it is independent of (hence independent of roots).
10. Approximation of Loss Probability in GI^{X}/Geo/c/S Using the Loss Formula
In finitebuffer queues, the loss probability is defined as the probability of a customer being rejected from the system. In the case of finitebuffer queues with bulkarrivals, an incoming batch of customers may be partially or totally rejected, depending on how close the number of customers in the system is to the finitebuffer immediately prior to a batcharrival. Gouweleeuw [13] and Gouweleeuw and Tijms [38] approximate the loss probability of a wide range of queueing models with general input such as BMAP/G/1/S and GI/G/1/S. In particular, while discussing the discretetime model GI^{X}/G/c/S, Gouweleeuw [13] states that “… an enormous amount of methods to calculate or approximate the loss probability of a customer in such a queueing system is present in the literature…. An overview is presented of those methods which explore the relation between the finitebuffer queue and its infinitebuffer counterpart.” From this statement, it is understandable that Gouweleeuw’s [13] main effort is in presenting an efficient and accurate approximation of loss probabilities using the steadystate queuelength distribution of the infinitebuffer counterpart.
The asymptotic loss probability is the loss probability as becomes a large integer. In discussing the asymptotic loss probability of GI^{X}/M/c/S, Kim and Choi [39] express the asymptotic loss probabilities of GI^{X}/M/c/S in terms of the roots of the model’s characteristic equation. They prove that there is exactly one positive real root (say ) that has the largest modulus among the roots. Kim and Choi [39] go further to claim that with its corresponding constant coefficient can accurately approximate the asymptotic loss probability, even for a moderately sized . By this claim, we can also accurately approximate the loss probability of GI^{X}/Geo/c/S (both total and partial rejections). Depending on whether the model involves EAS or LASDA, we can easily identify from (8) as well as and from Sections 3 and 6, respectively, and approximate the asymptotic loss probabilities of GI^{X}/Geo/c/S.
11. GI^{X}/Geo/c Involving HeavyTailed InterBatchArrival Times
The heavytailed distributions distinguish themselves from the lighttailed distributions by having a significantly slower rate of decay. In GI^{X}/Geo/c, a slow decaying arrivaltime distribution renders a very lengthy (or an infinite) mean interbatcharrival time that equates to a very small (or a zero) arrival rate . The arrival rate is directly proportional to , and as , the roots of the characteristic equation of GI^{X}/Geo/c tend towards the origin (see, e.g., Table 1) which was a concern to some researchers.

The heavytailed distributions are believed to impose another challenge on the roots method due to the nonclosed form of p.g.f.’s. While the lighttailed distributions have closed form of (see Table 2), this is not the case for Weibull, Standard LogNormal (SLN), and Pareto distributions. Moreover, directly solving (8) with an that follows the Pareto distribution with will consume a lengthy computing time (or not compute at all) due to the infinite series of a p.m.f. that decays at an extremely slow rate.
