# Analysis of repairable Geo/G/1 queues with negative customers.

1. IntroductionAfter the introduction in the work of Gelenbe [1], there has been a rapid increase in the literature on queueing systems with negative customers due to their applications to neural networks, communication systems, and manufacturing systems. If a negative customer arrives at a queueing system, it removes one ordinary customer (called a positive customer) according to a predetermined removal discipline. There are two typical removal disciplines: (i) a negative customer removes the customer being served (RCH); (ii) a negative customer removes the customer who arrived most recently (RCE). The negative customers cannot accumulate in the queue and do not receive services. The negative customers have a rich and wide range of real applications such as job canceling signals accompanied by machine breakdowns [2], network routing control [3], and load balancing [4]. For example, if a certain virus enters a computer system, the virus interrupts system operations, deletes files, and infects other files. In telecommunication systems, the negative customers can be used to model cell losses caused by the arrival of a corrupted cell, when the preceding cells of a packet would be discarded.

The concept of the negative customer has been applied to the M/M/1 queue [5], the M/G/1 queue [6], and the GI/M/1 queue [7]. Excellent surveys on negative customers have been provided by Artalejo [8], Do [9, 10], and Gelenbe [11-13]. Recently, this topic has been extended to a discrete-time queueing system. Note that the discrete-time queue is more suitable to describe the operation of time-slotted digital communication systems due to the packetized nature of transport protocols. Atencia and Moreno [14] studied the Geo/Geo/1 queues with negative customers and various removal disciplines caused by the negative customers. Zhou [15] investigated the discrete-time GI/G/1 queue with RCH-type negative customers. Wang and Zhang [16] considered the Geo/Geo/1 retrial queue with negative customers and an unreliable server. Park et al. [17] obtained the results of the Geo/G/1 queue with negative customers and without repair times. Recently, Chae et al. [18] extended Atencia and Moreno's [14] Geo/Geo/1 queues to the GI/Geo/1 queues, where the interarrival times are generally distributed. The results of the queueing system with negative customers under the assumption of a Markovian arrival process can be found in Wu et al. [19, 20].

In most of the literature on queueing systems with negative customers, the server is assumed to be reliable on a permanent basis, regardless of the arrivals of negative customers. However, in many practical systems, the arrival of a negative customer can cause server breakdown as well as destruction of work in a system. For example, when a computer server is infected with a computer virus, a recovery time is needed to restore the server. Similarly, when a canceling signal for the job in progress arrives at a database server, a system cleaning time such as a rollback time for incomplete data operation may be needed. For this reason, we consider the Geo/G/1 queues with negative customers under the assumption that the server is repairable. Since the performance measure of such a system may be influenced by breakdown and repair time, the repairable system is well worth analyzing in view of queueing theory along with reliability theory.

There are few researches on repairable queueing systems with negative customers. Wang and Zhang [16] considered the Geo/Geo/1 retrial queue with negative customers and an unreliable server, where server breakdown occurs whenever negative customers arrive at a system. Lee et al. [21] presented the results of repairable Geo/G/1 queues with disasters, where if a disaster arrives at a system, all present customers (i.e., a customer in service plus customers in queue) are forced to leave the system. In [21], the authors considered a disaster as server failure which leads to the destruction of all work in process in a system. However, neither of them considered the case of repairable queueing systems with negative customers which cause server breakdown as well as canceling a single ordinary customer.

Systems under our study have following features. Positive customers arrive at a single server queue, according to a Bernoulli process. A server provides a service to each customer on an FCFS basis. The service times are independent and identically distributed (i.i.d.) random variables that are generally distributed. Negative customers arrive when the server is busy according to a Bernoulli process. Negative customers do not have an effect on the system if the server is idle or under repair. Each time a negative customer arrives at the system while the server is busy, the server fails and the customer in service leaves the system. At a failure epoch, the server is turned off and a repair period immediately begins. The server repair times are i.i.d. random variables that are generally distributed. During the repair period, the stream of new arrivals continues. Depending on whether new arrivals are allowed to enter the system during the repair time, there can be one of the two following systems. In System 1, the customers newly arriving during the repair period cannot enter the system and are blocked. This is the case when a virus-infected computer server is isolated from the network during the repair time without any backup server. In System 2, they join the queue and wait for the server to be repaired. This is the case when a backup server just stores requests during the repair time and passes them to the original server when it is recovered. As soon as the repair period ends, the server promptly becomes available. Both Systems 1 and 2 have RCH discipline. For each system, using the probability generating function (PGF) technique, we present PGFs of the system size distribution and the sojourn time distribution.

In this paper, we first describe the mathematical model in Section 2. In Sections 3 and 4, general results on the system size and the sojourn time of System 1 and System 2 are presented. Section 5 deals with numerical experiments which we conducted to investigate the influence of the arrival of negative customers on the mean system size of each system.

2. Model Description

Throughout this paper, we adopt the late arrival system (LAS) [22]. Let the time axis be marked by t = 0, 1, 2, According to the LAS model, the potential arrival of a positive customer takes place during the interval ([t.sup.-], t) and the potential service completion occurs during the interval (t, [t.sup.+]), where [t.sup.+] and [t.sup.-] represent [lim.sub.[DELTA]t[right arrow]0] (t + [absolute value of [DELTA]t]) and [lim.sub.[DELTA][right arrow]0] (t - [absolute value of [DELTA]t]), respectively. Since the arrivals of a positive customer and a negative customer can occur simultaneously at a slot boundary, the order of these events must be stated. We assume that the potential arrival of a negative customer occurs during the interval ([t.sup.-], t) and immediately before the potential arrival of a positive customer. We also assume that the potential completion of a repair time occurs during the interval ([t.sup.-], t) and immediately before the potential arrival of a positive customer. We further assume that a negative customer arrival and a repair completion do not occur at the same slot boundary simultaneously.

We define commonly used notations to analyze both Systems 1 and 2. Interarrival times of positive customers [{[A.sub.n]}.sup.[infinity].sub,.n=1] are i.i.d. discrete random variables and follow a geometric distribution with parameter [lambda]:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (1)

Interarrival times of negative customers [{[Y.sub.n]}.sup.[infinity].sub.n=1] are i.i.d. discrete random variables and follow a geometric distribution with parameter [eta]:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (2)

Service times [{[S.sub.n]}.sup.[infinity].sub.n=1] are i.i.d. general discrete random variables. A distribution and its PGF are denoted by Pr{[S.sub.n] = k} = [s.sub.k] (k [greater than or equal to] 1) and S(z) = [[summation].sup.[infinity].sub.k=1] [s.sub.k][z.sup.k], respectively. Repair times [{[R.sub.n]}.sup.[infinity].sub.n=1] are i.i.d. general discrete random variables and have the distribution Pr{[R.sub.n] = k} = [r.sub.k] (k [greater than or equal to] 1) and its PGF R(z) = [[summation].sup.[infinity].sub.k=1] [r.sub.k][z.sup.k]. We assume that [{[A.sub.n]}.sup.[infinity].sub.n=1], [{[Y.sub.n]}.sup.[infinity].sub.n=1], [{[S.sub.n]}.sup.[infinity].sub.n=1], and [{[R.sub.n]}.sup.[infinity].sub.n=1] are mutually independent.

Systems 1 and 2 are represented by a Markov chain. Let N([t.sup.+]) be the number of customers in the system at [t.sup.+]. Let [xi]([t.sup.+]) be the server state at [t.sup.+] and be defined as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (3)

Then, in both System 1 and System 2, {N([t.sup.+]), [xi]([t.sup.+]), [S.sub.R]([t.sup.+]), [R.sub.R] ([t.sup.+]), t = 0, 1, ...} is a Markov chain, where the supplementary variables [S.sub.R] ([t.sup.+]) and [R.sub.R] ([t.sup.+]), respectively, represent the remaining service time and the remaining repair time all at [t.sup.+]. One of our main purposes is to obtain the stationary distribution:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (4)

Since we are interested in the steady-state behavior of the systems, we employ the following limiting probabilities throughout this paper to manipulate the Kolmogorov equations of the Markov chain:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (5)

To solve the Kolmogorov equations, we introduce PGFs:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (6)

3. System 1

In System 1, newly arriving customers are blocked when the server is under repair.

3.1. System Size Distribution for System 1. With the limiting probabilities defined in Section 2, the Kolmogorov equations for the stationary distribution are given by

[[psi].sub.n] (k) = [[psi].sub.n] (k + 1) + [eta][[pi].sub.n+1] [r.sub.k], n [greater than or equal to] 0, (7)

[[pi].sub.0] = ([[psi].sub.0] (1) + [[pi].sub.0] + [bar.[eta]] [[pi].sub.1] (1) [bar.[lambda]], (8)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (9)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (10)

and the normalizing condition is given by

[[pi].sub.0] + [[PSI].sup.*](1, 1) + [[PI].sup.*](1, 1) = 1. (11)

Multiplying (7) by [z.sup.n] and summing over n, n [greater than or equal to] 0, we obtain

[PSI](z, k) = [PSI] (z, k+ 1) + [eta][r.sub.k] [z.sup.-1][[PI].sup.*] (z, 1). (12)

Multiplying (12) by [w.sup.k] and summing over k, k [greater than or equal to] 1, yield

[[PSI].sup.*] (z, w)(1 - [w.sup.-1]) = [eta][z.sup.-1] R(w) [[PI].sup.*] (z, 1) - [PSI] (z, 1). (13)

To obtain [PSI] (z, 1), we insert w = 1 into (13). Thus,

[PSI] (z, 1) = [eta][z.sup.-1] [[PI].sup.*] (z, 1). (14)

Incorporating (14) back into (13) then yields

[[PSI].sup.*] (z, w) = [[eta]w(R(w) - 1)/z(w - 1)] [[PI].sup.*] (z, 1). (15)

Letting w = 1 in (15), we obtain the following relationship by the L'Hospital rule:

[[PSI].sup.*] (z, 1) = [eta]E[R][z.sup.-1] [[PI].sup.*] (z,1). (16)

Multiplying (9) and (10) by [z.sup.n] and then summing over n, n [greater than or equal to] 1, together with (8), we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (17)

where [[omega].sub.0] = [bar.[lambda]] + [lambda]z and [[omega].sub.1] = [bar.[eta]]([bar.[lambda]] + [lambda]z). Multiplying (17) by [w.sup.k] and summing over k, k [greater than or equal to] 1, yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (18)

Inserting w = [[omega].sub.1] into (18) and solving [PI](z, 1), we obtain

[PI](z, 1) = zS([[omega].sub.1])[[[pi].sub.0] [lambda](1 - z) - [[omega].sub.0] [PSI] (z, 1)]/[[omega].sub.1](S([[omega].sub.1]) - z). (19)

Utilizing (14) and (19) in (18), [[PI].sup.*] (z, w) is represented as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (20)

By inserting w = 1 into (20), it follows that

[[PI].sup.*] = [[pi].sub.0] [lambda]z(1 - z)(1 - S([[omega].sub.1]))/[eta][[omega].sub.0](1 - S([[omega].sub.1])) + (1 - [[omega].sub.1]) (S([[omega].sub.1]) - z). (21)

Let P(z) denote the PGF of the system size distribution. From (16) and (21), we can obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (22)

where [[pi].sub.0] = ([eta] - [lambda](1 - S([bar.[eta]])))/[eta][1 + [lambda]E[R](1 - S([bar.[eta]]))] by the normalizing condition (11).

Differentiating (22) with respect to z and taking limit z [right arrow] 1 lead to the mean system size given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (23)

where S'(z) = dS(z)/dz in (23).

Remark 1. System 1 is stable if and only if [absolute value of P(z)] < [infinity] for [absolute value of z] [less than or equal to] 1. The denominator of P(z) for System 1 can be written as (1 - [[omega].sub.1])(A(z) - z), where

Az = [eta][[omega].sub.0] + (1 - [[omega].sub.0]) S([[omega].sub.1])/[1 - [[omega].sub.1]]. (24)

Here, (1 - [[omega].sub.1]) has no zeros for [absolute value of z] [less than or equal to] 1. By Rouche's theorem, A(z) - z also has no zeros for [absolute value of z] [less than or equal to] 1 if and only if dA(z)/dz[|.sub.z=1] < 1. Thus, the necessary and sufficient condition for the stability of System 1 is [lambda] < [eta][(1 - S([bar.[eta])).sup.-1].

3.2. Sojourn Time Distribution for System 1. We derive the PGF of the sojourn time of a test customer (TC) under the FCFS discipline for System 1, regardless of whether or not its service is interrupted by a negative customer. The sojourn time is defined as the sum of the queue waiting time and the service time. We do not take blocked customers' sojourn times into consideration because they are equal to 0.

Let us define the actual service time as the actual amount of service time that a TC receives before departing the system either by a service completion or by a negative customer. Let [S.sub.a] and [S.sub.a](z), respectively, denote the actual service time and its PGF under our assumption. Then, we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (25)

We further define the modified service time as the virtual service time, including a time to repair. Since a repair period follows each time a negative customer arrives, from the point of view of a TC, the modified service times can be regarded as service times of the customers who arrive prior to a TC. Let [S.sub.b] and [S.sub.b](z), respectively, denote the modified service time and its PGF under our assumption. Then, we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (26)

Since we assumed that during a slot the potential arrival of a negative customer and a repair completion occur immediately before the potential arrival of a positive customer, a TC's arrival which occurs during ([t.sup.-], t) may belong to one of the following cases.

Case 1. A TC arrives finding the server is idle. Then, the TC's service is immediately started.

Case 2. A TC arrives at a slot during which a repair completion occurs. Then, the waiting time of the TC is the total service time of the customers who are in the queue on the arrival of the TC because the repair has just been completed.

Case 3. A TC arrives at a slot during which the server is busy and a negative customer does not arrive. Then, the waiting time of the TC is the total service time of the customers who are in the queue on the arrival of the TC, plus the remaining modified service time of the customer in service.

In other cases, a positive customer is blocked, and we do not take blocked customers into consideration for waiting time distribution. Let [W.sub.q,i] denote the waiting time of a TC that arrives in case i, i = 1, 2, 3, and define [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. From Case 1, we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (27a)

Case 2 yields

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (27b)

From Case 3, we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (27c)

Let [W.sub.q] denote the unconditional waiting time of a TC. Combining (27a), (27b), and (27c) with (14), we have [W.sub.q](z) given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (28)

where [P.sub.R] = [lambda]E[,R](1 - S([bar.[eta]]))/(1 + [lambda]E[R](1 - S([bar.[eta]]))), which denotes the probability that the arrival of a positive customer is blocked.

Remark 2. Now that we deal with the Bernoulli arrival process queueing system, BASTA property [22] is employed to derive [W.sub.q,i] (z).

Let W be a TC's sojourn time. As [W.sub.q] and [S.sub.a] are independent, we finally obtain

W(z) = [W.sub.q](z) x [S.sub.a](z), (29)

which leads to the mean sojourn time given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (30)

Remark 3. Equations (23) and (30) confirm the result of Little's law: L = [[lambda].sub.e] E [W], where the effective arrival rate [[lambda].sub.e] = [lambda](1 - [P.sub.R]).

Remark 4. Since [P.sub.R] is the blocking probability of a positive customer, the service canceling probability [P.sub.C] of a positive customer is given by [P.sub.C] = (1 - [P.sub.R])(1 - S([bar.[eta]])) because a service-canceled positive customer first enters the system without blocking and then a negative customer arrives before the completion of the service of the service-canceled positive customer.

4. System 2

In System 2, newly arriving customers enter the system while the server is under repair. They receive their service after repair.

4.1. System Size Distribution for System 2. With the limiting probabilities defined in Section 2, the Kolmogorov equations that govern System 2 can be written as follows:

[[psi].sub.0](k) = [[psi].sub.0](k + 1)[bar.[lambda]] + [eta][[pi].sub.1][bar.[lambda]][r.sub.k], (31)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (32)

[[pi].sub.0] = ([[psi].sub.0] (1) + [[pi].sub.0] + [bar.[eta]] [[pi].sub.1] (1))[bar.[lambda]], (33)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (34)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (35)

and the normalizing condition is given by

[[pi].sub.0] + [[PSI].sup.*] (1, 1) + [[PI].sup.*] (1, 1) = 1. (36)

Multiplying (31) and (32) by [z.sup.n] and summing over n, n [greater than or equal to] 0, we obtain

[PSI] (z, k) = [[omega].sub.0] ([PSI] (z, k + 1) + [eta][r.sub.k] [z.sup.-1] [[PI].sup.*] (z, 1)), (37)

where [[omega].sub.0] = [bar.[lambda]] + [lambda]z. Multiplying (38) by [w.sup.k] and summing over k, k [greater than or equal to] 1, yield

[[PSI].sup.*] (z, w)(1 - [w.sup.-1] [[omega].sub.0]) = [[omega].sub.0]([eta][z.sup.-1]R(w) [[PI].sup.*] (z, 1) - [PSI] (z, 1)). (38)

Inserting w = [[omega].sub.0] into (38) and solving [PSI] (z, 1), we obtain

[PSI] (z, 1) = [eta][z.sup.-1] R([[omega].sub.0]) [[PI].sup.*] (z, 1). (39)

Substituting (39) into (38) results in

[[PSI].sup.*] (z, w) = [[eta]w[[omega].sub.0] (R(w) - R([[omega].sub.0]))/z(w - [[omega].sub.0])] [[PI].sup.*] (z, 1). (40)

Letting w = 1 in (40), we obtain the relationship

[[PSI].sup.*] (z, 1) = [[eta]w[[omega].sub.0] (1 - R([[omega].sub.0]))/z(1 - [[omega].sub.0])] [[PI].sup.*] (z, 1). (41)

Multiplying (34) and (35) by [z.sup.n] and then summing over n, n [greater than or equal to] 1, together with (33), we obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (42)

where [[omega].sub.1] = [bar.[eta]] ([bar.[lambda]] + [lambda]z). Multiplying (42) by [w.sup.k] and summing over k, k [greater than or equal to] 1, yield

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (43)

To solve [PI](z, 1), we insert w = [[omega].sub.1] into (43). Thus, we have

[PI](z, 1) = xS([[omega].sub.1])[[[pi].sub.0] [lambda](1 - z) - [[omega].sub.0] [PSI](z, 1)]/[[omega].sub.1](S([[omega].sub.1]) - z). (44)

Using (39) and (44) in (43), [[PI].sup.*] (z, w) is represented as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (45)

By inserting w = 1 into (45), it follows that

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (46)

Let P(z) denote the PGF of the system size distribution. From (41) and (46), we can obtain

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (47)

where [[pi].sub.0] = ([eta] - [lambda](1 + [eta]E[R])(1 - S([bar.[eta]])))/[eta] by the normalizing condition (36).

Differentiating (47) with respect to z and taking limit z [right arrow] 1 lead to the mean system size given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (48)

Remark 5. The denominator of P(z) for System 2 can be written as (1 - [[omega].sub.1])(B(z) - z), where

B(z) = [eta][[omega].sub.0]R([[omega].sub.0]) + (1 - [[omega].sub.1] - [eta][[omega].sub.0]R([[omega].sub.0])) S([[omega].sub.1])/[1 - [[omega].sub.1]]. (49)

Similar to Remark 1, for the stability of System 2, the following inequality is the necessary and sufficient condition under which steady-state solution exists: [lambda] < [eta][[(1 + [eta]E[R])(1 - S([bar.[eta]]))].sup.-1].

4.2. Sojourn Time Distribution for System 2. We derive the PGF of the FCFS sojourn time of a TC for System 2. The method used in this section is much simpler than that used in Section 3.2. The PGF of the waiting time for the standard Geo/G/1 queue is known to be [22]

c(1 - z)/[1 - z - [lambda] + [lambda]S(z)], (50)

where c is a normalizing constant. We first replace S(z) in (50) with [S.sub.b](z) in (27a), (27b), and (27c). Then, c is determined by normalization. Applying this procedure, [W.sub.q](z) is given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (51)

where c = ([eta] - [lambda](1 + [eta]E[R])(1 - S([bar.[eta]])))/[eta]. Since [W.sub.q] and [S.sub.a] are independent, we have W(z) as

W(z) = [W.sub.q](z) x [S.sub.a](z), (52)

which leads to the mean sojourn time given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (53)

Remark 6. Equations (48) and (53) confirm the result of Little's law: L = [lambda]E[W].

Remark 7. The service canceling probability [P.sub.C] of a positive customer is given by [P.sub.C] = 1 - S([bar.[eta]]) because a negative customer arrives before the completion of the service of a service-canceled positive customer.

5. Numerical Examples

The purpose of this section is to study the influence of negative customer arrival on the mean system size and the service canceling probability of both System 1 and System 2. We also investigate the influence of the type of the repair time distribution on the mean system size. In every example, positive customers arrive at a system, according to a Bernoulli process at a rate of 0.1. We consider three types of service time distributions: a geometric distribution, a negative binomial distribution, and a mixture of two different geometric distributions. Specifically, for the geometric case, the probability mass function (PMF) of the service time is defined by

[s.sub.k] = (1/8) [(7/8).sup.k-1], k = 1, 2, .... (54)

For the negative binomial case, the PMF of the service time is defined by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (55)

For the geometric mixture case, the PMF of the service time is defined by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (56)

The above three service times have a common mean of 8. The coefficients of variation are, respectively, 0.94,0.35, and 2 for the geometric, negative binomial, and geometric mixture cases.

Similarly, the repair time distributions are assumed to follow one of the three distributions. For the geometric case, the PMF of the repair time is defined by

[r.sub.k] = (1/5)[(4/5).sup.k-1], k = 1, 2, .... (57)

For the negative binomial case, the PMF of the repair time is defined by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (58)

For the geometric mixture case, the PMF of the repair time is defined by

[r.sub.k] = 7/10 (3/20) [(17/20).sup.k-1] + 3/10 (9/10)[(1/10).sup.k-1], k = 1, 2, .... (59)

While these three repair times have a common mean of 5, their coefficients of variation are, respectively, 0.89, 0.55, and 1.15 for the geometric, negative binomial, and geometric mixture cases.

In Figures 1, 2, and 3, the mean system sizes and the service canceling probabilities of both System 1 and System 2 are shown as functions of [eta] when the repair time follows a negative binomial distribution.

Figures 1 to 3 confirm that the mean system sizes of both System 1 and System 2 decrease as [eta] increases. Furthermore, for all cases, the mean system size of System 2 is greater than the mean system size of System 1 as expected. This is obvious because, in System 2, customers newly arriving during the repair period join the queue and wait for the server to be repaired without leaving the system. We also verify that the service canceling probabilities of both System 1 and System 2 increase as [eta] increases and the service canceling probability of System 2 is greater than that of System 1 for all cases. This is because, in System 1, the arrival of a positive customer can be blocked.

Second, we investigate the tendencies of the mean system size of System 2 by varying the repair time distributions. In Figure 4, the mean system size of System 2 is shown as a function of [eta] when the service time follows the negative binomial distribution.

As shown in Figure 4, for all three different distributions of repair times, as [eta] increases, the mean system sizes decrease. Moreover, for all values of [eta], the higher the coefficient of variation is, the greater the mean system size is. The overall results in this section confirm that the mean system size is a decreasing function of [eta].

6. Conclusion

We considered two repairable Geo/G/1 queueing systems with negative customers, in which a negative customer arrival causes the customer in service to leave the system and the server to fail. At a failure epoch, the repair process immediately begins. Those arriving during the repair period are blocked in System 1, while they remain in System 2. For these systems, we derived some important results of system characteristics such as the PGFs of the system sizes and FCFS sojourn times. Finally, some numerical examples were performed to illustrate the influence of the negative customer arrival rate on the systems. Our research presents an extension of the discrete-time repairable queueing model and the analysis of the model may provide a decision making tool for repair policies arising in many practical systems.

For further studies, we can extend this model to more complex situations such as the discrete-time repairable queueing systems with the phase type arrival process of either positive customers or negative customers.

http://dx.doi.org/10.1155/2014/350621

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

[1] E. Gelenbe, "Random neural networks with negative and positive signals and product form solution," Neural Computation, vol. 1, no. 4, pp. 502-510, 1989.

[2] R. J. Boucherie and O. J. Boxma, "The workload in the M/G/1 queue with work removal," Probability in the Engineering and Informational Sciences, vol. 10, no. 2, pp. 261-277, 1996.

[3] C. Morfopoulou, "Network routing control with G-networks," Performance Evaluation, vol. 68, no. 4, pp. 320-329, 2011.

[4] 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.

[5] P. G. Harrison and E. Pitel, "Sojourn times in single-server queues with negative customers," Journal of Applied Probability, vol. 30, no. 4, pp. 943-963, 1993.

[6] P G. Harrison and E. Pitel, "The M/G/1 queue with negative customers," Advances in Applied Probability, vol. 28, no. 2, pp. 540-566, 1996.

[7] W. S. Yang and K. C. Chae, "A note on the GI/M/1 queue with Poisson negative arrivals," Journal of Applied Probability, vol. 38, no. 4, pp. 1081-1085, 2001.

[8] J. R. Artalejo, "G-networks: a versatile approach for work removal in queueing networks," European Journal of Operational Research, vol. 126, no. 2, pp. 233-249, 2000.

[9] T. V. Do, "An initiative for a classified bibliography on G-networks," Performance Evaluation, vol. 68, no. 4, pp. 385-394, 2011.

[10] T. V Do, "Bibliography on G-networks, negative customers and applications," Mathematical and Computer Modelling, vol. 53, no. 1-2, pp. 205-212, 2011.

[11] E. Gelenbe, "Product-form queueing networks with negative and positive customers," Journal of Applied Probability, vol. 28, no. 3, pp. 656-663, 1991.

[12] E. Gelenbe, "G-networks: a unifying model for neural and queueing networks," Annals of Operations Research, vol. 48, no. 5, pp. 433-461, 1994.

[13] E. Gelenbe, "The first decade of G-networks," European Journal of Operational Research, vol. 126, no. 2, pp. 231-232, 2000.

[14] I. Atencia and P Moreno, "A single-server G-queue in discrete-time with geometrical arrival and service process," Performance Evaluation, vol. 59, no. 1, pp. 85-97, 2005.

[15] W. H. Zhou, "Performance analysis of discrete-time queue GI/G/1 with negative arrivals," Applied Mathematics and Computation, vol. 170, no. 2, pp. 1349-1355, 2005.

[16] 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.

[17] H. M. Park, W. S. Yang, and K. C. Chae, "The Geo/G/1 queue with negative customers and disasters," Stochastic Models, vol. 25, no. 4, pp. 673-688, 2009.

[18] K. C. Chae, H. M. Park, and W. S. Yang, "A GI/Geo/1 queue with negative and positive customers," Applied Mathematical Modelling, vol. 34, no. 6, pp. 1662-1671, 2010.

[19] J. Wu, Z. Liu, and Y. Peng, "On the BMAP/G/1 G-queues with second optional service and multiple vacations," Applied Mathematical Modelling, vol. 33, no. 12, pp. 4314-4325, 2009.

[20] J. Wu, Z. Liu, and G. Yang, "Analysis of the finite source $MAP/ PH/N$ retrial $G$-queue operating in a random environment," Applied Mathematical Modelling: Simulation and Computation for Engineering and Environmental Systems, vol. 35, no. 3, pp. 1184-1193, 2011.

[21] D. H. Lee, W. S. Yang, and H. M. Park, "Geo/G/1 queues with disasters an d general repair times," Applied Mathematical Modelling, vol. 35, no. 4, pp. 1561-1570, 2011.

[22] H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation. Vol. 3, North-Holland, Amsterdam, The Netherlands, 1993.

Doo Ho Lee (1) and Kilhwan Kim (2)

(1) Software Contents Research Lab, ETRI, Daejeon 305-700, Republic of Korea

(2) Department of Management Engineering, Sangmyung University, Chungnam 330-720, Republic of Korea

Correspondence should be addressed to Doo Ho Lee; enjdhlee@gmail.com

Received 3 September 2014; Accepted 8 December 2014; Published 24 December 2014

Academic Editor: Kannan Krithivasan

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Lee, Doo Ho; Kim, Kilhwan |

Publication: | Journal of Applied Mathematics |

Article Type: | Report |

Date: | Jan 1, 2014 |

Words: | 5315 |

Previous Article: | On the minimum cable tensions for the cable-based parallel robots. |

Next Article: | An extended cellular automaton model for train traffic flow on the dedicated passenger lines. |

Topics: |