scholarly journals A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units

2011 ◽  
Vol 02 (06) ◽  
pp. 791-799 ◽  
Author(s):  
Kailash C. Madan
1986 ◽  
Vol 33 (2) ◽  
pp. 237-243 ◽  
Author(s):  
R. Sivasamy

In this paper a single server preemptive priority queueing system, consisting of two types of units, with unlimited Poisson inputs and exponential service time distributions, is studied. The higher priority units are served in batches according to a general bulk service rule and they have preemptive priority over lower priority units. Steady state queue length distributions, stability condition and the mean queue lengths are obtained.


1973 ◽  
Vol 10 (04) ◽  
pp. 907-912 ◽  
Author(s):  
J. Michael Harrison

A single server, two priority queueing system is studied under the heavy traffic condition where the system traffic intensity is either at or near its critical value. An approximation is developed for the transient distribution of the low priority customers' virtual waiting time process. This result is stated formally as a limit theorem involving a sequence of systems whose traffic intensities approach the critical value.


2018 ◽  
Vol 12 (3) ◽  
pp. 645-654
Author(s):  
V. S. S. Yadavalli ◽  
Diatha Krishna Sundar ◽  
Swaminathan Udayabaskaran ◽  
C. T. Dora Pravina

1973 ◽  
Vol 10 (4) ◽  
pp. 907-912 ◽  
Author(s):  
J. Michael Harrison

A single server, two priority queueing system is studied under the heavy traffic condition where the system traffic intensity is either at or near its critical value. An approximation is developed for the transient distribution of the low priority customers' virtual waiting time process. This result is stated formally as a limit theorem involving a sequence of systems whose traffic intensities approach the critical value.


2010 ◽  
Vol 2 (1) ◽  
pp. 38-41
Author(s):  
Charan Jeet Singh

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.


Author(s):  
A. Muthu Ganapathi Subramanian ◽  
G. Ayyappan ◽  
G. Sekar

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.


2002 ◽  
Vol 101 (1-2) ◽  
pp. 185-190 ◽  
Author(s):  
Alan Krinik ◽  
Dan Marcus ◽  
Ray Shiflett ◽  
LiPing Chu

Sign in / Sign up

Export Citation Format

Share Document