Fluid Queue Driven by an <svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-2.8389pt" id="M1" height="15.0995pt" version="1.1" viewBox="-0.0657574 -12.2606 56.524 15.0995" width="56.524pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-78" d="M962 650H795L470 145L347 650H176L170 622C268 613 275 606 244 503L190 322C150 188 132 126 118 91C102 50 80 33 18 28L12 0H245L251 28C175 35 170 48 174 93C177 128 191 180 220 284L292 542H294C331 392 383 150 409 4H432L774 555H776L714 137C700 40 694 34 612 28L606 0H868L874 28C793 34 784 37 797 137L849 533C859 612 863 616 956 622L962 650Z"/></g><g transform="matrix(.017,0,0,-0.017,16.905,0)"><path id="g113-48" d="M368 703H309L44 -163H104L368 703Z"/></g><g transform="matrix(.017,0,0,-0.017,23.982,0)"><use xlink:href="#g113-78"/></g><g transform="matrix(.017,0,0,-0.017,40.888,0)"><use xlink:href="#g113-48"/></g><g transform="matrix(.017,0,0,-0.017,47.965,0)"><path id="g113-50" d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"/></g></svg> Queue Subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption

Vijayashree, Kolinjivadi Viswanathan; Anjuka, Atlimuthu

doi:https://doi.org/10.1155/2016/2673017

Advances in Operations Research

On this page

Abstract Introduction Conclusion References Copyright Related Articles

Research Article | Open Access

Volume 2016 | Article ID 2673017 | https://doi.org/10.1155/2016/2673017

Fluid Queue Driven by an Queue Subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption

Kolinjivadi Viswanathan Vijayashree¹and Atlimuthu Anjuka¹

Academic Editor: Yi-Kuei Lin

Received30 Nov 2015

Revised12 Mar 2016

Accepted16 Mar 2016

Published08 Jun 2016

Abstract

This paper deals with the stationary analysis of a fluid queue driven by an queueing model subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption. The model under consideration can be viewed as a quasi-birth and death process. The governing system of differential difference equations is solved using matrix-geometric method in the Laplacian domain. The resulting solutions are then inverted to obtain an explicit expression for the joint steady state probabilities of the content of the buffer and the state of the background queueing model. Numerical illustrations are added to depict the convergence of the stationary buffer content distribution to one subject to suitable stability conditions.

1. Introduction

In many real time situations, the server in the background queueing model may become unavailable for a random period of time to perform a secondary task, when there are no customers in the waiting line at the service completion epoch. Such period of server absence is termed as server vacation. Queueing models subject to various vacation policies are of interest to researchers in recent times owing to their widespread applicability.

There are different types of vacation queueing systems. In the single vacation scheme, the server takes a vacation of some random duration when the queue is empty. At the end of the vacation, the server returns to the queue. The server resumes service if there is at least one customer waiting upon his return from vacation. However, if the queue is empty on the server’s return, the server waits to complete a busy period. In the multiple vacation scheme, if the server returns from a vacation and finds the queue empty, he immediately commences another vacation. If there is at least one waiting customer, then he will commence the service. Queueing models subject to single or multiple exponential vacation are apt to model many practical scenarios [1–3]. However, a better modeling assumption would be to assume that the server works at a slower rate during vacation periods in comparison to that of a regular working period. Such models are classified as queues subject to working vacations [4–6]. In addition, the server can stop the vacation once some indices of the system, such as the number of customers, achieve a certain value in the vacation period. Certainly, it is possible for the server to take an interrupted vacation, so we call this policy vacation interruption. Li and Tian [7] studied the single server queueing model with working vacation and vacation interruption. The modulating queueing model considered in this paper is an queue wherein the server is subject to regular vacation with probability or working vacation with probability . Further, the vacation duration of the server during working vacation epoch may be interrupted due to vacation interruption.

Fluid queues have become a fascinating area of research in recent years due to their widespread applicability in computer and communication systems [8, 9], manufacturing systems [10], and so forth. A stochastic fluid flow system is an input-output model where the input is modeled as a continuous fluid that enters and leaves the storage device called a buffer, according to randomly varying rates. They are appropriate in a situation wherein the arrival is comprised of a discrete unit, but the interarrival time between successive arrivals is negligible. Therefore, the arrivals can be approximated by a continuous flow of fluid as individuals units have less impact on the performance of the system. In these models, a fluid buffer is either filled or depleted or both at rates determined by the current state of the background queueing model. Markov modulated fluid queues are a particular class of fluid models useful for modeling many physical phenomena and they often allow tractable analysis. In addition, fluid models are quite useful as approximate models for certain queueing and inventory systems where the flow consists of discrete entities, but the behavior of the individual is not important to identify the performance analysis. Certain interesting real world applications of Markov Modulated Fluid Flow models can be found in [11–14]. Besides, fluid queues also have successful applications in the field of congestion control [15] and risk processes [16]. More recently, Bosman and Nunez-Queija [17] considered a tandem fluid queue model to evaluate the performance of streaming media over an unreliable network.

For example, consider a production inventory model operating in a stochastic environment. The inventory level increases when the production rate exceeds the demand rate and decreases otherwise. The inventory level under continuous review can be viewed as a fluid process that fluctuates according to the evolution of the underlying background environment. For example, consider a machine shop with a single server. When the server is busy, items are produced continuously at a rate and if he is idle, there is no production. However, for all practical reasons, the server might either take a vacation of some random duration with probability or decide to provide service at a reduced rate with probability . Further, by offering service at a reduced rate, the server may continue to do so with probability or due to certain unforeseen reasons, like a sudden increase in the demand, interrupt the vacation with probability , and continue the busy period. The demands are assumed to vary from time to time at the rate independent of the state of the server. The level of inventory thus oscillates between and depending on the busy or idle state of the server. Such scenario can be modeled as a fluid queue driven by an queue subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption.

The stationary analysis of fluid queueing models in a stochastic environment has been discussed by many authors. Fluid queues driven by an queueing model are extensively studied in the literature. Various techniques have been employed by researchers to obtain the stationary buffer content distribution. To mention a few, Adan and Resing [18] analyze the buffer content distribution by viewing the arrival process as an alternating renewal process and Virtamo and Norros [19] provide the buffer content distribution by finding the spectrum of the eigenvalue equation and explicit expressions for the corresponding eigenvectors in terms of Chebyshev polynomials of the second kind. Sericola and Tuffin [20] express the stationary distribution of the buffer occupancy in terms of a sequence of recursively defined polynomials. Parthasarathy et al. [21] present an explicit expression for the buffer content distribution in terms of modified Bessel function of the first kind using continued fraction methodology.

Furthermore, fluid models driven by an queue subject to various vacation strategies were analyzed in steady state by Mao et al. [22] and Wang et al. [23]. The work was further extended to the stationary analysis of fluid queues driven by an queue with multiple exponential vacation and policy [24]. Fluid model driven by an queue with working vacations and vacation interruption was studied by Xu et al. [25]. However, in most of the literature relating to fluid queues driven by vacation queueing models, the buffer content distribution is expressed in the Laplace domain. More recently, Vijayashree and Anjuka [26, 27] presented an explicit expression for the buffer content distribution of a fluid queueing model modulated by an queue subject to catastrophes and subsequent repair and a fluid queue driven by an queueing model, respectively. Also, Ammar [28] derives an explicit expression for the fluid queue driven by an queue with multiple exponential vacation using generating function methodology.

This paper presents an analytical solution for the fluid queue driven by an queue subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption in stationary regime. When the background queueing model is empty, the server will take either an ordinary vacation with probability or a working vacation with probability . If the system is in a working vacation, upon completion of service, the server either ends the vacation and enters a regular busy period with probability or continues the vacation with probability . It is assumed that the fluid in the buffer content increases at a constant rate, , when there is one or more customers in the background queueing model and decreases at a constant rate, , when the queue is empty. The system of equations governing the process is modeled in terms of quasi-birth and death process and solved using matrix-geometric method. The stationary distribution of the buffer content is thereby obtained in the Laplace domain and hence inverted to obtain explicit expressions for the joint steady state probabilities of the state of the background queueing model and content of the buffer. Closed form expressions help to gain a deeper insight into the model. As a special case, when , , and the theoretical results, so obtained, are seen to coincide with the existing results of Xu et al. [25] and Wang et al. [23], respectively.

The rest of the paper is organized as follows: Section 2 gives a brief description of the background queueing model under consideration. Section 3 presents the system of differential difference equations that governs the fluid queueing model under steady state subject to suitable stability conditions. Section 4 gives detailed derivations of the closed form expressions for the joint steady state probabilities of the state of the background queueing model and also the buffer content distributions. Section 5 presents the numerical illustration of the stationary buffer content distribution for suitable choice of the parameter values.

2. Model Description

Consider an queueing model with infinite capacity. Let the customers arrive according to a Poisson process with parameter . The server provides service to the arriving customers according to an exponential distribution with parameter . When the system becomes empty, the server begins a vacation of random length and takes an ordinary vacation with probability or a working vacation with probability , where . In an ordinary vacation, the server will stop working even if there are new arrivals during the vacation period. In a working vacation, customers are served at a lower rate . Further, in a working vacation, it is assumed that, at the instants of service completion, either the vacation is interrupted and the server resumes to a regular busy period with probability or the server continues the vacation with probability . When the vacation period ends and the system is nonempty, a new busy period starts. The ordinary vacation times and the working vacation times are also assumed to be exponentially distributed with parameters and , respectively. Let denote the number of customers at time . Define It is well known that the process is a quasi-birth and death (QBD) process with state space given by The state transition diagram of the background queueing model is given in Figure 1. Let represent the steady state probabilities of the background queueing model. Further, let and for . Then, the stationary probability vector is denoted by

It is readily seen that the system of equations governing the background queueing model under steady state can be written in the form of matrix aswhere , , and . Note that

The steady state probabilities of the single server queueing models with Poisson arrival and exponentially distributed service times subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption were studied by Zhang and Shi [29].

3. Analysis of Fluid Queue

This section deals with the stationary analysis of a fluid queue modulated by an queueing model subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption. Let be the content of the buffer at time . Furthermore, it is assumed that the content of the buffer increases at the rate , when there are customers in the background queueing model, while the buffer content decreases at the rate , when the system is empty. The rate at which the content of the buffer varies with time is given by where and . Figure 2 depicts the interaction between the buffer content process and the background queueing model. It is seen that the content of the infinite capacity buffer decreases at the rate when the background queueing model is empty with no waiting customers and it increases at the rate when irrespective of the states of .

Clearly the -dimensional process represents a fluid queue driven by an queue with Bernoulli-Schedule-Controlled Vacation and Vacation Interruption. As the content of the buffer varies dynamically, it is necessary that the net effective rate of the fluid remains negative to ensure the stability of the process in a long run. Hence, the stability condition is given by

Define the joint probability distribution functions of the Markov process at time as When the process is stable, its stationary random vector is denoted by . Under steady state conditions, let Using standard methods, the system of differential difference equations that governs the process is given bywith the boundary conditionsThe constants and are such that and . Since we make an assumption that the content of the buffer increases at the rate when there is one or more customers in the background queueing model, it is impossible to have the buffer empty when the modulating process is in any of the states other than and . However, when there are no customers in the background queueing model, the buffer content depletes at rate and hence with some positive probability, it is possible that the content of the buffer is empty. Therefore the boundary conditions given by (12) are valid.

4. Solution Methodology

The stationary distributions of the fluid process play a vital role as they give more information relating to quantities of interest for practical applications like tail probabilities, expected buffer content, traffic intensity, expected delay, and sojourn time. This section presents explicit expressions for the joint steady state probabilities of the background queueing model and the content of the buffer in terms of modified Bessel function of the first kind. The governing system of equations in the Laplace domain is expressed as a system of matrix equations. The minimal nonnegative solution of the matrix quadratic equation is determined. The stationary joint probability distributions are expressed in terms of this minimal nonnegative solution and are shown to satisfy the governing system of matrix equations. This section presents an explicit analytical solution to the governing system of equations represented by (11). In this sequel, define Let The system of equations represented by (11) can be written in matrix form aswhere Let represent the Laplace transform of . Then, the Laplace transform of (14) yields where The governing system of differential difference equations in the Laplace domain is then given byOur objective is to solve the above system of matrix difference equations to obtain explicit expressions for the stationary probability distribution and hence determine the stationary buffer content distribution. Towards that end, we present a lemma below followed by a theorem.

Lemma 1. The matrix quadratic equationhas the minimal nonnegative solution given by where

Proof. Since , , and are all upper triangular matrices, we can assume that the solution has the same structure as Note that the first row and second column elements of all the matrices of , , and are zero, so the element in is also zero. Therefore . Substituting for into (20) leads toThe solutions of (24) and (25) are given by Let and denote the negative (positive) roots of and , respectively. Considering the root that lies inside the unit circle, and are taken for further analysis. Further satisfies the following relations:From (26), we get Substituting for and into (27) yields Using the relation given by (30) in the above leads to Again substituting for and into (28) leads to Using the relation given by (30) in the above equation yields This completes the proof. Note that for can be simplified asAlso , where is given by with and .

Theorem 2. The stationary joint probability distributions of the content of the buffer and the state of the background queueing model in Laplace domain are given bywhere

Proof. Assume thatThen, it can be recursively written asBelow, we verify that (40) satisfies (18) and (19). Substituting (41) into (18) leads to Similarly, substituting (40) into (19) leads to From (17), we get Thereforewhich upon simplification leads towhere Hence all the joint stationary probabilities, , for are in terms of , where is given by (45). This completes the proof.

Having determined all the joint steady state probabilities in the Laplace domain, we now present the explicit analytical solution by inverting using transform techniques. From (41), we get which can be written asWith and , inversion of (46), (47), and (50) yieldswhere Thus all the joint steady state probabilities of the state of the system and the content of the buffer are explicitly obtained in terms of modified Bessel function of the first kind.

Remark 3. When and , the model under consideration reduces to a fluid queue driven by an queue with working vacation and vacation interruption discussed by Xu et al. [25]. With , the expression for from (39) yieldswhere Observe that (57) is seen to coincide with the first expression in of [25].

Remark 4. When , the model under consideration reduces to a fluid queue modulated by an queue with multiple exponential vacation discussed by Wang et al. [23].
Let and , where . Then the expression for from (39) becomes where . Substituting in the above equation and after certain simplification, we obtainObserve that (60) is seen to coincide with of [23].
Buffer Content Distribution. The stationary buffer content distribution of the fluid model under consideration is given by Taking Laplace transform of the above equation yields In matrix notation, the above equation can be rewritten as Then, where Upon simplification, we get which on inversion leads to where and are given by (51) and (52), respectively. Thus all the joint steady state probabilities and the buffer content distribution of the fluid queue driven by an queue subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption are explicitly obtained under steady state. Explicit analytical expressions help the practitioner to better understand the behavior of any quantity of interest, like the mean buffer content, for varying values of the parameters involved in the model.

5. Numerical Illustrations

This section illustrates the variation of the buffer content distribution against the content of the buffer for , , , , , , , and varying values of . The choice of is relatively high as compared to because of our assumptions that happens when the background queueing model is nonempty and happens otherwise. To compensate for the rarity in the occurrence of , it is assumed to be larger.

Figure 3 depicts the behavior of the buffer content distribution, , against for the above choice of the parameter values with . For this choice of the parameters, it is seen that . Therefore, the stability condition is satisfied. It is seen that increases with increase in the value of and converges to as tends to infinity. Observe that Furthermore, as the value of greatly affects buffer content distribution, its variation against for a different value of is presented in Table 1.

6. Conclusion

Markov Modulated Fluid Flows (MMFF) are a class of fluid models wherein the rates at which the content of the fluid buffer varies are modulated by the Markov process evolving in the background. This paper studies a fluid model driven by an queue subject to Bernoulli-Schedule-Controlled Vacation and Vacation Interruption. The study of such models provides greater flexibility to the design and control of input and output rates of fluid flow thereby adapting the fluid models to wider application background. The governing system of infinite differential difference equations is explicitly solved using Laplace transform and matrix-geometric methodology. Most of the existing results in the literature pertaining to MMFF have presented the solution to the buffer content distribution in the Laplace domain. However, closed form analytical solutions help to gain a deeper insight into the model and other related performance measures. The current findings can be thought of as one of the key contributions to the theoretical development of MMFF rather than the practical context. The theoretical results so obtained are verified with the existing results in the literature as a special case. The variations of the stationary buffer content distribution against the content of the buffer for varying values of are numerically illustrated.

Competing Interests

The authors declare that they have no competing interests.

References

Z. Huo, S. Jin, and N. Tian, “Performance analysis and evaluation for connection-oriented networks based on discrete time vacation queueing model,” Quality Technology & Quantitative Management, vol. 5, no. 1, pp. 51–62, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
V. C. Narayanan, T. G. Deepak, A. Krishnamoorthy, and B. Krishnakumar, “On an (s, S) inventory policy with service time, vacation to server and correlated lead time,” Quality Technology & Quantitative Management, vol. 5, no. 2, pp. 129–143, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
M. Jain and S. Upadhyaya, “Threshold N-policy for degraded machining system with multiple type spares and multiple vacations,” Quality Technology & Quantitative Management, vol. 6, no. 2, pp. 185–203, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
S. Gao and J. Wang, “Discrete-time ${G e o}^{X} / G / 1$ retrial queue with general retrial times, working vacations and vacation interruption,” Quality Technology and Quantitative Management, vol. 10, no. 4, pp. 495–512, 2013.
View at: Publisher Site | Google Scholar
S. Gao and C. Yin, “Discrete-time ${G e o}^{X} / G / 1$ queue with geometrically working vacations and vacation interruption,” Quality Technology and Quantitative Management, vol. 10, no. 4, pp. 423–442, 2013.
View at: Publisher Site | Google Scholar
P. Vijaya Laxmi, V. Goswami, and K. Jyothsna, “Analysis of discrete-time single server queue with balking and multiple working vacations,” Quality Technology and Quantitative Management, vol. 10, no. 4, pp. 443–456, 2013.
View at: Publisher Site | Google Scholar
J. Li and N. Tian, “The M/M/1 queue with working vacations and vacation interruptions,” Journal of Systems Science and Systems Engineering, vol. 16, no. 1, pp. 121–127, 2007.
View at: Publisher Site | Google Scholar
R. Bekker and M. Mandjes, “A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input,” Mathematical Methods of Operations Research, vol. 70, no. 2, pp. 357–384, 2009.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
G. Latouche and P. G. Taylor, “A stochastic fluid model for an ad hoc mobile network,” Queueing Systems, vol. 63, no. 1–4, pp. 109–129, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
D. Mitra, “Stochastic theory of a fluid model of producers and consumers coupled by a buffer,” Advances in Applied Probability, vol. 20, no. 3, pp. 646–676, 1988.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
V. Aggarwal, N. Gautam, S. R. T. Kumara, and M. Greaves, “Stochastic fluid flow models for determining optimal switching thresholds,” Performance Evaluation, vol. 59, no. 1, pp. 19–46, 2005.
View at: Publisher Site | Google Scholar
V. G. Kulkarni and K. Yan, “A fluid model with upward jumps at the boundary,” Queueing Systems, vol. 56, no. 2, pp. 103–117, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
E. I. Tzenova, I. J. Adan, and V. G. Kulkarni, “Fluid models with jumps,” Stochastic Models, vol. 21, no. 1, pp. 37–55, 2005.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
K. Yan and V. G. Kulkarni, “Optimal inventory policies under stochastic production and demand rates,” Stochastic Models, vol. 24, no. 2, pp. 173–190, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
M. H. Veatch and J. R. Senning, “Fluid analysis of an input control problem,” Queueing Systems, vol. 61, no. 2-3, pp. 87–112, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
J. Ren, L. Breuer, D. A. Stanford, and K. Yu, “Perturbed risk processes analyzed as fluid flows,” Stochastic Models, vol. 25, no. 3, pp. 522–544, 2009.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
J. W. Bosman and R. Nunez-Queija, “A spectral theory approach for extreme value analysis in a tandem of fluid queues,” Queueing Systems. Theory and Applications, vol. 78, no. 2, pp. 121–154, 2014.
View at: Publisher Site | Google Scholar | MathSciNet
I. Adan and J. Resing, “Simple analysis of a fluid queue driven by an M/M/1 queue,” Queueing Systems, vol. 22, no. 1-2, pp. 171–174, 1996.
View at: Publisher Site | Google Scholar | MathSciNet
J. Virtamo and I. Norros, “Fluid queue driven by an M/M/1 queue,” Queueing Systems, vol. 16, no. 3-4, pp. 373–386, 1994.
View at: Publisher Site | Google Scholar | MathSciNet
B. Sericola and B. Tuffin, “A fluid queue driven by a Markovian queue,” Queueing Systems, vol. 31, no. 3-4, pp. 253–264, 1999.
View at: Publisher Site | Google Scholar | MathSciNet
P. R. Parthasarathy, K. V. Vijayashree, and R. B. Lenin, “An M/M/1 driven fluid queue—continued fraction approach,” Queueing Systems, vol. 42, no. 2, pp. 189–199, 2002.
View at: Publisher Site | Google Scholar | MathSciNet
B. Mao, F. Wang, and N. Tian, “Fluid model driven by an $M / M / 1$ queue with single exponential vacation,” in Proceedings of the 2nd International Conference on Information Technology and Computer Science, pp. 539–542, June 2010.
View at: Google Scholar
F. Wang, B. Mao, and N. Tian, “Fluid model driven by an M/M/1 queue with multiple exponential vacations,” in Proceedings of the IEEE International Conference on Advanced Computer Control (ICACC '10), vol. 3, pp. 112–115, March 2010.
View at: Publisher Site | Google Scholar
B.-W. Mao, F.-W. Wang, and N.-S. Tian, “Fluid model driven by an $M / M / 1$ queue with multiple vacations and $N$ -policy,” Journal of Applied Mathematics and Computing, vol. 38, no. 1-2, pp. 119–131, 2012.
View at: Publisher Site | Google Scholar | MathSciNet
X. Xu, H. Guo, Y. Zhao, and J. Geng, “The fluid model driven by the $M / M / 1$ queue with working vacations and vacation interruption,” Journal of Computational Information Systems, vol. 8, no. 18, pp. 7643–7651, 2012.
View at: Google Scholar
K. V. Vijayashree and A. Anjuka, “Stationary analysis of an M/M/1 driven fluid queue subject to catastrophes and subsequent repair,” IAENG International Journal of Applied Mathematics, vol. 43, no. 4, pp. 238–241, 2013.
View at: Google Scholar | MathSciNet
K. V. Vijayashree and A. Anjuka, “Fluid queue driven by an $M / E_{2} / 1$ queueing model,” in Computational Intelligence, Cyber Security and Computational Models, M. Senthilkumar, V. Ramasamy, S. Sheen, C. Veeramani, A. Bonato, and L. Batten, Eds., vol. 412 of Advances in Intelligent Systems and Computing, pp. 493–504, Springer India, New Delhi, India, 2016.
View at: Publisher Site | Google Scholar
S. I. Ammar, “Analysis of an $M / M / 1$ driven fluid queue with multiple exponential vacations,” Applied Mathematics and Computation, vol. 227, pp. 329–334, 2014.
View at: Publisher Site | Google Scholar | MathSciNet
H. Zhang and D. Shi, “The M/M/1 queue with Bernoulli-schedule-controlled vacation and vacation interruption,” International Journal of Information and Management Sciences, vol. 20, no. 4, pp. 579–587, 2009.
View at: Google Scholar | MathSciNet

Copyright

Copyright © 2016 Kolinjivadi Viswanathan Vijayashree and Atlimuthu Anjuka. 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.

PDF Download Citation

Download other formats

Order printed copies

Views

2080

Downloads

1249

Citations