Abstract
This paper deals with the stationary and transient analysis of a single server queueing model subject to differentiated working vacation and customer impatience. Customers are assumed to arrive according to a Poisson process and the service times are assumed to be exponentially distributed. When the system empties, the single server takes a vacation of some random duration (Type I) and upon his return if the system is still empty, he takes another vacation of shorter duration (Type II). Both the vacation duration are assumed to follow exponential distribution. Further, the impatient behaviour of the waiting customer due to slow service during the period of vacation is also considered. Explicit expressions for the time dependent system size probabilities are obtained in terms of confluent hyper geometric series and modified Bessel’s function of first kind using Laplace transform, continued fractions and generating function methodologies. Numerical illustrations are added to depict the effect of variations in different parameter values on the time dependent probabilities.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- M/M/1 queue
- Differentiated working vacation
- Customer impatience
- Continued fractions
- Generating functions
- Confluent hypergeometric functions
1 Introduction
A vacation queueing system that distinguishes between two kinds of vacation that a server can take, namely, a shorter duration and a longer duration vacation is termed as queues subject to differentiated vacation. Ibe and Isijola (2014) obtained the analytical expressions for the steady-state system size probabilities of the M/M/1 queueing model subject to differentiated vacation. Phung Duc (2015) considered the same model introduced by Ibe and Isijola (2014) to derive the expressions for the sojourn time and the queue length and subsequently extended the model with working vacations to obtain steady-state results for system size probabilities and certain other performance measures. Vijayashree and Janani (2018) extended the studies of Ibe and Isijola (2014) on steady-state system size probabilities of the queueing model to the corresponding time dependent analysis using the probability generating function and Laplace transforms. Customer’s impatience is another important aspect of queueing models and it may occur due to the long wait in the queue. Recently, Suranga Sampth and Liu (2018) derived the transient solution for an M/M/1 queue with impatient customers, differentiated vacations and a waiting server. In many practical situations, it is reasonable to assume an alternate server during the vacation duration who works at a relatively slower pace. In this context, this paper studies an M/M/1 multiple vacation queueing models with two kinds of differentiated working vacations considering the impatient behaviour of the waiting customer during the vacation period of the server. Explicit expressions for the steady state and time-dependent system size probabilities are obtained. The model under consideration is relevant in several human involved systems like a clerk in a bank, a cashier in the super market and many more.
In recent years, the available bandwidth in communication system needs to meet several services such as video conferencing, video gaming, data off loading etc. thereby resulting in higher energy consumption. Hence, there arises a need to save the energy being consumed. With the advent of increase in mobile usage, various energy saving strategies were introduced. The IEEE.802.16e defines a sleep mode operation for conserving the power of mobile terminals. Sleep mode plays a central role for energy efficient usage in recent mobile technologies such as WiFi, 3G and WiMax. The sleep mode is characterized by the non-availability of the Mobile Stations (MS) as observed by the serving Base Stations (BS) to downlink and uplink traffic. In the data transfer between MS and BS, the MS can be modelled as a single server which in normal state is in active mode and switches off to sleep mode (Type I) and continues in listen interval (Type II) when no data packets are waiting in the buffer. In the IEEE standard the sleep state is peer specific and has two different modes of operations - light sleep and deep sleep mode. Chakraborthy (2016) revealed that there exists interesting performance tradeoffs among light sleep mode and deep sleep mode that can be explored to design an efficient power profile for mesh networks. Certain theoretical analysis work was carried out by various authors are Seo et al. (2014), Xiao (2005), Niu et al. (2001) to study the sleep mode operation employed in IEEE 802.16e. Among them, Xiao (2005) and Niu et al. (2001) construct queueing models with multiple vacations to analyse the power consumption and the delay.
2 Model Description
Consider a single server queueing model in which arrivals are allowed to join the system according to a Poisson process with parameter \( \lambda \) and service takes place according to an exponential distribution with parameter \( \mu \). The server takes a vacation of some random duration (type 1) if there are no customers in the system. When the server finds an empty system upon his return, the server takes another vacation of shorter duration (type 2). It is assumed that the server continues to provide service even during the vacation period, but at a slower rate rather than completely stopping the service. Such an assumption agrees well with most of the real time situations. The service time during type I and type II vacation are assumed to be exponentially distributed with parameters \( \mu_{1} ( < \mu ) \) and \( \mu_{2} ( < \mu ) \) respectively. Customers arriving while the system is in vacation state become impatient due to slow service. Each customer, upon arrival, activates an individual timer, which is exponentially distributed with parameter \( \xi \) for both vacation types (type I and type II). If the customer’s service has not been completed before the customer’s timer expires, he abandons the system never to return. It is assumed that the inter-arrival times, service times, waiting times and vacation times are mutually independent and the service discipline is First-In First-Out. Furthermore, the vacation times of the server during type I and type II vacation are also assumed to follow exponential distribution with parameters \( \gamma_{1} \) and \( \gamma_{2} \) respectively. The state transition diagram for the queueing model under study is given in Fig. 1.
Let \( X\left( t \right) \) denote the number of the customer in the system and \( S\left( t \right) \) represent the state of the server at time t, where \( S\left( t \right) = \left\{ {\begin{array}{*{20}l} {0,} \hfill & {\text{if}\,\text{ the}\,\text{ server}\,\text{ is}\,\text{ busy}} \hfill \\ {1,} \hfill & {\rm{if}\,\text{ the }\,\text{server}\,\text{ is}\,\text{ in}\,\text{ type}\,\text{ I}\,\text{ vacation}} \hfill \\ {2,} \hfill & {\rm{if}\,\text{ the}\,\text{ server}\,\text{ is}\,\text{ in}\,\text{ type}\,\text{ II}\,\text{ vacation}\rm{.}} \hfill \\ \end{array} } \right. \)
It can be readily seen that the process \( \left\{ {X \left( t \right), S \left( t \right) } \right\} \) forms a Markov process on the state space
2.1 Governing Equations
Let \( P_{n,j} \left( t \right) \) denote the time dependent probability for the system to be in state j with n customers at time t. Assume that initially the system is empty and the server is in type I vacation. By standard methods, the system of Kolmogorov differential difference equations governing the process are given by
with \( P_{0,1} \left( 0 \right) = 1, P_{0,2} \left( 0 \right) = 0 \,{\text{and}} \,P_{n,j} \left( 0 \right) = 0 \) for n = 1,2,3… and j = 0,1,2,..
3 Transient Analysis
In this section, the time–dependent system size probabilities for the model under consideration are obtained using Laplace transform, continued fractions and probability generating function method in terms of modified Bessel functions of first kind and confluent hypergeometric function.
3.1 Evaluation of \( \varvec{P}_{{\varvec{n},1}} \left( \varvec{t} \right) \) and \( \varvec{P}_{{\varvec{n},2}} \left( \varvec{t} \right) \)
Let \( \hat{P}_{n,j} \left( s \right) \) be the Laplace transform of \( P_{n,j} \left( t \right); n = 0,1 \ldots \,{\text{and}}\, \,\,j = 0,1,2. \) Taking Laplace transform of the Eqs. (2.4) and (2.6) leads to
and
Using the boundary conditions and rewriting Eq. (3.1) yields
which further yields the continued fraction given by
Using the identity (Refer Lorentzen and Waadeland 1992) relating continued fractions and hypergeometric series given by
where \( {}_{1}{\text{F}}_{1} \left( {a ;c;z} \right) \) is the confluent hypergeometric function, we get
for \( n = 1,2,3 \ldots \) . Hence, we recursively obtain
where
In particular, when \( n = 1 \), Eq. (3.3) becomes
Now, taking Laplace transform of Eq. (2.3) and applying the boundary conditions leads to
and hence
Substituting Eq. (3.4) in the Eq. (3.5) and after some algebra, we get
Substituting Eq. (3.6) in Eq. (3.3) yields
Applying the boundary conditions to Eq. (3.2) and using the same procedure as above to evaluate \( \hat{P}_{n,1} \left( s \right) \), it is seen that \( \hat{P}_{n,2} \left( s \right) \) can be expressed as
where
In particular, when \( n = 1 \), Eq. (3.8) becomes
Again taking Laplace transform of Eq. (2.5) leads to
and hence
Substituting Eq. (3.6) and Eq. (3.9) in the Eq. (3.10) and after some algebra, we get
Substituting Eq. (3.11) in Eq. (3.8) yields
Taking Laplace inverse for Eq. (3.7) and Eq. (3.12) leads to
and
ltiple vacation queueing systems with
where \( \delta \left( t \right)\varvec{ } \) is the Kronecker delta function and \( \phi_{\varvec{n}} \left( \varvec{t} \right) \) and \( \psi_{n} \left( t \right) \) for all values of n are derived in the Appendix. Therefore, all the time dependent probabilities of the number in the system during the vacation period of the server (both type I and type II vacation) are expressed in terms of \( P_{1,0} \left( t \right). \) It still remains to determine \( P_{1,0} \left( t \right). \)
3.2 Evaluation of \( \varvec{P}_{n,0} \left( \varvec{t} \right) \)
Towards this end, define the probability generating function, \( Q\left( {z,t} \right)\varvec{ } \) as \( Q\left( {z,t} \right) = \sum\nolimits_{n = 1}^{\infty } {P_{n,0} \left( t \right)z^{n} .} \) Then, \( \frac{{\partial Q\left( {z,t} \right)}}{\partial t} = \sum\nolimits_{n = 1}^{\infty } {P_{n,0}^{'} \left( t \right)z^{n} .} \)
Multiplying Eq. (2.2) by \( z^{n} \) and summing it over all possible values of n leads to
Multiplying Eq. (2.1) by \( z \), we get
Now, adding the above two equations yields
Integrating the above linear differential equation with respect to ‘\( t \)’ leads to
It is well known that if \( \alpha = 2\sqrt {\lambda \mu } \) and \( \beta = \sqrt {\frac{\lambda }{\mu } } \), then the generating function of the modified Bessel function of the first kind of order n represented by \( I_{n} \left( . \right) \) is given by
Comparing the coefficients of \( z^{n} \) in Eq. (3.17) for \( n = 1,2,3 \ldots . \) leads to
Comparing the coefficients of \( z^{ - n} \) in Eq. (3.17) yields
Multiplying the above equation by \( \beta^{2n} \) and using the property \( I_{ - n} \left( t \right) = I_{n} \left( t \right) \), we get
Subtracting Eq. (3.18) from Eq. (3.19) leads to
for \( n = 1,2,3, \ldots \). Thus \( P_{n,0} \left( t \right) \) is expressed in terms of \( P_{k,1} \left( t \right) \) and \( P_{k,2} \left( t \right) \) which are expressed in terms of \( P_{1,0} \left( t \right) \) in Eq. (3.13) and Eq. (3.14) respectively. It still remains to determine \( P_{1,0} \left( t \right) \) explicitly. Substituting \( n = 1 \) in Eq. (3.20) yields
Using the property \( I_{k - 1} \left( t \right) - I_{k + 1} \left( t \right) = \frac{{2kI_{k} \left( t \right)}}{t} \) and \( I_{1 - k} \left( t \right) = I_{k - 1} \left( t \right) \), we get
Taking Laplace transform of Eq. (3.21) leads to
where \( p = s + \lambda + \mu . \) Substituting for \( \hat{P}_{k,1} \left( s \right) \) and \( \hat{P}_{k,2} \left( s \right) \) from Eq. (3.7) and Eq. (3.12) in Eq. (3.22) leads to
which further yields
where
Therefore, we get
Laplace inversion of the above equation yields
where \( H\left( t \right) \) is given by
Note that Eqs. (3.13) and (3.14) present explicit expressions for \( P_{n,1} \left( t \right) \) and \( P_{n,2} \left( t \right) \) in terms of \( P_{1,0} \left( t \right) \) where \( P_{1,0} \left( t \right) \) is given by Eq. (3.23). All other probabilities, namely \( P_{n,0} \left( t \right) \) are determined in terms of \( P_{n,1} \left( t \right) \) and \( P_{n,2} \left( t \right) \) in Eq. (3.20). Therefore, all the time –dependent probabilities are explicitly obtained in terms of modified Bessel function of the first kind using generating function methodology. Having determined the transient state probabilities, all other performance measures can be readily analysed.
4 Steady State Probabilities
Let \( \pi_{n,j} \) denote the steady – state probability for the system to be in state j with n customers. Mathematically,
Using the final value theorem of Laplace transform, which states
It is observed that
From Eq. (3.17), we get
and hence
where
Similarly, from Eq. (3.10), we get
and hence
where
Also, consider the Laplace transform of Eq. (3.20) given by
where \( p = s + \lambda +\upmu \). It is seen that
On simplification, we get
which reduces to
Therefore,
As a special case, when \( \mu_{1} = 0 = \mu_{2} \) and \( \xi = 0 \) the results are seen to coincide with Vijayashree and Janani (2018) .
5 Numerical Illustrations
This section illustrates the behaviour of time-dependent state probabilities of the system during the functional state and vacation states (type 1 and type 2) of the server against time for appropriate choice of the parameter values. Though the system is of infinite capacity, the value of n is restricted to 25 for the purpose of numerical study.
Figure 2 depicts the behaviour of \( P_{n,0} \left( t \right) \) against time for varying values of n with the values \( \lambda = 0.4,\mu = 0.6,\gamma_{1} = 0.8,\gamma_{2} = 1,\mu_{1} = 0.1,\mu_{2} = 0.05 \,{\text{and}} \,\xi = 0.01 \). It is seen that for a particular value of n the transient state probability increases as time progresses and converges to the corresponding steady state probabilities. However, for a particular value of t the value of the probability decreases with increase in the number of customer in the system.
Figure 3 and Fig. 4 depicts the variation of \( P_{n,1} \left( t \right) \) and \( P_{n,2} \left( t \right) \) against time t for varying values of n with the same parameter values. All the values of \( P_{n,1} \left( t \right) \) and \( P_{n,2} \left( t \right) \) are start at 0 and converges to the corresponding to the steady state probability \( . \) It is observed that for a particular instant of time the probability values decreases as n increases. However, for a particular value of n the probability values increases reaches a peak and gradually decreases till it converges.
6 Conclusions
This paper presents a time dependent analysis of an M/M/1 queueing model subject to differentiated working vacation and customer impatience. Closed form expressions for the transient state probabilities of the state of the system are obtained using generating function and continued fraction methodologies. Numerical illustrations are added to support the theoretical results. The study can be further extended to an M/M/1 queueing model subject to m kinds of differentiated working vacation with impatience.
References
Gradshteyn, I., Ryzhik, I., Jeffery, A., Zwillinger, D. (eds.): Table of Integrals, Series and Products, 7th edn. Academic Press, Elsevier (2007)
Ibe, O.C., Isijola, O.A.: M/M/1 multiple vacation queueing systems with differentiated vacation. Model. Simul. Eng. 6, 1–6 (2014)
Seo, J.-B., Lee, S.-Q., Park, N.-H., Lee, H.-W., Cho, C.-H. (eds.): Performance analysis of sleep mode operation in IEEE 802.16e. In: 38th IEEE Vehicular Technology Conference, vol. 2, pp. 1169–1173 (2004)
Lorentzen, L., Waadeland, H.: Continued Fractions with Applications. Studies in Computational Mathematics, vol. 3. Elsevier, Amsterdam (1992)
Chakrabory, S.: Analyzing peer specific power saving in IEEE 802.11s through queueing petri Nnets: some insights and future research directions. IEEE Trans. Wireless Commun. 15, 3746–3754 (2016)
Suranga Sampth, M.I.G., Liu, J.: Impact of customer Impatience on an \( M/M/1 \) queueing system subject to differentiated vacations with a waiting server. Qual. Tech. Quant. Manag. (2018). https://doi.org/10.1080/16843703.2018.1555877
Phung-Duc, T.: Single-server systems with power-saving modes. In: Gribaudo, M., Manini, D., Remke, A. (eds.) ASMTA 2015. LNCS, vol. 9081, pp. 158–172. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18579-8_12
Vijayashree, K.V., Janani, B.: Transient analysis of an M/M/1 queueing system subject to differentiated vacations. Qual. Tech. Quant. Manage. 15, 730–748 (2018)
Xiao, Y.: Energy saving mechanism in the IEEE 80216e wireless MAN. IEEE Commun. Lett. 9, 595–597 (2005)
Niu, Z., Zhu, Y., Benetis, V.: A phase-type based markov chain model for IEEE 802.16e sleep mode and its performance analysis. In: Proceeding of the 20th International Teletraffic Congress, Canada, pp. 17–21 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Derivation of \( \phi_{n} \left( t \right) \,{\text{and}} \,\psi_{n} \left( t \right) \)
Appendix: Derivation of \( \phi_{n} \left( t \right) \,{\text{and}} \,\psi_{n} \left( t \right) \)
The confluent hypergeometric function represented by \( {}_{1}{\text{F}}_{1} \left( {{\rm{a}};{\text{c}};{\rm{z}}} \right) \) has a series representation given by
Consider the repression for \( \hat{\phi }_{n} \left( s \right) \) obtained as
Using the definition of confluent hypergeometric function, we obtain
And hence
Applying partial fraction in the above equation, we get
Now, consider the term in the denominator of \( \hat{\phi }_{n} \left( s \right) \) as
Where \( \hat{a}_{k} \left( s \right) = \frac{{\mathop \prod \nolimits_{j = 1}^{k} \left( {\mu_{1} + j\xi } \right)}}{{\mathop \prod \nolimits_{i = 1}^{k} \left( {s + \gamma_{1} + \mu_{1} + i\xi } \right)}}\left( {\frac{1}{{\xi^{k} k!}}} \right)\, {\text{and}} \,\hat{a}_{0} \left( s \right) = 1. \) By resolving into partial fractions, we have
Using the identity is given by Gradshteyn et al. (2007), it is seen that
where \( \hat{b}_{0} \left( s \right) = 1 \,{\text{and }}\,{\rm{for}}\, k = 1,2,3 \ldots \)
Substituting Eq. (A.3) and Eq. (A.2) in Eq. (A.1), we get
Taking inverse Laplace transform of the above equation leads to
where
and
Similarly equation of \( \hat{\psi }_{n} \left( s \right) \) as
Proceeding in the similar manner as that of \( \hat{\phi }_{n} \left( s \right) \), it is seen that the Laplace inverse of \( \hat{\psi }_{n} \left( s \right) \) is
where
and
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Vijayashree, K.V., Ambika, K. (2020). An M/M/1 Queueing Model Subject to Differentiated Working Vacation and Customer Impatience. In: Balusamy, S., Dudin, A.N., Graña, M., Mohideen, A.K., Sreelaja, N.K., Malar, B. (eds) Computational Intelligence, Cyber Security and Computational Models. Models and Techniques for Intelligent Systems and Automation. ICC3 2019. Communications in Computer and Information Science, vol 1213. Springer, Singapore. https://doi.org/10.1007/978-981-15-9700-8_9
Download citation
DOI: https://doi.org/10.1007/978-981-15-9700-8_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-9699-5
Online ISBN: 978-981-15-9700-8
eBook Packages: Computer ScienceComputer Science (R0)