Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases. The paper presents a study approach for this kind of systems, based on discrete event simulation. It is shown that the given algorithm has a polynomial complexity. Also, the object-oriented design we used for implem...

We describe the results of analyzing the performance model of a retrial queueing system with the probabilistic model checker PRISM. The system has been previously analyzed with the help of the performance modeling environment MOSEL; we are able to accurately reproduce the results reported in literature. Furthermore, we compare PRISM and MOSEL with respect to their modeling languages and ways of...

We consider two-class retrial queueing system with constant rate fed by Poisson input and apply regenerative confidence estimation for mean number of customers in the stable orbit, while other orbit intimately grows. The simulation results illustrate that partially case providing accurate estimation, even stability conditions, related whole system, are violated.

Abstract. In this paper, we discuss about the concept of single server feedback retrial queueing system with two types of service and each type consist of two essential phases under variant vacation policy. Customers are allowed to balk and renege at particular times. By using the supplementary variables method, steady state probability generating function for system size and orbit size are obt...

Spinlocks are widely used in database engines for processes synchronization. KGX mutexes is new retrial spin-locks appeared in contemporary Oracle R versions for submicrosecond synchronization. The mutex contention is frequently observed in highly concurrent OLTP environments. This work explores how Oracle mutexes operate, spin, and sleep. It develops predictive mathematical model and discusses...

An exponential approximation for a time of the 1st loss of a call and the behaviour of a ow of lost calls for a Markov retrial state-dependent queueing system with nite capacity, operating in Markov environment and in conditions of "fast" service, is studied. The method of proof is based on the results about asymptotic behaviour of the 1st exit time from a xed subset of a semi-Markov process fo...

We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the singleserver retrial queue analyzed in Keilson and Servi [1]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues ([1] and [2]). The main contribution of the present paper is the derivation of the explicit form of the stationary system...