Abstract
A finite-buffer queueing model with Poisson arrivals and exponential processing times is investigated. Every time when the system becomes empty, the service station begins a generally distributed single working vacation period, during which the processing is provided with another (slower) rate. After the completion of the vacation period the processing is being continued normally, with original speed. The next working vacation period is being initialized at the next time at which the system becomes empty, and so on. Identifying Markov epochs in the evolution of the considered model, the system of Volterra-type integral equations for the time to buffer overflow tail distribution function, conditioned by the initial buffer state, is built. The solution of the corresponding system written for Laplace transforms is given in a compact-form using the linear algebraic approach. The considered queueing model can be used in modelling of the network node in which the typical processing rate changes periodically, due to e.g. introducing a priority traffic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Baba, Y.: Analysis of a GI/M/1 queue with multiple working vacations. Oper. Res. Lett. 33(2), 201–209 (2005)
Banik, A.: Analysis of single working vacation in GI/M/1/N and GI/M/1/\(\infty \) queueing systems. Int. J. Oper. Res. (IJOR) 7(3), 314–333 (2010)
Davies, B., Martin, B.: Numerical inversion of the Laplace transform: a survey and comparison of methods. J. Comput. Phys. 33(1), 1–32 (1979)
Gao S., Wang J., Li W. W: An M/G/1 retrial queue with general retrial times, working vacations and vacation interruption. APJOR 31(2) (2014)
Kempa W. M.: Non-stationary analysis of queueing delay behavior in the GI/M/1/N-type queue with server working vacations. In: AIP Conference Proceedings, vol. 1690(1) (2015)
Kempa, W.M., Kobielnik, M.: Transient solution for queue-size distribution in a certain finite-buffer model with server working vacations. In: Dregvaite, G., Damasevicius, R. (eds.) ICIST 2016. CCIS, vol. 639, pp. 426–440. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46254-7_34
Kempa, W.M., Kobielnik, M.: Transient virtual waiting time distribution in M/M/1/N system with working vacations. In: Proceedings of the 11th Scientific Conference Internet in the Information Society 2016, pp. 305–313 (2016)
Korolyuk, V.: Boundary-Value Problems for Compound Poisson Processes. Naukova Dumka, Kiev (1975). (in Russian)
Saffer, Z., Telek, M.: M/G/1 queue with exponential working vacation and gated service. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 28–42. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21713-5_3
Servi, L.D., Finn, S.G.: M/M/1 queues with working vacations (M/M/1/WV). Perform. Eval. 50(1), 41–52 (2002)
Sudhesh, R., Azhagappan, A., Dharmaraja, S.: Transient analysis of M/M/1 queue with working vacation, heterogeneous service and customers’ impatience. RAIRO Oper. Res. 51(3), 591–606 (2017)
Tao L., Zhang L., Gao S.: M/M/1 retrial queue with working vacation interruption and feedback under n-policy. J. Appl. Math. 2014, 414739:1–414739:9 (2014)
Vijayashree, K.V., Janani, B.: Transient analysis of an M/M/c queue subject to multiple exponential working vacation. Appl. Math. Sci. 9(74), 3669–3677 (2015)
Wu, D., Takagi, H.: M/G/1 queue with multiple working vacations. Perform. Eval. 63(7), 654–681 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kempa, W.M., Kobielnik, M. (2018). Time to Buffer Overflow in a Queueing Model with Working Vacation Policy. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds) Computer Networks. CN 2018. Communications in Computer and Information Science, vol 860. Springer, Cham. https://doi.org/10.1007/978-3-319-92459-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-92459-5_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92458-8
Online ISBN: 978-3-319-92459-5
eBook Packages: Computer ScienceComputer Science (R0)