- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Discrete Dynamics in Nature and Society
Volume 2014 (2014), Article ID 924712, 9 pages
On the Steady-State System Size Distribution for a Discrete-Time Geo/G/1 Repairable Queue
School of Mathematics and Statistics, Chongqing University of Technology, Chongqing 400054, China
Received 28 September 2013; Accepted 10 February 2014; Published 19 March 2014
Academic Editor: Carlo Piccardi
Copyright © 2014 Renbin Liu and Zhaohui Deng. 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.
This paper studies a discrete-time N-policy Geo/G/1 queueing system with feedback and repairable server. With a probabilistic analysis method and renewal process theory, the steady-state system size distribution is derived. Further, the steady-state system size distribution derived in this work is extremely suitable for numerical calculations. Numerical example illustrates the important application of steady-state system size distribution in system capacity design for a network access proxy system.
Over the past years, the analysis of discrete-time queueing systems has received more attention in the literatures. This is because the discrete-time queues are more appropriate than their continuous-time counterparts in their applicability for many computer and communication systems in which time is divided into fixed-length time intervals (for details, e.g., see [1–4]).
It is well known that the N-policy introduced by Yadin and Naor  is very important in the theory and applications of queueing models. For detailed overviews of the continuous-time queues with N-policy, the reader is referred to an excellent survey by Tadj and Choudhury . Related works on the discrete-time queues with N-policy can be found in [7, 8]. Recently, Wei et al.  studied the transient and equilibrium properties of the queue length for an N-policy Geo/G/1 queue with variable input rate and indicated that the stochastic decomposition property no longer holds. Wang  considered a random N-policy Geo/G/1 queue with start-up and closedown times and obtained analytic solutions of system size, lengths of state periods, and sojourn time. As far as known to the authors, very few papers about discrete-time N-policy queueing systems are available.
Feedback was introduced by Takács  and since then many papers have appeared about this topic on continuous-time case (see, e.g., [12–14]). Atencia and Moreno  first extended the study to the discrete-time Ge/1 retrial queue. The phenomenon of feedback has many practical applications, for example, in telecommunication systems where messages that produce errors at the destination are sent again, in a call center where customers may call again (repeat their service) if their problems are not completely solved after the service and so forth. However, relative to continuous-time feedback queues, their discrete-time counterparts received very little attention in the literature.
A remarkable phenomenon in a queueing system is its server breakdown. For instance, in computer systems, the machine may be subject to scheduled backups and unforeseeable failures. Queues with server breakdowns can also be called repairable queues. For only the studies on discrete-time repairable queues, the reader may refer to Wang and Zhang , Tang et al. , and Liu and Gao .
However, only very few works in the literature concerned with N-policy queues with feedback and repairable server have been done. Particularly, the researches of the discrete-time N-policy queues with feedback and repairable server are not found. Further, in most works of the N-policy queue, the probability generating function (PGF) of steady-state system size distribution rather than steady-state system size distribution was obtained. In this paper, we investigate a discrete-time N-policy Geo/G/1 queueing system with feedback and repairable server. With a probability analysis method and renewal process theory, we derive the steady-state system size distribution. It is noted that the steady-state system size distribution derived in this paper is quite suitable for numerical calculations. What is more, numerical examples illustrate the applications of steady-state system size distribution in system capacity design for a network access proxy system.
The rest of the paper is organized as follows. The next section presents the model assumptions and some preliminaries. In Section 3 we discuss the transient system size distribution and derive the steady-state system size distribution and its PGF. Section 4 numerically shows the important application of system size distribution in system capacity for a network access proxy system. Conclusions are finally drawn in Section 5.
2. Assumptions and Preliminaries
We consider the following discrete-time N-policy Geo//1 queueing system with Bernoulli feedback and repairable server.
(1) Let the time axis be slotted into intervals of equal length with the length of a slot being one unit. To be more specific, let the time axis be marked by . Here we discuss the model for a late arrival system with delayed access (LAS-DA) and therefore a potential arrival takes place in and a potential departure occurs in ; for details, see Hunter . The various time epochs involved in our model can be viewed through a self-explanatory figure (see Figure 1). The interarrival times between customers, , are independent identically distributed (i.i.d.) random variables with a geometric distribution , .
(2) When there are customers present in system the server begins to serve in the first-come, first-served (FCFS) order until no customer is present. The service times, , are i.i.d. random variables having distribution , , with PGF , , and mean . The customer whose service has been just finished comes back to the queue with probability (1) waiting for the next service or leaves forever with probability .
(3) The server may fail when and only when it is serving a customer. The failed server will be repaired immediately. After repair, the server is as good as new and continues to serve the customer whose service has not been finished yet. We assume that the service time for a customer is cumulative.
(4) The lifetime of server has a geometric distribution with parameter , and its repair time obeys an arbitrary distribution , with PGF , , and a mean repair time .
(5) All random variables are mutually independent. At the initial time , the server begins to serve when the number of customers present in the system or the server is idle and waits for the first arrival when . After the first busy period, the server will take an N-policy.
Remark 1. Throughout this paper, we adopt the following notations. is the mean of random variable . is the probability of event . denotes the system size at epoch . , . . , .
Definition 2. The “generalized service time of a customer” denotes the time interval from the time when the server begins to serve a customer until the service of this customer ends, which includes some possible repair times of the server due to its failures in the process of serving this customer.
Lemma 3 (see ). The PGF and the mean of are given, respectively, by where and are given by assumptions (2) and (4).
For customer , let , , and denote total generalized service number, total generalized service time, and the th generalized service time before departure, respectively. Then it follows from assumption (2) that , , and , are i.i.d. random variables, where , are mutually independent with the same distribution as .
Lemma 4. Let , , be the distribution of total generalized service time for one customer before departure. Then one gets where is given by Lemma 3.
Definition 5. The “server busy period” denotes the time interval from the time when the server begins to serve a customer until the system becomes empty, which contains some possible repair times of server due to its failures in the process of service.
Let denote the server busy period initiated with one customer, and its PGF is , . According to , the following lemma holds.
Lemma 6. satisfies the equation , and where is the traffic intensity of the considered queueing system.
The server busy period initiated with customers is denoted by . Then, can be expressed as , where are independent of each other and have the same distribution as . Thus the PGF of is .
Definition 7. The “system idle period" denotes the time interval from the time the system becomes empty until the first customer arrives and enters the system.
Definition 8. The “server idle period” denotes the time interval from the time the system becomes empty until the server begins to serve the first customer.
Let , , and denote the th system idle period, server idle period, and server busy period initiated with the initial state , respectively; then, from the system assumptions, , , and are independent random variables, respectively. Further, follow an identical geometric distribution with mean . For and , the following is observed from assumption (5).
(i) If , then In this case, for , the PGFs of and are given, respectively, by where , , .
(ii) If , then and , . Thus, the PGFs of and are and , , respectively.
Lemma 9 (see ). If , , and , then
Lemma 10 (see ). If , then .
3. Analysis of System Size Distribution
In this section, above all, we will discuss the system size distribution at any epoch in server busy period . Next, the PGF of transient system size distribution at any epochs is obtained. Finally, the steady-state system size distribution is derived.
3.1. Transient System Size Distribution in Server Busy Period
Let , , denote transient system size distribution at epoch in server busy period and , ; then Theorem 11 follows.
Theorem 11. For and , where and if .
Proof. Denote by the total generalized service time of the first customer served in server busy period , and represents the arriving number of customers during . Noting that the length of has nothing to do with the service order of customers and arrival interval follows a geometric distribution with parameter , so we get
Let be the customers who arrive in the system during , called class-1 customers. We call those who arrive after the class-1 customers as class-2 customers. Since the length of server busy period is irrelevant to the service order of customers, we adopt the following service order: class-1 customers are served in the order of . After serving each class-1 customer, the server will serve any class-2 customer until there are no class-2 customers present. Thus the server busy period can be decomposed as where , denotes the time interval from the epoch when the server begins to serve the th class-1 customer until the next epoch when the service of the th class-1 customer begins. Therefore, are independent random variables with the same distribution as . Obviously, when . Since the point when the server busy period ends is a renewal point, for , can be expressed as
In the light of the above service order, if the epoch is in and , then at epoch there are class-1 customers waiting for service and class-2 customers present in the system. By the law of total probability and noting that has the same probability property as , we get Substituting (11) into (10) leads to Taking the PGF of (12) completes the proof of Theorem 11.
3.2. Transient System Size Distribution at Any Epoch
Let , , be conditional distribution of transient system size at any epochs and , ; then Theorem 12 follows.
Theorem 12. For and , where and is determined by Lemma 6.
Proof. Noting that the system is empty at time epoch if and only if the system is in the “system idle period,” thus we have
where , , and denote the th “system idle period,” the th “server idle period,” and the th “server busy period,” respectively (see Definitions 5–8).
For , similarly, we have Taking the PGFs of (14) and (15), respectively, and using the PGFs of , , , and , we can obtain (13).
Proof. For , means that epoch is in server busy period or server idle period with some customers waiting for service, so For , similarly, we get Taking the PGFs of (18) and (19), respectively, gives rise to which leads to the following relationship between and : Substituting (22) into (20) yields (16), and, furthermore, we obtain (17).
3.3. Steady-State System Size Distribution at Any Epoch
Theorem 15. Letting , , then (1)for , , ;(2)for , the steady-state system size distribution is given by the following formulas: (3)where (4)when , .
Corollary 16. Let , , denote the PGF of steady-state system size distribution at any epoch ; then, for ,
Remark 17. Equation (29) means that the system size of N-policy Geo/G/1 queue with feedback and repairable server is the sum of two independent random variables: , if . is the system size of Geo/G/1 queue with feedback and repairable server, and is the additional system size due to the N-policy. This confirms that the stochastic decomposition property by Fuhrmann and Cooper  is also valid for the discrete-time queue under consideration.
Corollary 18. Let denote the expected steady-state system size at any epoch ; then, for ,
Proof. Equation (30) is easily obtained by .
Remark 19 (special case). If and (no feedback and no server breakdown), then our model becomes a discrete-time N-policy Geo/G/1 queueing system. In this case, for , we have which agree with those in  (setting in (15), (16), and (18) for ’s model).
4. A Numerical Example
Our study has a potential application in a network access proxy system. In such a system, Channel requests, grants, data transmissions, and receptions all proceed in fixed time intervals. That is, service request sending, preprocessing, and processing are done in a discrete-time manner. Service requests sent by the users can be modelled as a Bernoulli process with rate . To avoid frequent switchovers from idle state to busy state, the proxy server is designed to start serving exhaustively, while the service requests are accumulated to . If a service request is received with errors at the destination, it is resent (feedback) with probability . When the server is busy, the arriving requests are placed in queue. The service time of each request is assumed to follow a geometric distribution with mean . Also, the service may be interrupted (server breakdown) due to some unpredictable events, such as traffic congestion of the network. Suppose that unpredictable events occur according to a Bernoulli process with rate and service interruption is immediately recovered. The recovery time obeys a geometric distribution with mean . The service will continuously start when the interruption is recovered.
Numerical results in Table 1 illustrate the application of the steady-state system size distribution in system capacity design. Here, we let , , , , , and . By Theorem 15 and Corollary 18, we numerically obtain the steady-state service request number distribution , the mean service request number , and the system load for the above network access proxy system (see Table 1).
Denote by the service request number in the system. According to Table 1, the probabilities that exceeds , , and are obtained as
The above three probability values are greater than 23, which shows that it is quite inaccurate for system capacity design to use mean service request number because quite a few service requests will be lost due to no waiting space. Also, it is seen from Table 1 that the probability that the service request number in the system exceeds 29 is less than 0.01. So it is also unnecessary for this system to design a large capacity.
Let be system capacity and let the positive decimal be less than 1. For simplicity, we assume that system capacity takes positive integer value. When the overflow probability , from Table 1, we can get optimal system capacity so that system operating costs are minimized (see Table 2). For example, if , then it follows from and Table 1 that . Thus we take since small capacity leads to small system cost.
In this paper, we consider a discrete-time N-policy Geo/G/1 queueing system with feedback and repairable server. With a probability analysis and renewal process theory, we discuss the transient system size distribution and derive the steady-state system size distribution and its PGF. It should be noted that the steady-state system size distribution derived by this paper is quite suitable for numerical calculation. Numerical examples show the application of steady-state system size distribution in system capacity design for a network access proxy system. In the future, further study, such as the random N-policy Ge/G/1 queueing system with feedback and repairable server, will be the research topic with the help of similar ideas and methods.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors would like to thank the referees and the editor for their valuable comments and suggestions. This work is supported by the Basic and Frontier Research Foundation of Chongqing of China (cstc2013jcyjA00008) and the Scientific Research Starting Foundation for Doctors of Chongqing University of Technology (2012ZD48).
- H. Kobayashi and A. G. Konheim, “Queueing models for computer communications system analysis,” IEEE Transactions on Communications, vol. 25, no. 1, pp. 2–29, 1977.
- I. Rubin and L. F. M. De Moraes, “Message delay analysis for polling and token multiple-access schemes for local communication networks,” IEEE Journal on Selected Areas in Communications, vol. 1, no. 5, pp. 935–947, 1983.
- F. J. Li and R. H. Sun, “Measurement-estimation approach to efficiency evaluation of bandwidth allocation scheme in ATM networks,” in Proceedings of the Conference Record IEEE Internation Conference on Conmunications, vol. 6, no. 2, pp. 131–142, 1997.
- N. S. Tian, X. L. Xu, and Z. Y. Ma, Discrete-Time Queueing Theory, Science Press, Beijing, China, 2008.
- M. Yadin and P. Naor, “Queueing systems with a removable service station,” Operational Research Quarterly, vol. 14, no. 3, pp. 393–405, 1963.
- L. Tadj and G. Choudhury, “Optimal design and control of queues,” Top, vol. 13, no. 2, pp. 359–412, 2005.
- P. Moreno, “A discrete-time single-server queue with a modified -policy,” International Journal of Systems Science, vol. 38, no. 6, pp. 483–492, 2007.
- T.-Y. Wang and J.-C. Ke, “The randomized threshold for the discrete-time Geo/G/1 queue,” Applied Mathematical Modelling, vol. 33, no. 7, pp. 3178–3185, 2009.
- Y. Y. Wei, M. M. Yu, Y. H. Tang, and J. X. Gu, “Queue size distribution and capacity optimum design for -policy queue with setup time and variable input rate,” Mathematical and Computer Modelling, vol. 57, no. 5-6, pp. 1559–1571, 2013.
- T.-Y. Wang, “Random -policy Geo/G/1 queue with startup and closedown times,” Journal of Applied Mathematics, vol. 2012, Article ID 793801, 19 pages, 2012.
- L. Takács, “A single-server queue with feedback,” The Bell System Technical Journal, vol. 42, no. 2, pp. 505–519, 1963.
- B. D. Choi, B. Kim, and S. H. Choi, “On the Bernoulli feedback queue with multi-class customers,” Computers & Operations Research, vol. 27, no. 3, pp. 269–286, 2000.
- D. I. Choi and T.-S. Kim, “Analysis of a two-phase queueing system with vacations and Bernoulli feedback,” Stochastic Analysis and Applications, vol. 21, no. 5, pp. 1009–1019, 2003.
- B. Krishna Kumar and J. Raja, “On multiserver feedback retrial queues with balking and control retrial rate,” Annals of Operations Research, vol. 141, pp. 211–232, 2006.
- I. Atencia and P. Moreno, “Discrete-time retrial queue with Bernoulli feedback,” Computers & Mathematics with Applications, vol. 47, no. 8-9, pp. 1273–1294, 2004.
- J. Wang and P. Zhang, “A discrete-time retrial queue with negative customers and unreliable server,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1216–1222, 2009.
- Y. H. Tang, X. Yun, and S. J. Huang, “Discrete-time queue with unreliable server and multiple adaptive delayed vacations,” Journal of Computational and Applied Mathematics, vol. 220, no. 1-2, pp. 439–455, 2008.
- Z. M. Liu and S. Gao, “Reliability indices of a Geo/G/1/1 Erlang loss system with active breakdowns under Bernoulli schedule,” International Journal of Management Science and Engineering Management, vol. 5, no. 6, pp. 433–438, 2010.
- J. J. Hunter, Mathematical Techniques of Applied Probability, Discrete Time Models: Techniques and Applications, vol. 2 of Operations Research and Industrial Engineering, Academic Press, New York, NY, USA, 1983.
- S. W. Fuhrmann and R. B. Cooper, “Stochastic decompositions in the queue with generalized vacations,” Operations Research, vol. 33, no. 5, pp. 1117–1129, 1985.