title: ÐÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ðµ Ð¿ÑÐ¸Ð¾ÑÐ¸ÑÐµÑÐ½ÑÑ ÑÐ¸ÑÑÐµÐ¼ Ð¾Ð±ÑÐ»ÑÐ¶Ð¸Ð²Ð°Ð½Ð¸Ñ Ñ Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÐ½ÑÐ¼ Ð²ÑÑÐ°Ð»ÐºÐ¸Ð²Ð°ÑÑÐ¸Ð¼ Ð¼ÐµÑ Ð°Ð½Ð¸Ð·Ð¼Ð¾Ð¼ Ð¿ÑÐ¸ ÑÑÐµÑÐµ Ð²Ð¾Ð·Ð¼Ð¾Ð¶Ð½Ð¾ÑÑÐ¸ Ð¿ÑÐ¾ÑÐ¸Ð»Ð°ÐºÑÐ¸ÐºÐ¸ ÐºÐ°Ð½Ð°Ð»Ð° Ð¾Ð±ÑÐ»ÑÐ¶Ð¸Ð²Ð°Ð½Ð¸Ñ
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Investigation of priority service systems with a probabilistic push mechanism, taking into account the possibility of service channel vacation
Creators: name: ÐÐ°ÐºÑÐµÐµÐ², ÐÐ¸ÑÐ°Ð»Ð¸Ð¹
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2022
Subjects: ÑÐµÐ¾ÑÐ¸Ñ Ð¼Ð°ÑÑÐ¾Ð²Ð¾Ð³Ð¾ Ð¾Ð±ÑÐ»ÑÐ¶Ð¸Ð²Ð°Ð½Ð¸Ñ
Ð°Ð±ÑÐ¾Ð»ÑÑÐ½ÑÐ¹ Ð¿ÑÐ¸Ð¾ÑÐ¸ÑÐµÑ
Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÐ½ÑÐ¹ Ð²ÑÑÐ°Ð»ÐºÐ¸Ð²Ð°ÑÑÐ¸Ð¹ Ð¼ÐµÑ Ð°Ð½Ð¸Ð·Ð¼
Ð¿ÑÐ¾ÑÐ¸Ð»Ð°ÐºÑÐ¸ÐºÐ°
queueing theory
absolute priority
probabilistic push mechanism
vacation

description: ÐÐ±ÑÐµÐºÑÐ¾Ð¼ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ ÑÐ²Ð»ÑÑÑÑÑ ÑÐ¸ÑÑÐµÐ¼Ñ Ð¼Ð°ÑÑÐ¾Ð²Ð¾Ð³Ð¾ Ð¾Ð±ÑÐ»ÑÐ¶Ð¸Ð²Ð°Ð½Ð¸Ñ Ñ Ð°Ð±ÑÐ¾Ð»ÑÑÐ½ÑÐ¼ Ð¿ÑÐ¸Ð¾ÑÐ¸ÑÐµÑÐ¾Ð¼, Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÐ½ÑÐ¼ Ð²ÑÑÐ°Ð»ÐºÐ¸Ð²Ð°ÑÑÐ¸Ð¼ Ð¼ÐµÑÐ°Ð½Ð¸Ð·Ð¼Ð¾Ð¼, Ð° ÑÐ°ÐºÐ¶Ðµ Ñ Ð²Ð¾Ð·Ð¼Ð¾Ð¶Ð½Ð¾ÑÑÑÑ Ð¼Ð½Ð¾Ð³Ð¾ÐºÑÐ°ÑÐ½Ð¾Ð¹ Ð¿ÑÐ¾ÑÐ¸Ð»Ð°ÐºÑÐ¸ÐºÐ¸. Ð¦ÐµÐ»Ñ ÑÐ°Ð±Ð¾ÑÑ Ð±ÑÐ»Ð¾ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ðµ ÐºÐ¾Ð½ÐºÑÐµÑÐ½Ð¾Ð¹ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸ Ð¿Ð¾Ð´Ð¾Ð±Ð½Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ñ Ñ ÑÐµÐ»ÑÑ Ð¿Ð¾Ð»ÑÑÐµÐ½Ð¸Ñ ÐµÐµ Ð·Ð½Ð°ÑÐ¸Ð¼ÑÑ Ð¿Ð°ÑÐ°Ð¼ÐµÑÑÐ¾Ð², Ð° Ð¸Ð¼ÐµÐ½Ð½Ð¾ Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÐ¸ Ð¿Ð¾ÑÐµÑÐ¸ ÑÑÐµÐ±Ð¾Ð²Ð°Ð½Ð¸Ð¹ Ñ ÑÐ°Ð·Ð½ÑÐ¼ Ð¿ÑÐ¸Ð¾ÑÐ¸ÑÐµÑÐ¾Ð¼ Ð¸ Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÑ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð¸Ñ Ð¿ÑÐ¾ÑÐ¸Ð»Ð°ÐºÑÐ¸ÐºÐ¸, Ð² ÑÑÑÐ°Ð½Ð¾Ð²Ð¸Ð²ÑÐµÐ¼ÑÑ ÑÐµÐ¶Ð¸Ð¼Ðµ. Ð Ð¿ÑÐ¾ÑÐµÑÑÐµ ÑÐ°Ð±Ð¾ÑÑ Ð¿ÑÐ¸Ð¼ÐµÐ½ÑÐ»ÑÑ Ð¼ÐµÑÐ¾Ð´ Ð¿ÑÐ¾Ð¸Ð·Ð²Ð¾Ð´ÑÑÐ¸Ñ ÑÑÐ½ÐºÑÐ¸Ð¹ Ð² Ð¼Ð¾Ð´Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¸ Ð.Ð¡.ÐÐ»ÑÑÑÐµÐ½ÐºÐ¾. Ð ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐµ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ Ð±ÑÐ»Ð¸ Ð¿Ð¾Ð»ÑÑÐµÐ½Ñ Ð°Ð½Ð°Ð»Ð¸ÑÐ¸ÑÐµÑÐºÐ¸Ðµ ÑÐ¾ÑÐ¼ÑÐ»Ñ Ð´Ð»Ñ Ð²ÑÑÐ¸ÑÐ»ÐµÐ½Ð¸Ñ Ð²ÐµÑÐ¾ÑÑÐ½Ð¾ÑÑÐ½ÑÑ ÑÐ°ÑÐ°ÐºÑÐµÑÐ¸ÑÑÐ¸Ðº ÑÐ¸ÑÑÐµÐ¼Ñ, Ð° ÑÐ°ÐºÐ¶Ðµ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ñ Ð¿ÑÐ¸Ð¼ÐµÑÑ ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐ¾Ð², Ð¿Ð¾Ð»ÑÑÐµÐ½Ð½ÑÑ Ð² ÑÐ¾Ð´Ðµ Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸Ñ Ð²ÑÑÐµÐ¾Ð·Ð½Ð°ÑÐµÐ½Ð½ÑÑ ÑÐ¾ÑÐ¼ÑÐ» Ðº ÐºÐ¾Ð½ÐºÑÐµÑÐ½ÑÐ¼ ÑÐ¸ÑÐ»ÐµÐ½Ð½ÑÐ¼ Ð·Ð½Ð°ÑÐµÐ½Ð¸ÑÐ¼.
description: The object of the study is queuing systems with absolute priority, a probabilistic pushing mechanism, as well as with the possibility of multiple vacation. The purpose of the work was to study a specific implementation of such a system in order to obtain its significant parameters, namely, the probability of losing requirements with different priorities and the probability of carrying out preventive maintenance in a steady state. In the process of work, the method of generating functions was used in the modification of A.S.Ilyashenko. As a result of the study, analytical formulas were obtained for calculating the probabilistic characteristics of the system, and examples of the results obtained during the application of the above formulas to specific numerical values were constructed.