Abstract
A finite-capacity queueing model with Poisson input flow and generally distributed processing times of jobs is considered. An idea of a crowded period is introduced, namely the time period in the system operation during which the number of jobs present in the system is continually greater than or equal the fixed level \(M>0\). A system of integral equations for the tail cumulative distribution function of the time to start a crowded period is derived, conditioned by the number of jobs present in the accumulating buffer before the start moment. A solution of the equivalent system written for Laplace transforms is found using the linear algebraic approach.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
de Boer, P.T., Nicola, V.F., van Ommeren, J.V.C.: The remaining service time upon reaching a high level in M/G/1 queues. Queueing Syst. 39, 55–78 (2001)
Chae, K.C., Kim, K., Kim, N.K.: Remarks on the remaining service time upon reaching a target level in the M/G/1 queue. Oper. Res. Lett. 35, 308–310 (2007)
Cohen, J.W.: The Single Server Queue. North-Holand Publishing Company, Amsterdam, New York, Oxford (1982)
Fakinos, D.: The expected remaining service time in a single server queue. Oper. Res. 30, 1014–1018 (1982)
Al Hanbali, A.: Busy period analysis of the level dependent PH/PH/1/K queue. Queueing Syst. 67, 221–249 (2011)
Kempa, W.M.: On the distribution of the time to buffer overflow in a queueing system with a general-type input stream. In: Proceedings of the 35th International Conference on Telecommunication and Signal Processing (TSP 2012), Prague, 3–4 July 2012, pp. 207–211 (2012)
Kempa, W.M.: On buffer overflow duration in WSN with a vacation-type power saving mechanism. In: Proceedings of 2017 International Conference on Systems, Signals and Image Processing (IWSSIP), Poznań, Poland, 22–24 May 2017, pp. 87–90. Institute of Electrical and Electronics Engineers, Piscataway (2017)
Kempa, W.M.: On buffer overflow duration in a finite-capacity queueing system with multiple vacation policy. In: Pasheva, V., Popivanov, N., Venkov, G. (eds.) Proceedings of the 43th International Conference Applications of Mathematics in Engineering and Economics, AMEE 2017, Sozopol, Bulgaria, 8–13 June 2017, pp. 1–6. American Institute of Physics, Melville (2017) (AIP Conference Proceedings, vol. 1910, iss. 1)
Kempa, W.M., Marjasz, R.: Distribution of the time to buffer overflow in the single-server queueing model with multiple vacation policy. In: Wituła, R., et al. (eds.) Selected Problems on Experimental Mathematics, pp. 113–127. Silesian University of Technology Press, Gliwice (2017)
Kempa, W.M., Paprocka, I.: Time to buffer overflow in a finite-capacity queueing model with setup and closedown times. In: Świątek, J., Wilimowska, Z., Borzemski, L., Grzech, A. (eds.) Information Systems Architecture and Technology: Proceedings of 37th International Conference on Information Systems Architecture and Technology—ISAT 2016—Part III. AISC, vol. 523, pp. 215–224. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-46589-0_17
Korolyuk, V.S.: Boundary-Value Problems for Compound Poisson Processes. Naukova Dumka, Kiev (1975)
Lee, E.Y., Kinateder, K.K.J.: The expected wet period of finite dam with exponential inputs. Stoch. Anal. Appl. 90, 175–180 (2000)
Takagi: Queueing Analysis, vol. 2: Finite Systems. North-Holland (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kempa, W.M. (2019). Time to Start a Crowded Period in a Finite-Buffer Queue with Poisson Input Flow and General Processing Times. In: Dimov, I., Faragó, I., Vulkov, L. (eds) Finite Difference Methods. Theory and Applications. FDM 2018. Lecture Notes in Computer Science(), vol 11386. Springer, Cham. https://doi.org/10.1007/978-3-030-11539-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-11539-5_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11538-8
Online ISBN: 978-3-030-11539-5
eBook Packages: Computer ScienceComputer Science (R0)