Journal of Applied Mathematics

Volume 2013, Article ID 834731, 11 pages

http://dx.doi.org/10.1155/2013/834731

## A Discrete-Time Retrial Queue with Vacations and Two Types of Breakdowns

College of Science, North University of China, Taiyuan 030051, China

Received 12 July 2013; Revised 21 September 2013; Accepted 21 September 2013

Academic Editor: Ram N. Mohapatra

Copyright © 2013 Feng Zhang and Zhifeng Zhu. 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.

#### Abstract

This paper is concerned with a discrete-time retrial queueing model with vacations and two types of breakdowns. If the orbit is empty, the server takes at most vacations repeatedly until at least one customer appears in the orbit upon returning from a vacation. It is assumed that the server is subject to two types of different breakdowns and is sent immediately for repair. We analyze the Markov chain underlying the considered queueing system and derive the system state distribution as well as the orbit size and the system size distributions in terms of their generating functions. Then, we obtain some performance measures through the generating functions. Moreover, the stochastic decomposition property and the corresponding continuous-time queueing system are investigated. Finally, some numerical examples are provided to illustrate the effect of vacations and breakdowns on several performance measures of the system.

#### 1. Introduction

During the past few decades, retrial queueing systems have been widely studied due to their important applications in many practical systems such as inventory systems, computer systems, and telecommunication networks. Retrial queueing systems are characterized by the fact that arriving customers who find the server busy may join a retrial group to retry their requests after some random time. For excellent bibliographies on retrial queues, the readers are referred to [1–3].

Although many continuous-time retrial queueing models have been studied extensively in the past years, only few researchers studied the discrete-time retrial queues. In fact, the discrete-time retrial queueing systems are suitable for the description of the various phenomena in slotted time computer and communication systems such as broad-band integrated services digital network (B-ISDN) and time-division multiple access (TDMA) systems. Yang and Li [4] firstly studied a discrete-time retrial queue and obtained some performance measures of the systems. This work was generalized to discrete-time retrial queue with general retrial times by Atencia and Moreno [5]. In recent years, there has been a growing interest in the investigation of discrete-time retrial queue with server breakdowns. Such phenomena occur in day-to-day life, for example, the components of the computer and communication systems are subject to random breakdowns. Discrete-time retrial queues that take into account server breakdowns were studied by Atencia and Moreno [6, 7], Moreno [8], Wang and Zhao [9], Wang [10], Wang and Zhang [11], and Atencia et al. [12].

On the other hand, queueing systems with server vacations have been widely used to analyze the performance of some systems such as manufacturing systems and computer systems. In recent years, retrial queues with server vacations have drawn more and more attention. Li and Yang [13] studied a retrial queue with a finite number of input sources and Bernoulli vacations by the method of supplementary variables. Since the work of Li and Yang, the retrial queues with Bernoulli vacations have been studied by many authors, see Kumar and Arivudainambi [14], Kumar et al. [15], and Choudhury [16]. In addition, the retrial queues with exhaustive service vacations were also studied by several authors. For example, Artalejo [17] analyzed an retrial queue with multiple vacations and obtained two stochastic decomposition results for the system size. As a generalization of single and multiple vacation policy, Chang and Ke [18] and Ke and Chang [19] introduced the concept of vacations into retrial queueing systems. Ke and Chang [20] and Wu [21] studied the models concerning both server breakdowns and vacations, simultaneously.

The majority of articles studied the continuous-time retrial queues with server vacations. Most recently, Wang [22] extended the continuous-time retrial queue with Bernoulli vacations to discrete-time counterpart. Li et al. [23], Liu and Song [24] considered the discrete-time retrial queue with working vacation. Zhang et al. [25] studied a discrete-time retrial queue with single vacation and starting failure. To the best of our knowledge, no work appeared till now concerning the discrete-time retrial queue with exhaustive vacations policy and server’s different types of breakdowns. In fact, the discrete-time retrial queues with vacations and server breakdowns are more appropriate to analyze some real situations, such as e-mail systems, IP access networks, and computer systems. This motivates us to analyze the discrete-time retrial queue with vacations and and general retrial times. In this work, we consider a discrete-time retrial queue with vacations where the server may be subjected to two different types of breakdowns.

The rest of the paper is organized as follows. In Section 2, the description of our model is given. In Section 3, We derive the generating functions of the number of customers in the orbit and in the system. The closed-form expressions of some performance measures of the system are also obtained. In Section 4, we give two stochastic decomposition results for the system size. In Section 5, the relationship between our model and the continuous-time counterpart is given. In Section 6, we present some numerical results to show the influence of the parameters on some performance measures of the system.

#### 2. Description of the Mathematical Model

We consider a discrete-time retrial queue with vacations and two types of server breakdowns where the time axis is segmented into slots of equal length and all queueing activities occur at the slot boundaries. Specifically, let the time axis be marked by . Consider the epoch and assume that the departures, the end of the vacations and the end of repairs occur in the interval , while arrivals, retrials, the beginning of the vacations, and the beginning of repairs occur in the interval in sequence. That is, we consider an early arrival system (EAS) policy in our model.

Customers arrive at the system according to a geometrical arrival process with parameter , where () is the probability that an arrival occurs in a slot. If an arriving customer finds that the server is idle, he commences his service immediately. Otherwise, if the server is busy, under repair or on vacation, the arriving customer joins the retrial orbit. It is assumed that only the customer at the head of the orbit is permitted to access to the server. The time between retrials is assumed to follow a general probability distribution with the generating function .

The service times are independent and identically distributed with arbitrary distribution , generating function and th factorial moment . It is assumed that the server is subject to two different types of breakdowns. The first type of breakdown is starting failure. In this model, an arriving customer who finds the server idle must turn on the server. If the server is activated successfully (with a probability ), the customer begins his service immediately; otherwise, if the server is started unsuccessfully (with a complementary probability ), the server is sent to repair immediately and the customer being served must join the orbit. The second type of breakdown is normal breakdown, that is, the server may break down during serving customers. The customer just being served before breakdown waits until the server is repaired to complete his remaining service time. The lifetime of the server is assumed to be geometrically distributed with parameter . The repair times for the server of two types of breakdowns are independent and identically distributed with arbitrary distribution , generating functions , and th factorial moment are , , respectively.

As soon as the system is empty, the server takes a vacation immediately. The vacation time is assumed to follow a general probability distribution with generating function and th factorial moment . If there is at least one customer in the orbit at the end of a vacation, the server begins to provide service for customers immediately. Otherwise, if no customers appear in the orbit when the server returns from the vacation, it leaves for another vacation. This pattern continues until the server has taken a maximum number of vacations. If the system is empty at the end of the th vacation, the server becomes idle and waits for new arriving customers.

Finally, we assume that the interarrival times, the service times, the retrial times, the repair times and the vacation times are mutually independent.

#### 3. The Markov Chain and Some Performance Measures

At time , the system can be described by the process with , where denotes the state of the server and be the number of the customers in the orbit. It is assumed that , or 4 according to whether the server is free, busy, under repair for first type of breakdown, under repair for second type of breakdown, or on vacations, respectively. If , represents the remaining retrial time. If , represents the remaining service time of the customer currently being served. If , represents the remaining repair time for the first type of breakdown. If , represents the remaining service time of a customer currently being served and represents the remaining repair time of the second type of breakdowns. If , let represent that the server takes the th vacation and let represent the remaining vacation time, . It can be shown that is a Markov chain with the following state space:

Our object is to find the stationary distribution of the Markov chain which is defined as follows: The Kolmogorov equations for the stationary distribution of the system are where is the Kronecker’s symbol, , and the normalizing condition is To solve (3)–(10), we introduce the following generating functions: and the following auxiliary generating functions: Now, we can solve (3)–(10) by using the generating function technique. We first give some lemmas which will be used later on and their proof which can be readily obtained. Thus, they are omitted. The following inequalities hold.

Lemma 1. *If , then the inequality
**
holds for , where
*

Lemma 2. *The following limits exist, if **
where
*

By using Lemmas 1 and 2, we can obtain the generating functions of the stationary distribution of the system which are given by the following theorem.

Theorem 3. *If , the stationary distribution of the Markov chain has the following generating functions:
**
where
*

*Proof. *Multiplying (3)–(9) by and summing over , we get the following equations:
Multiplying (23) and (24) by , and summing over , we get
Setting in (25) and (26), we get
Substituting (27) and (28) into (25) and (26), respectively, we obtain
Taking the derivative of (29) with respective to , and letting , we get
Substituting (31) into (3), we get
Multiplying (19) by , summing over and taking into account (30)–(32), we obtain
Note that we can find by setting in (33), then multiplying (20) and (21) by , summing over , and taking into account (30)–(32), we obtain
where .

Multiplying (22) by and , summing over and , respectively, and taking into account (30)–(32), we obtain
Note that we can find by setting in (36) and substituting the expression of into (34), we get
Setting in (33), in (35), and in (37), respectively, we can get the equations for , and . By solving these equations, we get the the generating functions as follows:

Using Lemmas 1 and 2, it is easy to show that , , and are defined for and can be extended by continuity in , if . Now substituting (30)–(32) into (29), we can get . Similarly, substituting (38) into (33), (35)–(37) we derive , , and . Using the normalizing condition, we can find the unknown constant . This completes the proof.

Based on Theorem 3, we can easily obtain the marginal generating functions of the number of customers when the server is in various states and some performance measures. They are summarized in the following Corollary. Their proofs are very easy, and thus are omitted. For convenience, we define variable be the orbit size and be the system size.

Corollary 4. *(1)* The marginal generating function of the number of customers in the orbit when the server is idle or vacation is given by
*(2)** The marginal generating function of the number of customers in the orbit when the server is busy is given by
**(3)** The marginal generating function of the number of customers in the orbit when the server is under the first type of repair
**(4)** The marginal generating function of the number of customers in the orbit when the server is under the second type of repair
**(5)** The marginal generating function of the number of customers in the orbit when the server is on vacation is given by
**(6)** The generating function of the number of customers in the orbit is given by
**(7)** The probability generating function of the number of customers in the system is given by
*

Corollary 5. * **(1)* The system is idle with probability
*(2)** The probability that the server is free is
**(3)** The probability that the server is busy is
**(4)** The probability that the server is under the first type of repair is
**(5)** The probability that the server is under the second type of repair is
**(6)** The probability that the server is on vacation is
**(7)** The mean number of customers in the orbit is
where
**(8)** The mean number of customers in the system is
*

*Remark 6. *Consider some special cases as follows.(i) When , , our model becomes a discrete-time queue with general retrial times. In this case, reduces to
which coincides with results of the model studied by Atencia and Moreno [5].(ii) When , , the present model becomes a discrete-time queue with general retrial times and starting failure. In this case reduces to
(iii) When , our model becomes a discrete-time queue with vacations. In this case, reduces to
where

#### 4. Stochastic Decomposition

The property of stochastic decomposition was proposed firstly in queueing system with vacations. This property has also been studied for retrial queues with vacations by Artalejo [17]. The property of stochastic decomposition shows that the steady-state system size at an arbitrary point can be represented as the sum of two independent random variable, one of which is the system size of the corresponding queueing system without server vacations and the other is the orbit size given that the server is on vacations. In this section, we present two different stochastic decompositions of the system size distribution in our model.

Theorem 7. *The total number of customers in the system can be represented as the sum of two independent random variables . is the number of customers in the queue with server breakdowns and is the number of repeated customers given that the server is idle, under the first type of repair or on vacation.*

* Proof. *After some algebra operation, can be expressed by
where
is the generating function of the queue server with breakdowns, and
is the generating function given that the server is idle, under first type of repair or on vacations. This completes the proof.

Theorem 8. *The total number of customers in the system can be expressed as the sum of two independent random variables . is the number of customers in the queue with two types of breakdowns and is the number of repeated customers given that the server is idle or on vacation.*

* Proof. *After some algebra operation, can be expressed by
where
is the generating function of the unreliable queue, and
is the generating function given that the server is idle or on vacations. This completes the proof.

#### 5. Relationship to the Corresponding Continuous-Time Model

In this section, we investigate the relationship between our discrete-time model and the corresponding continuous-time counterpart. We consider a continuous-time general retrial queue with vacations and two types of breakdowns. The customers arrive according to a Poisson process with rate . If an arriving customer finds that the server is busy, under repair or on vacations, the customer joins the orbit and only the first customer in the orbit is permitted to retry for service. The server is subject to two types of different breakdowns. As soon as the server fails, it is repaired immediately. The first type of breakdown is starting failure, that is, an arriving customer must start the server, which takes negligible time and the server is started successfully with a probability . In addition to starting failure, the server may break down during serving an customer and the lifetime of the server follows exponential distribution with rate .

Once the system becomes empty, the server takes vacations immediately according to vacation policy. The retail times, the service times, the repair times for the two types of breakdowns and the vacation times are all assumed to follow general continuous-time distributions denoted by , , , , and , respectively, and their Laplace-Stieltjes transforms denoted by , , , , and , respectively, and their finite means are denoted by , and , , and respectively.

We suppose that the time is divided into sufficiently small intervals of equal length . Then, the continuous-time general retrial queue with vacations and two types of breakdowns can be approximated by the following: By using the definition of Lebesgue integration, we can get the following equalities: From the above relations, we obtain the generating function of the system size for the corresponding continuous-time model by

#### 6. Numerical Examples

In this section, we present some numerical examples to illustrate the effect of the parameters on the main performance measures of the system. We consider two important performance measures: the probability that server is on vacation and the mean orbit size . It is assumed that the retrial time is geometric distribution with generating function . The service time, the repair times of the server for the two types of breakdowns, and the vacation time are also assumed to follow geometric distribution with generating functions , , , and , respectively. In general, we have chosen the arrival rate , the retrial rate , the service rate , and the vacation rate , and we have presented three curves which correspond to , 0.3 and 0.5, respectively, in Figures 1–4, where is the probability that the server experience the first type of breakdown.

Figure 1 describes with varying values of the maximum number of the server's vacations . As illustrated in Figure 1, is increasing as a function of . For different values of , we observe that decreases with increasing values of . That is because the mean service time of a customer is getting longer with increasing values of and decreases accordingly. Figure 2 describes the effect of on . The curve in Figure 2 shows that is decreasing as a function of which agrees with intuitive expectations.

Figures 3 and 4 describe the influence of the parameter and on the mean orbit size , respectively. As to be expected, increases with increasing value of and , that is, there are more customers in the orbit as and increase.

As we can observe in Figures 3 and 4, the mean orbit size increases with increasing values of . As the the value of increases, the mean sojourn time time for an customer increases, and therefore the number of customers in the system increases. Moreover, the parameter affects more apparently, when the value of the parameter is getting greater.

#### Acknowledgments

This research is partially supported by the Youth Science Foundation of Shanxi Province (No. 2012021001-1).

#### References

- T. Yang and J. G. C. Templeton, “A survey of retrial queues,”
*Queueing Systems. Theory and Applications*, vol. 2, no. 3, pp. 201–233, 1987. View at Publisher · View at Google Scholar · View at MathSciNet - A. Gómez-Corral, “A bibliographical guide to the analysis of retrial queues through matrix analytic techniques,”
*Annals of Operations Research*, vol. 141, pp. 163–191, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. Falin, “A survey of retrial queues,”
*Queueing Systems. Theory and Applications*, vol. 7, no. 2, pp. 127–167, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. Yang and H. Li, “On the steady-state queue size distribution of the discrete-time $\mathrm{Geo}/G/1$ queue with repeated customers,”
*Queueing Systems. Theory and Applications*, vol. 21, no. 1-2, pp. 199–215, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - I. Atencia and P. Moreno, “A discrete-time $Geo/G/1$ retrial queue with general retrial times,”
*Queueing Systems. Theory and Applications*, vol. 48, no. 1-2, pp. 5–21, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - I. Atencia and P. Moreno, “A discrete-time $Geo/G/1$ retrial queue with server breakdowns,”
*Asia-Pacific Journal of Operational Research*, vol. 23, no. 2, pp. 247–271, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - I. Atencia and P. Moreno, “A discrete-time $Geo/G/1$ retrial queue with the server subject to starting failures,”
*Annals of Operations Research*, vol. 141, pp. 85–107, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Moreno, “A discrete-time retrial queue with unreliable server and general server lifetime,”
*Journal of Mathematical Sciences*, vol. 132, no. 5, pp. 643–655, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - J. Wang and Q. Zhao, “Discrete-time $Geo/G/1$ retrial queue with general retrial times and starting failures,”
*Mathematical and Computer Modelling*, vol. 45, no. 7-8, pp. 853–863, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Wang, “On the single server retrial queue with priority subscribers and server breakdowns,”
*Journal of Systems Science & Complexity*, vol. 21, no. 2, pp. 304–315, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Wang and P. Zhang, “A discrete-time retrial queue with negative customers and unreliable server,”
*Computers and Industrial Engineering*, vol. 56, no. 4, pp. 1216–1222, 2009. View at Publisher · View at Google Scholar · View at Scopus - I. Atencia, I. Fortes, and S. Sánchez, “A discrete-time retrial queueing system with starting failures, Bernoulli feedback and general retrial times,”
*Computers and Industrial Engineering*, vol. 57, no. 4, pp. 1291–1299, 2009. View at Publisher · View at Google Scholar · View at Scopus - H. Li and T. Yang, “A single-server retrial queue with server vacations and a finite number of input sources,”
*European Journal of Operational Research*, vol. 85, no. 1, pp. 149–160, 1995. View at Google Scholar · View at Scopus - B. K. Kumar and D. Arivudainambi, “The $M/G/1$ retrial queue with Bernoulli schedules and general retrial times,”
*Computers & Mathematics with Applications*, vol. 43, no. 1-2, pp. 15–30, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - B. K. Kumar, R. Rukmani, and V. Thangaraj, “An M/M/C retrial queueing system with Bernoulli vacations,”
*Journal of Systems Science and Systems Engineering*, vol. 18, no. 2, pp. 222–242, 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Choudhury, “A two phase batch arrival retrial queueing system with Bernoulli vacation schedule,”
*Applied Mathematics and Computation*, vol. 188, no. 2, pp. 1455–1466, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. R. Artalejo, “Analysis of an $M/G/1$ queue with constant repeated attempts and server vacations,”
*Computers & Operations Research*, vol. 24, no. 6, pp. 493–504, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F.-M. Chang and J.-C. Ke, “On a batch retrial model with $J$ vacations,”
*Journal of Computational and Applied Mathematics*, vol. 232, no. 2, pp. 402–414, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J.-C. Ke and F.-M. Chang, “Modified vacation policy for M/G/1 retrial queue with balking and feedback,”
*Computers and Industrial Engineering*, vol. 57, no. 1, pp. 433–443, 2009. View at Publisher · View at Google Scholar · View at Scopus - J.-C. Ke and F.-M. Chang, “${M}^{[x]}/{G}_{1},{G}_{2}/1$ retrial queue under Bernoulli vacation schedules with general repeated attempts and starting failures,”
*Applied Mathematical Modelling*, vol. 33, no. 7, pp. 3186–3196, 2009. View at Publisher · View at Google Scholar · View at Scopus - J. Wu and X. Yin, “An M/G/1 retrial G-queue with non-exhaustive random vacations and an unreliable server,”
*Computers & Mathematics with Applications*, vol. 62, no. 5, pp. 2314–2329, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Wang, “Discrete-time $Geo/G/1$ retrial queues with general retrial time and Bernoulli vacation,”
*Journal of Systems Science & Complexity*, vol. 25, no. 3, pp. 504–513, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. Li, Z. Wang, and Z. Liu, “Geo/Geo/1 retrial queue with working vacations and vacation interruption,”
*Journal of Applied Mathematics and Computing*, vol. 39, no. 1-2, pp. 131–143, 2012. View at Publisher · View at Google Scholar · View at MathSciNet - Z. Liu and Y. Song, “Geo/Geo/1 retrial queue with non-persistent customers and working vacations,”
*Journal of Applied Mathematics and Computing*, vol. 42, no. 1-2, pp. 103–115, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - F. Zhang, D. Q. Yue, and Z. F. Zhu, “A discrete time Geo/G/1 retrial queue with second multi-optional service and server vacation,”
*ICIC Express Letters*, vol. 6, pp. 1871–1876, 2012. View at Google Scholar