Distribution of the time to buffer overflow in the M/G/1/N-type queueing model with batch arrivals and multiple vacation policy

References

• Abate, J., & Whitt, W. (1992). The Fourier-series method for inverting transforms of probability distributions. Queueing Systems, 10(1–2), 5–88. doi:10.1007/BF01158520
   Google Scholar
• Abate, J., & Whitt, W. (2006). A unified framework for numerically inverting Laplace transforms. INFORMS Journal of Computing, 18(4), 408–421. doi:10.1287/ijoc.1050.0137
   Web of Science ®Google Scholar
• Al Hanbali, A. (2011). Busy period analysis of the level dependent PH/PH/1/K queue. Queueing Systems, 67(3), 221–249. doi:10.1007/s11134-011-9213-6
   Google Scholar
• Chae, K. C., Kim, K., & Kim, N. K. (2007). Remarks on the remaining service time upon reaching a target level in the M/G/1 queue. Operations Research Letters, 35, 308–310. doi:10.1016/j.orl.2006.04.005
   Google Scholar
• Chydziński, A. (2007a). Time to reach buffer capacity in a BMAP queue. Stochastic Models, 23, 195–209.
   Web of Science ®Google Scholar
• Chydziński, A. (2007b). Time to buffer overflow in an MMPP queue. In: Lecture Notes in Computer Science (Vol. 4479, pp. 879–889).
   Google Scholar
• de Boer, P. T., Nicola, V. F., & van Ommeren, J. V. C. (2001). The remaining service time upon reaching a high level in M/G/1 queues. Queueing Systems, 39, 55–78.
   Web of Science ®Google Scholar
• Fakinos, D. (1982). The expected remaining service time in a single server queue. Operations Research, 30(5), 1014–1018. doi:10.1287/opre.30.5.1014
   Web of Science ®Google Scholar
• Frey, A., & Takahashi, Y. (1997). A note on an M/G/1/N queue with vacation time and exhaustive service discipline. Operations Research Letters, 21(2), 95–100. doi:10.1016/S0167-6377(97)00027-8
   Google Scholar
• Gaver, D. P. (1966). Observing stochastic processes, and approximate transform inversion. Operations Research, 14(3), 444–459. doi:10.1287/opre.14.3.444
   Web of Science ®Google Scholar
• Kempa, W. M. (2011). Analysis of departure process in batch arrival queue with multiple vacations and exhaustive service. Communications in Statistics - Theory and Methods, 40(16), 2856–2865. doi:10.1080/03610926.2011.562767
   Web of Science ®Google Scholar
• Kempa, W. M. (2012a). On the distribution of the time to buffer overflow in a queueing system with a general-type input stream. Proceedings of the 35th International Conference on Telecommunication and Signal Processing (TSP-2012), Prague, 2012, July 3–4, pp. 207–211, doi:10.1109/TSP.2012.6256283
   Google Scholar
• Kempa, W. M. (2012b). On time to buffer saturation in a GI/M/1/N-type queue. International Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems, 1(2–3), 1–7.
   Google Scholar
• Kempa, W. M. (2015). Queue-size distribution in energy-saving model based on multiple vacation policy. In V. V. Mityushev and M. V Ruzhansky (Eds.), Current trends in analysis and its applications. Proceedings of the 9th ISAAC Congress, Kraków 2013 (pp. 733–740). Cham: Springer (Springer series: Trends in Mathematics).
   Google Scholar
• Kempa, W. M. (2016). Transient workload distribution in the M/G/1 finite-buffer queue with single and multiple vacations. Annals of Operations Research, 239(2), 381–400. doi:10.1007/s10479-015-1804-x
   Google Scholar
• Kempa, W. M., & Paprocka, I. (2017). Time to buffer overflow in a finite-capacity queueing model with setup and closedown times. In J. Świa̧tek, Z. Wilimowska, L. Borzemski, & A. Grzech (Eds.), Information systems architecture and technology. Proceedings of the 37th International Conference on Information Systems Architecture and Technology (ISAT 2016), Part 3 (pp. 215–224). Cham: Springer International Publishing (Advances in Intelligent Systems and Computing 523).
   Google Scholar
• Korolyuk, V. S. (1975). Boundary-value problems for compound Poisson processes. Theory of Probability & Its Applications. doi:10.1137/1119001
   Google Scholar
• LaMaire, R. O. (1992). M/G/1/N vacation model with varying e-limited service discipline. Queueing Systems, 11(4), 357–375. doi:10.1007/BF01163861
   Google Scholar
• Lee, E. Y., & Kinateder, K. K. J. (2000). The expected wet period of finite dam with exponential inputs. Stochastic Analysis and Applications, 90(1), 175–180. doi:10.1016/S0304-4149(00)00034-X
   Google Scholar
• Lee, H. W., Lee, S. S., Park, J. O., & Chae, K. C. (1994). Analysis of Mx/G/1 queue with N-policy and multiple vacations. Journal of Applied Probability, 31, 476–496. doi:10.2307/3215040
   Web of Science ®Google Scholar
• Lee, T. T. (1984). M/G/1/N queue with vacation time and exhaustive service discipline. Operations Research, 32(4), 774–784. doi:10.1287/opre.32.4.774
   Google Scholar
• Lee, T. T. (1989). M/G/1/N queue with vacation and limited service discipline. Performance Evaluation, 9(3), 181–190. doi:10.1016/0166-5316(89)90025-4
   Google Scholar
• Loris-Teghem, J. (1988). Vacation policies in an M/G/1 type queueing system with finite capacity. Queueing Systems, 3, 41–52. doi:10.1007/BF01159086
   Google Scholar
• Mancuso, V., & Alouf, S. (2012). Analysis of power saving with continuous connectivity. Journal of Computer Networks, 56(10), 2481–2493. doi:10.1016/j.comnet.2012.03.010
   Web of Science ®Google Scholar
• Pagurek, B., Stanford, D., & Woodside, C. M. (1988). Optimal prediction of times and queue lengths in the M/G/1 queue. Journal of the Operational Research Society, 39(6), 585–593. doi:10.1057/palgrave.jors.0390608
   Google Scholar
• Qingzhen, X., Susu, B., Zhanyou, M., & Naishuo, T. (2007). Mx/G/1 queue with multiple vacations. Stochastic Analysis and Applications, 25(1), 127–140.
   Web of Science ®Google Scholar
• Sanajian, N., Abouee-Mehrizi, H., & Balcioglu, B. (2010). Scheduling policies in the M/G/1 make-to-stock queue. Journal of the Operational Research Society, 61(1), 115–123. doi:10.1057/jors.2008.139
   Google Scholar
• Stehfest, H. (1970). Algorithm 368: Numerical inversion of Laplace transforms. Communications ACM, 13(1), 47–49.
   Web of Science ®Google Scholar
• Tadj, L. (2003). On an M/G/1 quorum queueing system under T-policy. Journal of the Operational Research Society, 54(5), 466–471. doi:10.1057/palgrave.jors.2601536
   Google Scholar