scholarly journals Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs

Author(s):  
Anatoly Nazarov ◽  
János Sztrik ◽  
Anna Kvach ◽  
Ádám Tóth

AbstractThis paper deals with a retrial queuing system with a finite number of sources and collision of the customers, where the server is subject to random breakdowns and repairs depending on whether it is idle or busy. A significant difference of this system from the previous ones is that the service time is assumed to follow a general distribution while the server’s lifetime and repair time is supposed to be exponentially distributed. The considered system is investigated by the method of asymptotic analysis under the condition of an unlimited growing number of sources. As a result, it is proved that the limiting probability distribution of the number of customers in the system follows a Gaussian distribution with given parameters. The Gaussian approximation and the estimations obtained by stochastic simulations of the prelimit probability distribution are compared to each other and measured by the Kolmogorov distance. Several examples are treated and figures show the accuracy and area of applicability of the proposed asymptotic method.

Author(s):  
Elena Yu. Danilyuk ◽  
Svetlana P. Moiseeva ◽  
Janos Sztrik

The retrial queueing system of M=M=1 type with Poisson flow of arrivals, impatient cus- tomers, collisions and unreliable service device is considered in the paper. The novelty of our contribution is the inclusion of breakdowns and repairs of the service into our previous study to make the problem more realistic and hence more complicated. Retrial time of customers in the orbit, service time, impa- tience time of customers in the orbit, server lifetime (depending on whether it is idle or busy) and server recovery time are supposed to be exponentially distributed. An asymptotic analysis method is used to find the stationary distribution of the number of customers in the orbit. The heavy load of the system and long time patience of customers in the orbit are proposed as asymptotic conditions. Theorem about the Gaussian form of the asymptotic probability distribution of the number of customers in the orbit is formulated and proved. Numerical examples are given to show the accuracy and the area of feasibility of the proposed method


Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 269
Author(s):  
Valentina I. Klimenok ◽  
Alexander N. Dudin ◽  
Vladimir M. Vishnevsky ◽  
Olga V. Semenova

In this paper, we study a multi-server queueing system with retrials and an infinite orbit. The arrival of primary customers is described by a batch Markovian arrival process (BMAP), and the service times have a phase-type (PH) distribution. Previously, in the literature, such a system was mainly considered under the strict assumption that the intervals between the repeated attempts from the orbit have an exponential distribution. Only a few publications dealt with retrial queueing systems with non-exponential inter-retrial times. These publications assumed either the rate of retrials is constant regardless of the number of customers in the orbit or this rate is constant when the number of orbital customers exceeds a certain threshold. Such assumptions essentially simplify the mathematical analysis of the system, but do not reflect the nature of the majority of real-life retrial processes. The main feature of the model under study is that we considered the classical retrial strategy under which the retrial rate is proportional to the number of orbital customers. However, in this case, the assumption of the non-exponential distribution of inter-retrial times leads to insurmountable computational difficulties. To overcome these difficulties, we supposed that inter-retrial times have a phase-type distribution if the number of customers in the orbit is less than or equal to some non-negative integer (threshold) and have an exponential distribution in the contrary case. By appropriately choosing the threshold, one can obtain a sufficiently accurate approximation of the system with a PH distribution of the inter-retrial times. Thus, the model under study takes into account the realistic nature of the retrial process and, at the same time, does not resort to restrictions such as a constant retrial rate or to rough truncation methods often applied to the analysis of retrial queueing systems with an infinite orbit. We describe the behavior of the system by a multi-dimensional Markov chain, derive the stability condition, and calculate the steady-state distribution and the main performance indicators of the system. We made sure numerically that there was a reasonable value of the threshold under which our model can be served as a good approximation of the BMAP/PH/N queueing system with the PH distribution of inter-retrial times. We also numerically compared the system under consideration with the corresponding queueing system having exponentially distributed inter-retrial times and saw that the latter is a poor approximation of the system with the PH distribution of inter-retrial times. We present a number of illustrative numerical examples to analyze the behavior of the system performance indicators depending on the system parameters, the variance of inter-retrial times, and the correlation in the input flow.


2018 ◽  
Vol 16 (1) ◽  
pp. 986-998
Author(s):  
Chun Wen ◽  
Ting-Zhu Huang ◽  
Xian-Ming Gu ◽  
Zhao-Li Shen ◽  
Hong-Fan Zhang ◽  
...  

AbstractStochastic Automata Networks (SANs) have a large amount of applications in modelling queueing systems and communication systems. To find the steady state probability distribution of the SANs, it often needs to solve linear systems which involve their generator matrices. However, some classical iterative methods such as the Jacobi and the Gauss-Seidel are inefficient due to the huge size of the generator matrices. In this paper, the multipreconditioned GMRES (MPGMRES) is considered by using two or more preconditioners simultaneously. Meanwhile, a selective version of the MPGMRES is presented to overcome the rapid increase of the storage requirements and make it practical. Numerical results on two models of SANs are reported to illustrate the effectiveness of these proposed methods.


1967 ◽  
Vol 4 (01) ◽  
pp. 162-179 ◽  
Author(s):  
J. W. Cohen

The distribution of the maximum number of customers simultaneously present during a busy period is studied for the queueing systems M/G/1 and G/M/1. These distributions are obtained by using taboo probabilities. Some new relations for transition probabilities and entrance time distributions are derived.


Sign in / Sign up

Export Citation Format

Share Document