Performance Analysis of an M/G/1 Retrial Queueing System Under LCFS-PR Discipline with General Retrial and Setup Times

Author(s):  
B. Krishna Kumar ◽  
R. Sankar ◽  
R. Rukmani
2015 ◽  
Vol 247 (1) ◽  
pp. 319-364 ◽  
Author(s):  
B. Krishna Kumar ◽  
A. Thanikachalam ◽  
V. Kanakasabapathi ◽  
R. Rukmani

2014 ◽  
Vol 31 (02) ◽  
pp. 1440002 ◽  
Author(s):  
K. AVRACHENKOV ◽  
E. MOROZOV ◽  
R. NEKRASOVA ◽  
B. STEYAERT

In this paper, we study a new retrial queueing system with N classes of customers, where a class-i blocked customer joins orbit i. Orbit i works like a single-server queueing system with (exponential) constant retrial time (with rate [Formula: see text]) regardless of the orbit size. Such a system is motivated by multiple telecommunication applications, for instance wireless multi-access systems, and transmission control protocols. First, we present a review of some corresponding recent results related to a single-orbit retrial system. Then, using a regenerative approach, we deduce a set of necessary stability conditions for such a system. We will show that these conditions have a very clear probabilistic interpretation. We also performed a number of simulations to show that the obtained conditions delimit the stability domain with a remarkable accuracy, being in fact the (necessary and sufficient) stability criteria, at the very least for the 2-orbit M/M/1/1-type and M/Pareto/1/1-type retrial systems that we focus on.


Sign in / Sign up

Export Citation Format

Share Document