Research Article  Open Access
Jiang Cheng, Yinghui Tang, Miaomiao Yu, "The DiscreteTime BulkService Geo/Geo/1 Queue with Multiple Working Vacations", Journal of Applied Mathematics, vol. 2013, Article ID 587269, 10 pages, 2013. https://doi.org/10.1155/2013/587269
The DiscreteTime BulkService Geo/Geo/1 Queue with Multiple Working Vacations
Abstract
This paper deals with a discretetime bulkservice queueing system with infinite buffer space and multiple working vacations. Considering an early arrival system, as soon as the server empties the system in a regular busy period, he leaves the system and takes a working vacation for a random duration at time . The service times both in a working vacation and in a busy period and the vacation times are assumed to be geometrically distributed. By using embedded Markov chain approach and difference operator method, queue length of the whole system at random slots and the waiting time for an arriving customer are obtained. The queue length distributions of the outside observerâ€™s observation epoch are investigated. Numerical experiment is performed to validate the analytical results.
1. Introduction
Recently there has been a rapid increase in the literature on discretetime queueing system with working vacations. These queueing models have been studied extensively and applied to computer networks, communication systems, and manufacturing systems. In the classical queueing system with server vacations, the server stops working during vacation periods. Suppose, however, that a system can be staffed with a substitute server during the times the main server is taking vacations. The service rate of the substitute server is different from (and probably lower than) that of the main server. This is the notion of working vacations recently introduced by Servi and Finn [1]. They studied an queue with multiple working vacations . Their work is motivated by the analysis of a reconfigurable wavelengthdivision multiplexing (WDM) optical access network. In 2006, Wu and Takagi [2] generalized Servi and Finnâ€™s queue to an queue. Baba [3] extended Wu and Takagiâ€™s work to a renewal input queue with working vacations and derived the steadystate system length distributions at an arrival and arbitrary epochs. The queue with single and multiple working vacations have been discussed in Li and Tian [4] and Tian et al. [5], respectively. Chae et al. [6] studied the queue and queue with single working vacation (SWV). The discretetime infinite buffer queue with multiple working vacations and vacation interruption has been studied in Li et al. [7, 8]. The discretetime finite buffer queue with multiple working vacations has been discussed by Goswami and Mund [9]. All the above studies on discretetime single server queues have been carried out under the assumption that a server serves singly at a time. However, there are many instances where the servers are carried out in batches to enhance the performance of the system. Over the last several years the discretetime single server queues in batch service without vacations have been studied in Gupta and Goswami [10], Chaudhry and Chang [11], Alfa and He [12], and Yi et al. [13]. Lately, This type of queueing systems raise interest once more by many scholars such as Banerjee et al. [14, 15], Claeys et al. [16, 17].
The continuoustime infinite buffer single server batch service queue with multiple vacations has been analyzed by Choi and Han [18], Chang and Takine [19]. The queue with bulk service and single vacation has been investigated by Sikdar and Gupta [20].
As to the research to queueing systems with batch service and working vacations (or vacation), Yu et al. [21] considered a finite capacity and bulkarrival and bulkservice continuoustime queueing system with multiple working vacations and partial batch rejection. Vijaya Laxmi and Yesuf [22] studied a renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches. Goswami and Mund [23] investigated a discretetime batch service renewal input queue with multiple working vacations. Note that although all the above studies on discretetime bulkservice queues have been carried out, but, from their models, we can only obtain the average length of the waiting for service; the average length of the whole system cannot be obtained at prearrival, arbitrary and outside observerâ€™s observation epochs. In fact, the number of customers being served in batches is a random variable; it is difficult to compute the average length of the whole system.
This paper focuses on a discretetime batchservice infinite buffer queueing system with multiple working vacations in which arrivals occur according to a geometrical input. By using embedded Markov chain approach, we obtained the operation rules of the onestep transition probability matrix, the average length at random slots, and the average waiting time for an arriving customer. This model has potential applications in computer networks where jobs are processed in batches.
The rest of the paper is arranged as follows. In the next section, the model of the considered queueing system is described. In Section 3, the stationary distribution of queue length at arbitrary slot epochs is discussed. In Section 4, we study the waiting time distribution. In Section 5, we discuss the outside observerâ€™s observation epoch probabilities distribution. In Section 6, some numerical results and the sensitivity analysis of this system are given. Section 7 concludes this paper.
2. System Description
We consider a discretetime bulkservice infinite buffer space queueing system with server multiple working vacations according to the rule of an early arrival system. Assume that the time axis is slotted into intervals of equal length with the length of a slot being unity, and it is marked as , a potential arrival occurs in the interval and potential batch departures occur in . In the meantime, the interarrival times of customers are independent and geometrically distributed with probability mass function (p.m.f.) .
The customers are served in batches of variable capacity, the maximum service capacity for the server being . Service times during normal busy period and service times during a working vacation are assumed independent and geometrically distributed with p.m.f. and p.m.f. , respectively. A new arriving customer cannot go into the queue being served immediately in spite of the working vacation period and the normal busy period. The server leaves the system and takes a working vacation at epoch as soon as system becomes empty in regular period. The working vacation time follows a geometric distribution with parameter and its p.m.f. is . If there are some customers being served after the server finishes a working vacation, the service interrupted at the end of a vacation is lost and it is restarted with service rate at the beginning of the following service period, which means that the regular busy period starts. The various time epochs at which events occur are depicted in Figure 1.
We assume that interarrival times, service times, and working vacation times are mutually independent.
In addition, the service discipline is first in first out (FIFO). Let be the number of customers in the system at time , and Then is a Markov chain with the state space where state ,â€‰â€‰ indicates that the system is in a regular busy period; state ,â€‰â€‰ indicates that the system is in a working vacation period and there customers in the system.
Using the lexicographical sequence for the states, the onestep transition block matrix can be written as where the first column in front of the matrix denotes the number of the customers for the first column block matrix in matrix , and is transition probability from to ; is transition probability matrix from to ; is transition probability matrix from to ; is transition probability matrix from to ; is transition probability matrix from to ; is transition probability matrix from to and from to ; is transition probability matrix from to ; is transition probability matrix from to .
We have
3. The Stationary Queue Size Distributions at Random Slots
Assume that is the stationary limit of , and its distribution is denoted as â€‰â€‰, we have the following theorem.
Theorem 1. If , , are given by where and is the root of the equation and is the root of the equation .
Proof. According to the onestep transition probability matrix, we can see which is not QBD process, the method of matrixgeometric solution is invalid. Based on the stationary equations obtained directly by stochastic balance, we have
Then, we obtain the following equations:
According to the characteristic of difference equations, let [24], , where denotes the difference operator for the difference equation, substituting it into (10), (10) can be written as
The auxiliary equation is given by
Let and . Using RouchÃ©'s theorem, it can be shown that there is only one zero real root falls in the unit circle (Note: the root must be real root; otherwise, there are two roots at least fall in the unit circle, because the imaginary roots of an equation appear in pairs.) We denote this root by and the other roots by , . So satisfies . Therefore, the solution of (10) can be written as
Since (otherwise, the probability tends to when tends to ), we get .
Let , we get , then
Substituting (16) into (9), we obtain
where .
Hence,
For , the difference equation (12) can be written as
Using , ; , the auxiliary equation of (19) such that
Let , obviously , . Since , that is, , we can see that . According to Hunter [25], the equation has a unique real root in unit circle, which can be denoted by ; the other roots can be denoted by , . As mentioned above, the general solution of (20) can be written as
Using the method of nonhomogeneous difference operator, the special solution of (19) can be written as
where .
From (21) and (22), we have
Substituting (17), (18), and (23) into (11), we obtain
Substituting (24) into (23), we can obtain .
Using , we can get
Remark 2. If and , this queueing system is equivalent to queueing system with a server serves customers singly. Because of and , then . Hence, . We have which are matched with the results given by Tian and Ma [26].
Corollary 3. Define as the state of system at random slots, the steadystate probability of this system at random slots can be written as
Theorem 4. If , the probability generating function (PGF) of steadystate queue length at random slots is given by and the average queue length is
Proof. In the steady state, the queue length at random slots has marginal distribution as Using , we can obtain (28) easily; furthermore, taking derivation to and let , we can get (29).
4. The Waiting Time Distribution
Let the random variable be the total waiting time of an arriving customer in the queue, represents the number of the customers in the system. Assume that an arriving customer finds customers in the system, the conditional distribution law that he waits for slots is subject to , , and PGF is . In the steady state, the waiting time with finite mean has PGF .
Theorem 5. In the steady state, the PGF of waiting time for an arriving customer is given by and the average waiting time as
Proof. Firstly, we define as a greatest integer function (floor), which returns the greatest integer less than or equal to a real number . An arriving customer may observe the system in any one of the following two cases.
Case 1. When , this case has no customers in the system and the server is on vacation, that is,
Case 2. When , there are two cases as follows.
(1) The server is on a normal busy period and customers in the system, meantime an arriving customer cannot go into the queue being served immediately.
Under this condition, an arriving customer has to wait for one period of service for and periods of service for . Each period of service is independent and geometrically distributed with p.m.f. , , which has PGF as .
We have
Hence,
Let , the PGF of the waiting time is given by
(2) An arriving customer finds the server is on vacation.
Let be the th length of the period of service with service rate and let be the sum of the length of periods of service with service rate , , where . Each period of service is mutually independent and geometrically distributed with p.m.f. ,â€‰â€‰, . There are two cases in this condition.
(A) A vacation is going on whereas all of the arrived customers have been served. Then, an arriving customer has to wait for one period of service for and periods of service for . We have
Let . The PGF of the waiting time is given by
(B) If a vacation is over and periods of service ended, the service rate is converted to from and the normal busy period begins. The waiting time of an arriving customer should be equal to the sum of the serverâ€™s vacation times and one period of service for and periods of service for . The service rate of periods of service is . We have
Hence,
The PGF of the waiting time can be given by
Adding (33)â€“(41), we can get (31), using , we can obtain (32).
5. Outside Observerâ€™s Observation Epoch Distributions
For an early arrive system, since an outside observerâ€™s observation epoch falls in the time interval after a potential arrival and before a potential batch departure, let, , be customers in the system and the server is on vacation (including the servicing customers), customers in the system and the server is in regular busy period (including the servicing customers). Through observing the relationship between random slot and the outside observerâ€™s observation epoch , we have
6. Numerical Results and the Sensitivity Analysis of this System
In this section, we present some numerical results in selfexplanatory tables and graphs for queue length distributions at random slots and all the numerical results have been obtained using the results derived in this paper.
We observe that and monotonically increase whereas and monotonically decrease as increases in Tables 1â€“4. This situation continues until is equal to some constant; all data will tend to be a steady state. The above description is consistent with actual situation. In the meantime, and monotonically decease as increases. In Figures 2 and 3, fixing , , , and , we have plotted the effect of various vacation service rates on the average queue length and the average waiting time, respectively. We observe that the average queue length and the average waiting time decrease as the vacation service rate increases. In Figure 4, fixing ,, and , the steadystate average queue length equals 0.2597 from on and the steadystate average waiting time equals 0.8421 from on. They do not change as the batch size increases.
 
, . 
