Two Types of Single-Server Queueing Systems with Threshold-Based Renovation Mechanism

This work is devoted to the analysis of two GI/M/1 infinite capacity queuing systems with threshold control of the renovation mechanism, which is responsible for the probabilistic dropping of claims entered into the system upon service completions. In the system of the first type, the threshold value is the value of the queue length, upon passing which the renovation mechanism is activated. For a system of the second type, the threshold value not only activates the renovation, but also specifies the area in the queue where from the customers cannot be dropped. For both systems, the main stationary time-probabilistic characteristics are derived and also the results of simulation, which illustrate the performance of the queues, are presented. © 2021, Springer Nature Switzerland AG.

Publisher
Springer Science and Business Media Deutschland GmbH
Language
English
Pages
196-210
Status
Published
Volume
13144 LNCS
Year
2021
Organizations
  • 1 Department of Applied Probability and Informatics, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya Street 6, Moscow, 117198, Russian Federation
  • 2 Institute of Informatics Problems, FRC CSC RAS, IPI FRC CSC RAS, 44-2 Vavilova Street, Moscow, 119333, Russian Federation
Keywords
GPSS; Queue management; Renovation mechanism; Threshold; Time-probabilistic characteristic
Date of creation
06.07.2022
Date of change
06.07.2022
Short link
https://repository.rudn.ru/en/records/article/record/84429/
Share

Other records

AlSweity M., Muthanna A., Elgendy I.A., Koucheryavy A.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH. Vol. 13144 LNCS. 2021. P. 32-41