MX/G/1/∞ single-server queueing system with random volume customers and multiple vacations

• Autorzy: Tikhonenko Oleg , Ziółkowski Marcin

Identyfikatory

DOI

10.24425/bpasts.2024.150813

• Języki publikacji: EN

Abstrakty

EN

In the present paper, we investigate the model of a single-server queueing system with unlimited queue (of MX/G/1/∞-type), random volume customers, unlimited memory buffer and multiple vacations. In analyzed system, arriving customers (that form Poisson entrance flow of groups of customers) transport some information measured in bytes so they are assumed to be additionally characterized by some non-negative random volume. Customer service time generally depends on his volume. Information delivered by a customer is written out into dedicated unlimited memory buffer until customer ends his service. In addition, in considered system the mechanism of multiple vacations is implemented which means that server can have some breaks (rests) for a random period of time but breaks begin only in the moments when there is no customer present in the system. The above-mentioned mechanism has obvious influence on customer waiting time and, in consequence, on customers total volume. For the introduced model, we obtain general formula for the steady-state customers total volume distribution in the terms of Laplace–Stieltjes transforms as well as formulae defining its first two moments. Analysis of some interesting, practical special cases of the model and numerical computations are attached as well together with examples of possible applications of the model regarding real telecommunication or computer systems.

Słowa kluczowe

EN

single-server queueing system; queueing systems with random volume customers; queueing systems with vacations; total volume; Laplace–Stieltjes transform

PL

całkowita liczba klientów; system kolejkowy z jednym serwerem; system kolejkowy z losową liczbą klientów; system kolejkowy z wakacjami; transformata Laplace'a-Stieltjesa

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2024
• Tom: Vol. 72, nr 5
• Strony: art. no. e150813
• Opis fizyczny: Bibliogr. 41 poz., rys., tab.

Twórcy

autor

Tikhonenko Oleg

• Faculty of Designing. University of Social Science and Humanities – USWPS, Warsaw, Poland

• https://orcid.org/0000-0003-3087-1694

autor

Ziółkowski Marcin

• Institute of Information Technology. Warsaw University of Life Sciences – SGGW, Poland

• https://orcid.org/0000-0001-8907-8813

Bibliografia

• [1] A.K. Erlang, “Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges,” Post Office Electr. Eng. J., vol. 10, pp. 189–197, 1917.
• [2] F. Pollaczek, “Über eine aufgabe der wahrscheinlichkeitstheorie,” Math. Z., vol. 32, pp. 64–100, 1930, (in German).
• [3] A.Y. Khintchine, “Mathematical theory of stationary queues,” Sb. Math., vol. 39, no. 4, pp. 73–84, 1932, (in Russian).
• [4] S. Asmussen, Applied Probability and Queues, 2d ed. New York: Springer-Verlag, 2003.
• [5] P. P. Bocharov, C. D’Apice, A. V. Pechinkin, and S. Salerno, Queueing Theory. Utrecht-Boston: VSP, 2004.
• [6] M. Scholl and L. Kleinrock, “On the 𝑀/𝐺/1 queue with rest periods and certain service-independent queueing disciplines,” Oper. Res., vol. 31, no. 4, pp. 705–719, 1983.
• [7] T. Lee, “𝑀/𝐺/1/𝑁 queue with vacation time and exhaustive service discipline,” Oper. Res., vol. 32, no. 4, pp. 774–784, 1984.
• [8] B. T. Doshi, “Queueing systems with vacations-a survey,” Queueing Syst., vol. 1, pp. 29–66, 1986.
• [9] T. Lee, “𝑀/𝐺/1/𝑁 queue with vacation time and limited service discipline,” Perform. Eval., vol. 9, no. 3, pp. 181–190, 1989.
• [10] J. Machuveettil and T. Madhusoodanan, “Transient solution for a finite capacity 𝑀/𝐺𝑎,𝑏/1 queueing system with vacations to the server,” Queueing Syst., vol. 2, pp. 381–386, 1987.
• [11] H. Takagi, “Analysis of an 𝑀/𝐺/1/𝑁 queue with multiple server vacations, and its application to a polling model,” J. Oper. Res. Soc. Jpn., vol. 35, no. 3, pp. 300–315, 1992.
• [12] A. Frey and Y. Takahashi, “Explicit solution for 𝑀/𝐺 𝐼/1/𝑁 vacation queue,” J. Oper. Res., vol. 41, no. 3, pp. 430–441, 1998.
• [13] U. Yechiali, “On the 𝑀 𝑋/𝐺/1 queue with a waiting server and vacations,” Sankhy¯a: Indian J. Stat., pp. 159–174, 2004.
• [14] D.-A. Wu and H. Takagi, “𝑀/𝐺/1 queue with multiple working vacations,” Perform. Eval., vol. 63, pp. 654–681, 2006.
• [15] R. Kalyanaraman and S. Pazhani Bala Murugan, “A single server queue with additional optional service in batches and server vacation,” Appl. Math. Sci., vol. 2, no. 56, pp. 2765–2776, 2008.
• [16] A. Banik, “The infinite-buffer single server queue with a variant of multiple vacation policy and batch markovian arrival process,” Appl. Math. Mod., vol. 33, pp. 3025–3039, 2009.
• [17] C. Xiu, N. Tian, and Y. Liu, “The 𝑀/𝑀/1 queue with single working vacation serving at a slower rate during the start–up period,” J. Math. Res., vol. 2, no. 1, pp. 98–102, 2010.
• [18] U. Ayesta, O. Boxma, and I. Verloop, “Sojourn times in a processor sharing queue with multiple vacations,” Queueing Syst., vol. 33, pp. 53–78, 2012.
• [19] W.M. Kempa, K. Książek, and R. Marjasz, “On time-dependent queue-size distribution in a model with finite buffer capacity and deterministic multiple vacations with applications to LTE DRX mechanism modeling,” IEEE Access, vol. 9, pp. 148 374–148 383, 2021.
• [20] T.-H. Liu, H.-Y. Hsu, J.-C. Ke, and F.-M. Chang, “Preemptive priority markovian queue subject to server breakdown with imperfect coverage and working vacation interruption,” Computation, vol. 11, no. 89, 2023.
• [21] F. Jiang, D. Huang, and K. Wang, “Design approaches for optimizing power consumption of sensor node with 𝑁-policy 𝑀/𝐺/1 queuing model,” in Proc. 4th International Conference on Queueing Theory and Network Applications, QTNA ’09, New York, USA, 2009.
• [22] J. Li, H. Zhou, D. Zuo, K. Hou, H. Xie, and P. Zhou, “Energy consumption evaluation for wireless sensor network nodes based on queuing Petri net,” Int. J. Distrib. Sens. Netw., vol. 10, no. 4, p. 262848, 2014.
• [23] W. Kempa, “Analytical model of a wireless sensor network (WSN) node operation with a modified threshold-type energy saving mechanism,” Sensors, vol. 19, no. 14, 2019.
• [24] M. Gorawski, K. Grochla, R. Marjasz, and A. Frankiewicz, “Energy minimization algorithm for estimation of clock skew and reception window selection in wireless networks,” Sensors, vol. 21, no. 5, p. 1768, 2021.
• [25] M. Schwartz, Computer-communication Network Design and Analysis. New York: Prentice-Hall, Englewood Cliffs, 1977.
• [26] M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. New York: Addison-Wesley Publishing Company, 1987.
• [27] A.M. Alexandrov and B.A. Kaz, “Non-homogeneous demands flows service,” Izvestiya AN SSSR. Tekhnicheskaya Kibernetika, no. 4, pp. 47–53, 1973, (in Russian).
• [28] B. Sengupta, “The spatial requirements of an 𝑀/𝐺/1 queue, or: How to design for buffer space,” in Modelling and Performance Evaluation Methodology. Lecture Notes in Control and Information Science, F. Baccelli and G. Fayolle, Eds., Heidelberg, 1984, pp. 547–562.
• [29] O. Tikhonenko, Computer Systems Probability Analysis. Warsaw, Poland: Akademicka Oficyna Wydawnicza EXIT, 2006, (in Polish).
• [30] A. Cascone, R. Manzo, A. Pechinkin, and S. Shorgin, “A 𝐺𝑒𝑜𝑚/𝐺/1/𝑛 queueing system with lifo discipline, service interruptions and resumption, and restrictions on the total volume of demands,” in Proc. World Congress on Engineering, vol. 3, 2010.
• [31] S. Dudin, C. Kim, O. Dudina, and J. Baek, “Queueing system with heterogeneous customers as a model of a call center with a call-back for lost customers,” Math. Probl. Eng., vol. 2013, pp. 1–13, 2013.
• [32] E. Lisovskaya, S. Moiseeva, and M. Pagano, “Multiclass 𝐺 𝐼/𝐺 𝐼/∞ queueing systems with random resource requirements,” in International Conference on Information Technologies and Mathematical Modelling, 2018, pp. 129–142.
• [33] O. Tikhonenko, M. Ziółkowski, and W.M. Kempa, “Queueing systems with random volume customers and a sectorized unlimited memory buffer,” Int. J. Appl. Math. Comput. Sci., vol. 31, no. 3, pp. 471–486, 2021.
• [34] M. Ziółkowski and O. Tikhonenko, “Single-server queueing system with limited queue, random volume customers and unlimited sectorized memory buffer,” Bull. Pol. Acad. Sci. Tech. Sci., vol. 70, no. 6, p. e143647, 2022.
• [35] M. Ziółkowski, “Multi–server loss queueing system with random volume customers, non–identical servers and a limited sectorized memory buffer,” Bull. Pol. Acad. Sci. Tech. Sci., vol. 71, no. 5, p. e146764, 2023.
• [36] O. Tikhonenko and M. Ziółkowski, “Performance evaluation of unreliable system with infinite number of servers,” Bull. Pol. Acad. Sci. Tech. Sci., vol. 68, no. 2, pp. 289–297, 2020.
• [37] O. Tikhonenko and M. Ziółkowski, “Unreliable single-server queueing system with customers of random capacity,” in Computer Networks, P. Gaj, W. Gumiński, and A. Kwiecień, Eds., Cham, 2020, pp. 153–170.
• [38] M. Ziółkowski and O. Tikhonenko, “Multiserver queueing system with non-homogeneous customers and sectorized memory space”, in Computer Networks, P. Gaj, M. Sawicki, G. Suchacka, A. Kwiecień, Eds., Cham, 2018, pp. 272–285.
• [39] V. V. Ivlev, “Indeterminate forms of many variables functions. Part I,” Educ. Math., vol. 23, no. 4, pp. 90–100, 2002, (in Russian).
• [40] V. V. Ivlev, “Indeterminate forms of many variables functions. Part II,” Educ. Math, vol. 26, no. 3, pp. 77–85, 2003, (in Russian).
• [41] M. Ziółkowski, “On applications of computer algebra systems in queueing theory calculations,” Bull. Pol. Acad. Sci. Tech. Sci., vol. 72, no. 4, p. e150199, 2024.