Ruslana Nekrasova

TL;DR: This paper deduces a set of necessary stability conditions for a new retrial queueing system with N classes of customers, where a class-i blocked customer joins orbit i, and performs a number of simulations to show that these conditions delimit the stability domain with a remarkable accuracy.

TL;DR: A single-server loss system in which each customer has both service time and a random volume is considered, and the inspection paradox is used to deduce an asymptotic relation between Q loss and the stationary loss probability P loss.

TL;DR: A novel approach to confidence estimation of the stationary measures in high performance multiserver queueing systems based on construction of the two processes which are, respectively, upper and lower bounds for the trajectories of the basic queue size process in the original system.

TL;DR: A regenerative structure of a basic process describing the dynamics of the system to establish stability conditions is exploited and it is shown that the convenient requirement that the mean load is less than the number of servers, is the stability criterion of the model.

TL;DR: This work considers a Markovian single-server retrial queueing system with a constant retrial rate, and conditions of null ergodicity and exponential Ergodicity for the corresponding process as well as bounds on the rate of convergence.