Asymptotic Analysis Retrial Queueing System M/GI/1 with Hyper Exponential Distribution of the Delay Time in the Orbit and Exclusion of Alternative Customers

Author(s):  
Anatoly Nazarov ◽  
Yana Izmaylova
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


2018 ◽  
Vol 79 (12) ◽  
pp. 2136-2146 ◽  
Author(s):  
E. Yu. Danilyuk ◽  
E. A. Fedorova ◽  
S. P. Moiseeva

Author(s):  
Varghese Jacob

This paper presents a retrial queueing system with customer induced interruption while in service. We consider a single server queueing system of infinite capacity to which customers arrive according to a Poisson process and the service time follows an exponential distribution.An arriving customer to an idle server obtains service immediately and customers who find server busy go directly to the orbit from where he retry for service. The inter-retrial time follows exponential distribution. The customer interruption while in service occurs according to a Poisson process and the interruption duration follows an exponential distribution. The customer whose service is got interrupted will enter into a finite buffer. Any interrupted customer, finding the buffer full, is considered lost. Those interrupted customers who complete their interruptions will be placed into another buffer of same size. The interrupted customers waiting for service are given non-preemptive priority over new customers. We analyse the steady-state behavior of this queuing system. Several performance measures are obtained. Numerical illustrations of the system behaviour are also provided with example.


Sign in / Sign up

Export Citation Format

Share Document