The Analysis of Queuing System with General Service Distribution and Renovation

We investigate the queueing system in which the losses of incoming orders due to the introduction of a special renovation mechanism are possible. The introduced queueing system consists of server with a general distribution of service time and a buffer of unlimited capacity. The incoming flow of tasks is a Poisson one. The renovation mechanism is that at the end of its service the task on the server may with some probability empty the buffer and leave the system, or with an additional probability may just leave the system. In order to study the characteristics of the system the Markov chain embedded upon the end of service times is introduced. Under the assumption of the existence of a stationary regime for the embedded Markov chain the formula for the probability generation function is obtained. With the help of the probability generation function such system characteristics as the probability of the system being empty, the average number of customers in the system, the probability of a task not to be dropped, the distribution of the service waiting time for non-dropped tasks, the average service waiting time for non-dropped requests are derived.

queueing system, renovation, general service distribution, probability characteristics