Multiline queueing system with random time limitations and limited buffer space

• Autorzy: Tikhonenko O. , Zając P.

Identyfikatory

DOI

10.17512/jamcm.2018.4.10

• Języki publikacji: EN

Abstrakty

EN

In the paper, we investigate multi-server queueing systems with demands of random space requirements (volumes), in which buffer space is limited by constant value and queueing ore (and) service time are limited by exponentially distributed random variables. For such systems, stationary demands number distribution and loss probability are determined. Some numerical results are attached as well.

Słowa kluczowe

EN

total demands volume; system buffer capacity; loss probability; Stieltjes convolution

PL

system kolejkowy; splot Stieltjesa; pojemność bufora

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Journal of Applied Mathematics and Computational Mechanics
• Rocznik: 2018
• Tom: Vol. 17, nr 4
• Strony: 99--106
• Opis fizyczny: Bibliogr. 8 poz., rys.

Twórcy

autor

Tikhonenko O.

• Faculty of Mathematics and Natural Sciences, College of Sciences Cardinal Stefan Wyszyński University in Warsaw Warsaw, Poland

autor

Zając P.

• Institute of Mathematics, Czestochowa University of Technology Częstochowa, Poland

Bibliografia

• [1] Tikhonenko, O. (2006). Probability Methods of Information System Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (in Polish).
• [2] Tikhonenko, O.M. (1990). Queueing Models in Information Systems (Modeli massovogo obsluzhivanija v sistemah obrabotki informacii). Universitrtskoe, Minsk (in Russian).
• [3] Bocharov, P.P., D’Apice, C., Pechinkin, A.V., & Salerno, S. (2004). Queueing Theory. VSP, Utrecht-Boston.
• [4] Gnedenko, B.V., & Kovalenko, I.N. (1989). Introduction to Queueing Theory. Birkhäuser, Boston.
• [5] Naumov, V.A., & Samouylov, K.E. (2016). On relationship between queueing systems with resources and Erlang networks. Informatics and Applications (Informatika i ee Primeneniya), v. 10, issue 3, 9-14 (in Russian).
• [6] Ovcharov, L.A. (1969). Applied Queueing Theory (Prikladnye zadachi teorii massovogo obsluzhivanija). Mashinostrojenie, Moscow (in Russian).
• [7] Tikhonenko, O., & Zając, P. (2017). Queueing systems with demands of random space requirement and limited queueing or sojourn time. Communications in Computer and Information Science, 718, 380-391.
• [8] Alexandrov, A.M., & Kaz, B.A. (1973). Non-homogeneous demands flows service, Izvestiya AN SSSR. Tekhnicheskaya Kibernetika, 2, 47-53 (in Russian).

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).