Research Article  Open Access
Abdelhak Mezghiche, Lotfi Tadj, "Note on a Binomial Schedule for an M^{X}/G/1 Queueing System with an Unreliable Server", International Scholarly Research Notices, vol. 2013, Article ID 508045, 6 pages, 2013. https://doi.org/10.1155/2013/508045
Note on a Binomial Schedule for an M^{X}/G/1 Queueing System with an Unreliable Server
Abstract
We consider in this paper a batch arrival queueing system with an unreliable server. If the queue is empty at a service completion, then the server becomes inactive and begins an idle period. However, if the queue is not empty, then the server will take at most vacation before serving the next customer. A linear cost structure is developed for the system and the optimal value of is obtained.
1. Introduction
As mentioned by Hlynka [1], “the use of queueing theory in the analysis and management of computer and telecommunication systems has by now a lengthy history, with many important contributions in the design and analysis of such systems. There appear to be no signs of this letting up opportunities abound for queueing to aid in developments in wireless networking, cloud computing, social networking, and many other modern application areas.” The part of queueing theory concerned with the optimization of a queueing system is called the optimal design and control of queues. For a comprehensive survey of the research on this topic, see the book by Stidham [2] and the survey by Tadj and Choudhury [3].
The current paper presents yet another model that combines many known features to accommodate the increasingly complex computer networks and telecommunication systems. Meaningful and systematic scheduling requires sophisticated models to allocate the sometimes scarce available resources. Since most of these traits are standard and can be found in many papers, our review of the literature will make do with citations of surveys where the reader can find the relevant references.
The first feature of our model is the batch arrival process. Batch arrival models have been extensively used in an uncountable number of papers. A topical textbook is that of Chaudhry and Templeton [4].
The second feature of the model considered in this paper is that of an unreliable server. Indeed, a server, such as a machine, may break down while providing service. The service of the customer being served is then interrupted and cannot resume until the server is repaired. This is a very realistic assumption that models reallife situations. For a review of the research on this topic, the reader is referred to the broad survey of Tadj et al. [5].
Finally, the last characteristic of the model under consideration is that of a binomial vacation schedule. For a review of vacation queueing systems, see the comprehensive surveys of Doshi [6, 7]. In this class of queueing models, we find the models with Bernoulli vacation schedule where if the queue is empty at a service completion, then the server becomes inactive and begins an idle period. However, if the queue is not empty, the server will choose randomly to either take a vacation or process the next customer. If a vacation is chosen, it is followed by the service of the customer at the head of the queue. Various aspects of Bernoulli vacation models have been discussed by a number of authors; see the survey of Ke et al. [8]. In real life, the vacation period may be used by the server to perform some other activities such as a maintenance operation or a quality control or even attend another queue of customers.
However, since there are different activities, we may have the server take more than one vacation, for a maximum number of, say, vacations, instead of just one. Thus, we use in this paper the notion of a binomial vacation schedule. Under this policy, at a service completion and before serving the next customer, the server takes a series of vacations. The number of vacations is a binomial random variable. Each vacation has a random duration and corresponds to some auxiliary activity.
Having in mind the optimization of the queueing system, the decision variable will be the maximum number of vacations (auxiliary works) that the server should take before processing the next customer. That is, since we allow the server to take many vacations, what would the ideal number of vacations that will optimize the operations of the system be?
The rest of the paper proceeds as follows. The next section reviews some relevant results from a wellstudied queueing system, the M^{X}/G/1. Section 3 shows how to extend the results of Section 2 to our model. Section 4 is concerned with the design of the optimization of the system. Finally, Section 5 concludes the paper.
2. Review of M^{X}/G/1 Queueing Model
The M^{X}/G/1 is a wellstudied queueing system and its analysis is available in classical queueing textbooks; see for example Medhi [9]. We just recall here some of the results relevant to our study. Let denote the arrival rate. Customers arrive to the system in batches of random size . The batches are independent and identically distributed (iid) random variables with probability mass function , , probability generating function (pgf) , and moments , . The service times are iid random variables with common cumulative distribution function (CDF) , , LaplaceStieltjes Transform (LST) , , and moments , . We are assuming that the service process is independent of the arrival process. We use the following notation: : total number of customers in the system at any instance of time, : sequence of the successive departure times of individual units, , : total number of customers in the system at a customer departure time.
The imbedded process is a homogeneous Markov chain. Its transition probability matrix is a matrix; see Abolnikov and Dukhovny [10]. This fact can be used to derive the steadystate condition mentioned next. The process is a semiregenerative process relative to the sequence of stopping times, and is the corresponding imbedded Markov renewal process; see Çinlar [11]. The necessary and sufficient ergodicity condition is given by
Let the equilibrium probabilities be and . We are interested in the PGFs and . In the M^{X}/G/1 queueing system, Kendall’s formula, most often referred to as PollaczekKhinchin formula, is with
Also, which yields
For this queueing system, some performance measures are as follows.(a)The expected number of customers in the system at an arbitrary instance of time: (b)The expected length of an idle period of the server in the equilibrium: (c)The expected length of the busy in the equilibrium: (d)The expected length of the busy cycle:
3. Extension to M^{X}/G/1 Queueing System with an Unreliable Server and Binomial Vacation Schedule
It is interesting to note that, using a modified service time distribution, it is possible to obtain all the results of the M^{X}/G/1 queue with unreliable server and binomial vacation schedule (that we will call the new system) from the results of the classical M^{X}/G/1 queueing system. Similar change of variable is common and was recently used by Blanc [12].
Let us first describe the new system and define the notation used. While providing service, the server may break down and it is assumed that breakdowns occur according to a Poisson process with positive rate . When service interruption occurs, repair is provided with a random time, and as soon as the server is repaired, it immediately returns to provide this service until the queue is empty again. Service time is cumulative. This means that, on repair after an interruption, the service of the customer which was interrupted earlier is resumed from where it got interrupted and is not repeated from the very beginning. Let denote the duration of the repair time. Then, is distributed according to the CDF with LST and finite moments , .
To analyze this model, we introduce the modified service time , which includes the actual service time and possible repairs. Then, is distributed according to the CDF with LST and finite moments , . The modified service times, actual service times, and repair times are related through the following formula:
We also assume that the server implements the binomial vacation schedule, so that, at the end of a service, the server has the option to take vacations of random length with probability
Vacation times are distributed according to the CDF with LST and finite moments , . Let denote the duration of the generalized service time of a customer. Then, is distributed according to the CDF with LST and finite moments , . Now, since with probability the service required for a customer is then, we have where is given by (10). We are assuming that the input process and service and repair times random variables are mutually independent of each other.
We now want to generalize the results (1)–(5) to the new system. Let . Using (13), we find
Now, using (10), we have so that . Then, the necessary and sufficient ergodicity condition for the new system is given by
Let the equilibrium probabilities be and and let the PGFs be and . The results (2)–(5) are generalized to the new system as follows: with
Also, which yields
4. Optimal Management Policy
In order to design an optimal management policy for the service system, we first derive the relevant system characteristics.
4.1. System Characteristics
Using the results (6)–(9), we obtain the following performance measures.(a)The expected number of customers in the system at an arbitrary instance of time is given by where is found in (14), while is found from (13) as where is given by (15), while is derived from (10) as (b)The expected length of an idle period of the server in the equilibrium is given by (c)The expected length of the busy in the equilibrium is given by (d)The expected length of the busy cycle is given by Using (24)–(26), one can derive the following probabilities.(e)The probability that the server is idle, as expected: (f)The probability that the server is busy, as expected:
Once all the performance measures of the system are available, it is possible to use them in order to design an optimal management policy. The goal is to derive the threshold level that yields the minimum system cost. We derive next an expression for the cost function, and then illustrate on a numerical example how the management policy is designed.
4.2. Total Expected Cost per Unit of Time
In order to develop an optimal management policy for the system, it is customary to write an expression for the total expected cost per unit of time incurred by the system and then obtain the optimal value of the threshold parameter. In our case, the decision variable sought to minimize the cost function is , the maximum number of the server vacations. The total expected cost function per unit time is given by where is the holding cost per unit for each customer present in the system, is the cost per unit time for keeping the server on and in operation, is the startup cost per unit time for the preparatory work of the server before starting, and is the setup cost per busy cycle. Upon substitution using (21) and (24)–(26), we get where and are given by (14) and (22), respectively, and are functions of the decision variable . Let , , , , , , and . Then, (30) is rewritten as
4.3. Optimal Threshold Level
The firstorder optimality condition yields the critical value. Taking as a continuous variable and calculating the first derivative of the expected cost per unit of time with respect to , we find
Setting this expression to zero and solving for yields the two roots
The second optimality condition allows deciding which value should be chosen. The second derivative of the expected cost per unit of time with respect to is given by
Note that the sign of the second derivative is the same as the sign of . Direct substitution shows that yielding the maximum cost value, while yielding the minimum cost value. Therefore, the optimal threshold level is the integer closest to
4.4. Numerical Illustration
We present numerical computations to illustrate the analytical results obtained. We also perform some sensitivity analyses to assess the effect of some system parameters on the optimal values of the threshold and cost function. Let us assume that the distributions involved are exponential. We recall that, in this case, the second moment is equal to twice the square of the first moment. For the size of the batch arrival, let us assume that it follows the shifted geometric distribution , . Then, , , and . The illustrative system parameters chosen are listed in Table 1.

The variations of the total cost per unit of time as changes are decpited in Figure 1. The curve is perfectly convex. The optimal value of is and the optimal value of the total expected cost per unit of time is . Therefore, in order to optimize the system operations, for this specific set of values of the system parameters, the server should take at most 16 vacations to perform different auxiliary works before serving the next available customer.
The expressions of the optimal threshold level and the total expected cost per unit of time are quite complex, and it is difficult to assess analytically the effect of the system parameter on these quantities. However, sensitivity analysis can be performed for a specific set of values of the system parameters. For example, suppose that we are interested in the effect of the arrival process on the optimal management policy. This can be done numerically by changing the values of the arrival process parameter and keeping all other parameters at the base values listed in Table 1. Tables 2 and 3 show that the optimal expected cost increases as the batch arrival size parameter or the arrival rate increases; however, the optimal number of vacations decreases when increases and increases when increases.


5. Conclusion
We have considered in this paper a variant of the M^{X}/G/1 queueing system where the server may break down while providing service. Also, the server implements a binomial vacation policy. Using a suitable change of variable, we obtain from the M^{X}/G/1 performance measures for our queueing system. We then developed a linear cost structure and derived an expression for the optimal value of the maximum number of vacations the server should take at a service completion epoch before processing the next customer in line.
References
 M. Hlynka, “Myron Hlynka's Queueing Theory Page,” 2013, http://web2.uwindsor.ca/math/hlynka/queue.html. View at: Google Scholar
 S. Stidham, Jr., Optimal Design of Queueing Systems, CRC Press, Boca Raton, Fla, USA, 2009. View at: Publisher Site  MathSciNet
 L. Tadj and G. Choudhury, “Optimal design and control of queues,” Top, vol. 13, no. 2, pp. 359–412, 2005. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. L. Chaudhry and J. G. C. Templeton, A First Course in Bulk Queues, A WileyInterscience Publication, John Wiley & Sons, New York, NY, USA, 1983. View at: MathSciNet
 L. Tadj, G. Choudhury, and K. Rekab, “A twophase quorum queueing system with Bernoulli vacation schedule, setup, and Npolicy for an unreliable server with delaying repair,” International Journal of Services and Operations Management, vol. 12, no. 2, pp. 139–164, 2012. View at: Publisher Site  Google Scholar
 B. T. Doshi, “Single server queues with vacations,” in Stochastic Analysis of Computer and Communication Systems, H. Takagi, Ed., pp. 217–265, NorthHolland, Amsterdam, The Netherlands, 1990. View at: Google Scholar  Zentralblatt MATH  MathSciNet
 B. T. Doshi, “Queueing systems with vacations—a survey,” Queueing Systems: Theory and Applications, vol. 1, no. 1, pp. 29–66, 1986. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 J. C. Ke, C. H. Wu, and Z. G. Zhang, “Recent developments in vacation queueing models: a short survey,” International Journal of Operations Research, vol. 7, no. 4, pp. 3–8, 2010. View at: Google Scholar
 J. Medhi, Stochastic Models in Queueing Theory, Academic Press, Boston, Mass, USA, 1991. View at: MathSciNet
 L. Abolnikov and A. Dukhovny, “Markov chains with transition deltamatrix: ergodicity conditions, invariant probability measures and applications,” Journal of Applied Mathematics and Stochastic Analysis, vol. 4, no. 4, pp. 333–355, 1991. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 E. Çinlar, Introduction to Stochastic Processes, PrenticeHall, Englewood Cliffs, NJ, USA, 1975. View at: MathSciNet
 H. J. P. Blanc C, “M/G/1 Queues with postponed interruptions,” ISRN Probability and Statistics, vol. 2012, Article ID 653167, 12 pages, 2012. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Abdelhak Mezghiche and Lotfi Tadj. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.