Comparation of two single-server queueing systems with exponential service times and threshold-based renovation

In this paper we compare the simulation results of two types of 1 infinite capacity queues with the implemented threshold-based renovation mechanism. As usual renovation implies probabilistic dropping of customers from the queue upon service completions. In the systems of the first type there is the threshold value (indication the queue length) which controls the activation of the renovation mechanism. In the systems of the second type the threshold value not only triggers the renovation, but also specifies the area in the queue wherefrom the customers cannot be dropped. For both types of systems the main stationary characteristics are obtained. Numerical results are also provided, which illustrate the performance of the queues for different sets of simulation parametres. The simulation results comparison are presented in the section 4. © 2021 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).