Numerical solution for the performance characteristics of the M/M/C/K retrial queue with negative customers and exponential abandonments by using value extrapolation method

2019 ◽  
Vol 53 (3) ◽  
pp. 767-786
Author(s):  
Zidani Nesrine ◽  
Pierre Spiteri ◽  
Natalia Djellab
Keyword(s):  
System Performance ◽  
Algebraic System ◽  
Queueing System ◽  
Retrial Queue ◽  
Practical Interest ◽  
Extrapolation Method ◽  
Negative Customers ◽  
Multiprocessor Computer ◽  
Retrial Queueing System ◽  
Retrial Queueing

This paper deals with a retrial queueing system M/M/C/K with exponential abandonment at which positive and negative primary customers arrive according to Poisson processes. This model is of practical interest: it permits to analyze the performance in call centers or multiprocessor computer systems. For model under study, we find the ergodicity condition and also the approximate solution by applying Value Extrapolation method which includes solving of some algebraic system of equations. To this end, we have resolved the algebraic system in question by different numerical methods. We present also numerical results to analyze the system performance.

scholarly journals An M/G/1 Retrial Queueing System with Phase Type Services and Working Vacations

2018 ◽  
Vol 7 (4.10) ◽  
pp. 758
Author(s):  
P. Rajadurai ◽  
R. Santhoshi ◽  
G. Pavithra ◽  
S. Usharani ◽  
S. B. Shylaja
Keyword(s):  
Queueing System ◽  
Retrial Queue ◽  
Probability Generating Function ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Multiple Working Vacations ◽  
Phase Type ◽  
Working Vacations ◽  
Multi Phase ◽  
Number Of Customers

A multi phase retrial queue with optional re-service and multiple working vacations is considered. The Probability Generating Function (PGF) of number of customers in the system is obtained by supplementary variable technique. Various system performance measures are discussed. 

An M/G/1 Bernoulli feedback retrial queueing system with negative customers

2011 ◽  
Vol 13 (2) ◽  
pp. 187-210 ◽  
Author(s):  
B. Krishna Kumar ◽  
S. Pavai Madheswari ◽  
S. R. Anantha Lakshmi
Keyword(s):  
Queueing System ◽  
Negative Customers ◽  
Bernoulli Feedback ◽  
Retrial Queueing System ◽  
Retrial Queueing

scholarly journals On the virtual waiting time for an M/G/1 retrial queue with two types of calls

1993 ◽  
Vol 6 (1) ◽  
pp. 11-23 ◽  
Author(s):  
Bong Dae Choi ◽  
Dong Hwan Han ◽  
Guennadi Falin
Keyword(s):  
Waiting Time ◽  
Queueing System ◽  
Retrial Queue ◽  
Arrival Rate ◽  
Switching System ◽  
Stieltjes Transform ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Virtual Waiting Time ◽  
Incoming Call

We consider an M/G/1 retrial queueing system with two types of calls which models a telephone switching system. In the case that arriving calls are blocked due to the channel being busy, the outgoing calls are queued in priority group whereas the incoming calls enter the retrial group in order to try service again after a random amount of time. In this paper we find the Laplace-Stieltjes transform of the distribution of the virtual waiting time for an incoming call. When the arrival rate of outgoing calls is zero, it is shown that our result is consistent with the known result for a retrial queueing system with one type of call.

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. 

scholarly journals M/M/1 Retrial queueing system with negative arrival under non-preemptive priority service

2014 ◽  
Vol 5 (2) ◽  
Author(s):  
A. Muthu Ganapathi Subramanian ◽  
G. Ayyappan ◽  
G. Sekar
Keyword(s):  
Queueing System ◽  
Numerical Study ◽  
Arrival Rate ◽  
Single Server ◽  
Preemptive Priority ◽  
Negative Customers ◽  
Retrial Queueing System ◽  
Priority Service ◽  
Retrial Queueing ◽  
Negative Arrivals

Consider a single server retrial queueing system with negative arrival under non-pre-emptive priority service in which three types of customers arrive in a poisson process with arrival rate λ1 for low priority customers and λ2 for high priority customers and λ3 for negative arrival. Low and high priority customers are identified as primary calls. The service times follow an exponential distribution with parameters μ1 and μ2 for low and high priority customers. The retrial and negative arrivals are introduced for low priority customers only. Gelenbe (1991) has introduced a new class of queueing processes in which customers are either positive or negative. Positive means a regular customer who is treated in the usual way by a server. Negative customers have the effect of deleting some customer in the queue. In the simplest version, a negative arrival removes an ordinary positive customer or a random batch of positive customers according to some strategy. It is noted that the existence of a flow of negative arrivals provides a control mechanismto control excessive congestion at the retrial group and also assume that the negative customers only act when the server is busy. Let K be the maximumnumber of waiting spaces for high priority customers in front of the service station. The high priorities customers will be governed by the Non-preemptive priority service. The access from the orbit to the service facility is governed by the classical retrial policy. This model is solved by using Matrix geometric Technique. Numerical study have been done for Analysis of Mean number of low priority customers in the orbit (MNCO), Mean number of high priority customers in the queue(MPQL),Truncation level (OCUT),Probability of server free and Probabilities of server busy with low and high priority customers for various values of λ1 , λ2 , λ3 , μ1 , μ2 ,σ and k in elaborate manner and also various particular cases of this model have been discussed.

scholarly journals Performance evaluation of two Markovian retrial queueing model with balking and feedback

2013 ◽  
Vol 5 (2) ◽  
pp. 132-146 ◽  
Author(s):  
A. A. Bouchentouf ◽  
F. Belarbi
Keyword(s):  
Performance Evaluation ◽  
Queue Length ◽  
Joint Distribution ◽  
Queueing System ◽  
Retrial Queue ◽  
Queueing Model ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Queue Lengths ◽  
The Relationship

Abstract In this paper, we consider the performance evaluation of two retrial queueing system. Customers arrive to the system, if upon arrival, the queue is full, the new arriving customers either move into one of the orbits, from which they make a new attempts to reach the primary queue, until they find the server idle or balk and leave the system, these later, and after getting a service may comeback to the system requiring another service. So, we derive for this system, the joint distribution of the server state and retrial queue lengths. Then, we give some numerical results that clarify the relationship between the retrials, arrivals, balking rates, and the retrial queue length.

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.

Sign in / Sign up

Export Citation Format

Share Document