Single-server Queuing Systems with Exponential Service Times and Threshold-based Renovation

In this paper, we study a single-server queue system GI/M/1 with infinite capacity queue and with the implementation of threshold-based renovation mechanism. As usual renovation implies probabilistic dropping of customers from the queue upon service completions. In the system the threshold values not only triggers the renovation, but also specifies the area in the queue where from the customers cannot be dropped. For the system the main stationary characteristics are obtained. Numerical results are also provided, which illustrate the performance of the queues. and copy; 2021 IEEE. © 2021 IEEE Computer Society. All rights reserved.