|
This article is cited in 2 scientific papers (total in 2 papers)
A single-server queueing system with LIFO service, probabilistic priority, batch Poisson arrivals, and background customers
T. A. Milovanovaa, R. V. Razumchikb a Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
b Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Abstract:
Consideration is given to the single-server queueing system with two independent flows of customers: a batch Poisson flow of (primary) customers and a saturated flow of background customers. Primary customers have relative priority over background customers, i. e., the service of a background customer cannot be interrupted. A background customer is instantly taken for service every time the buffer for primary customers is empty upon the service completion. The service times of primary and background customers are independent and are allowed to be generally distributed. The implemented service policy is LIFO (last in, first out) with the probabilistic priority. The method and analytic expressions for the computation (in terms of transforms) of the system's main stationary performance characteristics, including the stationary distribution of the waiting and sojourn times of the primary customers, are presented.
Keywords:
queueing system, LIFO service, probabilistic priority, batch arrivals, background customers.
Received: 15.07.2020
Citation:
T. A. Milovanova, R. V. Razumchik, “A single-server queueing system with LIFO service, probabilistic priority, batch Poisson arrivals, and background customers”, Inform. Primen., 14:3 (2020), 26–34
Linking options:
https://www.mathnet.ru/eng/ia675 https://www.mathnet.ru/eng/ia/v14/i3/p26
|
|