SINGLE SERVER REPAIRABLE RETRIAL QUEUEING SYSTEM WITH MODIFIED BERNOULLI VACATION, OPTIONAL RE-SERVICE

2020 ◽  
Vol 9 (8) ◽  
pp. 5997-6007
Author(s):  
C. Revathi ◽  
l. Francis Raj ◽  
M.C. Saravanarajan
Keyword(s):  
Queueing System ◽  
Single Server ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Bernoulli Vacation

scholarly journals STABILITY ANALYSIS AND SIMULATION OF N-CLASS RETRIAL SYSTEM WITH CONSTANT RETRIAL RATES AND POISSON INPUTS

2014 ◽  
Vol 31 (02) ◽  
pp. 1440002 ◽  
Author(s):  
K. AVRACHENKOV ◽  
E. MOROZOV ◽  
R. NEKRASOVA ◽  
B. STEYAERT
Keyword(s):  
Queueing System ◽  
Stability Domain ◽  
Single Server ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Single Orbit ◽  
Transmission Control Protocols ◽  
Regenerative Approach ◽  
The Stability ◽  
Multi Access

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.

A Single Server Retrial Queueing System with Two Types of Batch Arrivals

2016 ◽  
pp. 55-70
Author(s):  
Kalyanaraman Rathinasabapathy
Keyword(s):  
Queueing System ◽  
Numerical Study ◽  
Priority Queue ◽  
Single Server ◽  
Type I ◽  
Type Ii ◽  
Operating Characteristics ◽  
Batch Arrivals ◽  
Retrial Queueing System ◽  
Retrial Queueing

A retrial queueing system with two types of batch arrivals is considered. The arrivals are called type I and type II customers. The type I customers arrive in batches of size k with probability c_k and type II customers arrive in batches of size k with probability d_k. Service time distributions are identical independent distributions and are different for both type of customers. If the arriving customers are blocked due to server being busy, type I customers are queued in a priority queue of infinity capacity whereas type II customers entered into retrial group in order to seek service again after a random amount of time. For this model the joint distribution of the number of customers in the priority queue and in the retrial group in closed form is obtained. Some particular models and operating characteristics are obtained. A numerical study is also carried out.

scholarly journals An M/G/1 Retrial Queue with Fluctuating Modes of Services

2018 ◽  
Vol 7 (4.10) ◽  
pp. 762
Author(s):  
P. Rajadurai ◽  
S. Venkatesh ◽  
K. Parameswari
Keyword(s):  
Steady State ◽  
Queueing System ◽  
Retrial Queue ◽  
Probability Generating Function ◽  
Single Server ◽  
Supplementary Variable ◽  
Working Vacation ◽  
Variable Technique ◽  
Retrial Queueing System ◽  
Retrial Queueing

In this paper, we consider a single server retrial queueing system with working vacation and two classes of customers, which are priority customers and ordinary customers. The single server provides fluctuating modes (optional phases) of services. Using the method of Probability Generating Function (PGF) approach and supplementary variable technique, the steady state results are obtained. 

Sign in / Sign up

Export Citation Format

Share Document