Analysis of MAP(1), MAP(2)/ PH/ 1 Non-preemptive Priority Queueing Model Under Classical Retrial Policy with Breakdown, Repair, Discouragement, Single Vacation, Standby Server, Negative Arrival and Impatient Customers

2021 ◽  
Vol 7 (5) ◽  
Author(s):  
G. Ayyappan ◽  
K. Thilagavathy
Keyword(s):  
Queueing Model ◽  
Impatient Customers ◽  
Preemptive Priority ◽  
Single Vacation ◽  
Priority Queueing

scholarly journals Priority queueing model with balking and reneging

2010 ◽  
Vol 2 (1) ◽  
pp. 38-41
Author(s):  
Charan Jeet Singh
Keyword(s):  
Single Server ◽  
Queueing Model ◽  
Finite Difference Equation ◽  
Preemptive Priority ◽  
Balance Equations ◽  
Steady State Probability ◽  
Infinite Population ◽  
Level 1 ◽  
Number Of Customers ◽  
Priority Queueing

This investigation deals with two levels, single server preemptive priority queueing model with discouragement behaviour (balking and reneging) of customers. Arrivals to each level are assumed to follow a Poisson process and service times are exponentially distributed. The decision to balk / renege is made on the basis of queue length only. Two specific forms of balking behaviour are considered. The system under consideration is solved by using a finite difference equation approach for solving the governing balance equations of the queueing model, with infinite population of level 1 customer. The steady state probability distribution of the number of customers in the system is obtained.

WAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERS

2013 ◽  
Vol 27 (3) ◽  
pp. 333-352 ◽  
Author(s):  
Vahid Sarhangian ◽  
Bariş Balciog̃lu
Keyword(s):  
Waiting Time ◽  
Delay Systems ◽  
Single Server ◽  
Impatient Customers ◽  
Preemptive Priority ◽  
System A ◽  
Virtual Waiting Time ◽  
The Laplace Transform ◽  
Time Requirements ◽  
Priority Policy

In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed patience limits expire. The second system comprises parallel and identical servers providing the same type of service for both classes of impatient customers under the non-preemptive priority policy. We assume exponential service times and consider two cases depending on the time-to-abandon distribution being exponentially distributed or deterministic. In either case, we permit different reneging rates or patience limits for each class. Finally, we consider the first-come-first-served policy in single- and multi-server settings. In all models, we obtain the Laplace transform of the virtual waiting time for each class by exploiting the level-crossing method. This enables us to compute the steady-state system performance measures.

Transient Analysis of a Non-Preemptive Priority Queueing System

2018 ◽  
Vol 12 (3) ◽  
pp. 645-654
Author(s):  
V. S. S. Yadavalli ◽  
Diatha Krishna Sundar ◽  
Swaminathan Udayabaskaran ◽  
C. T. Dora Pravina
Keyword(s):  
Transient Analysis ◽  
Queueing System ◽  
Preemptive Priority ◽  
Priority Queueing
Sign in / Sign up

Export Citation Format

Share Document