Without using any approximation to find the Monte Carlo method was proposed to investigate the effects of customer retrial phenomenon caused by busy channels in telephone networks for performance measures. The blocking probability, the queueing length, and the waiting time were examined for several cases with different arrival and services rates. Through simulations, they showed that the values...

This paper studies a discrete-time Geo/G/1 retrial queue where the server is subject to starting failures. We analyse the Markov chain underlying the regarded queueing system and present some performance measures of the system in steady-state. Then, we give two stochastic decomposition laws and find a measure of the proximity between the system size distributions of our model and the correspond...

This paper considers an M/G/1 retrial G-queue with general retrial times, in which the server is subject to working breakdowns and repairs. If the system is not empty during a normal service period, the arrival of a negative customer can cause the server breakdown, and the failed server still works at a lower service rate rather than stopping the service completely. Applying the embedded Markov...

This paper deals with the performance analysis of multiple server retrial queueing systems with a finite number of homogeneous sources of calls, where the heterogeneous servers are subject to random breakdowns and repairs. The requests are serviced according to random and fastest free server disciplines. The novelty of this investigation is the different service rates and different service poli...

This work is devoted to improving a two-level hierarchical queue management method based on priority and balancing under the interaction prediction principle. The lower level of calculations was connected with problem optimization solution responsible for two tasks. Firstly, packet flow aggregation distribution among macro-queues sub-queues organized router interface must solve congestion probl...

Equivalence relations between closed tandem queueing networks are established. Four types of models are under consideration: single-server infinite-capacity buffer queues, infinite-server queues with resequencing, single-server unit-capacity buffer queues with blocking before service, and single-server unit-capacity buffer queues with blocking after service. Using a customer/server duality we s...