Performance Analysis of Finite Buffer Queueing System with Multiple Heterogeneous Servers

2010 ◽  
pp. 180-183 ◽  
Author(s):  
C. Misra ◽  
P. K. Swain
Keyword(s):  
Performance Analysis ◽  
Queueing System ◽  
Finite Buffer ◽  
Heterogeneous Servers

Transient Analysis of a Two-Heterogeneous Severs Queue with Impatient Behaviour and Multiple Vacations

2018 ◽  
Vol 6 (1) ◽  
pp. 69-84
Author(s):  
Jia Xu ◽  
Liwei Liu ◽  
Taozeng Zhu
Keyword(s):  
Generating Functions ◽  
Transient Analysis ◽  
Bessel Functions ◽  
Queueing System ◽  
System Size ◽  
Heterogeneous Servers ◽  
Modified Bessel Functions ◽  
Multiple Vacations ◽  
Special Cases ◽  
Mean And Variance

AbstractWe consider anM/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtain explicit expressions for the time dependent probabilities, mean and variance of the system size at timetby employing probability generating functions, continued fractions and properties of the modified Bessel functions. Finally, two special cases are provided.

scholarly journals Transient analysis of queueing system with two heterogeneous servers

2019 ◽  
Vol 1333 ◽  
pp. 032039
Author(s):  
L I Korolkova ◽  
N Mashrabov ◽  
A M Murzin ◽  
A V Panfilov ◽  
Ju L Siuskina
Keyword(s):  
Transient Analysis ◽  
Queueing System ◽  
Heterogeneous Servers

scholarly journals A Priority Queue with Many Customer Types, Correlated Arrivals and Changing Priorities

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1292
Author(s):  
Seokjun Lee ◽  
Sergei Dudin ◽  
Olga Dudina ◽  
Chesoong Kim ◽  
Valentina Klimenok
Keyword(s):  
Markov Chain ◽  
Waiting Time ◽  
Performance Indicators ◽  
Queueing System ◽  
Priority Queue ◽  
First Aid ◽  
Single Server ◽  
Finite Buffer ◽  
Impatient Customers ◽  
Arrival Times

A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is described by a multi-dimensional Markov chain. The generator of this chain, having essential dependencies between the components, is derived and formulas for computation of the most important performance indicators of the system are presented. The dependence of some of these indicators on the capacity of the buffer space is illustrated. The profound effect of the phenomenon of correlation of successive inter-arrival times and variance of the service time is numerically demonstrated. Results can be used for the optimization of dispatching various types of customers in information transmission systems, emergency departments and first aid stations, perishable foods supply chains, etc.

scholarly journals Performance analysis of a discrete-time queueing system with priority jumps

2009 ◽  
Vol 63 (10) ◽  
pp. 853-858 ◽  
Author(s):  
Tom Maertens ◽  
Joris Walraevens ◽  
Marc Moeneclaey ◽  
Herwig Bruneel
Keyword(s):  
Performance Analysis ◽  
Discrete Time ◽  
Queueing System

scholarly journals Concavity of the throughput of tandem queueing systems with finite buffer storage space

1990 ◽  
Vol 22 (03) ◽  
pp. 764-767 ◽  
Author(s):  
Ludolf E. Meester ◽  
J. George Shanthikumar
Keyword(s):  
Queueing System ◽  
Queueing Systems ◽  
Sample Path ◽  
Concave Function ◽  
Time Interval ◽  
Single Server ◽  
Finite Buffer ◽  
Buffer Storage ◽  
Unlimited Supply ◽  
Number Of Customers

We consider a tandem queueing system with m stages and finite intermediate buffer storage spaces. Each stage has a single server and the service times are independent and exponentially distributed. There is an unlimited supply of customers in front of the first stage. For this system we show that the number of customers departing from each of the m stages during the time interval [0, t] for any t ≧ 0 is strongly stochastically increasing and concave in the buffer storage capacities. Consequently the throughput of this tandem queueing system is an increasing and concave function of the buffer storage capacities. We establish this result using a sample path recursion for the departure processes from the m stages of the tandem queueing system, that may be of independent interest. The concavity of the throughput is used along with the reversibility property of tandem queues to obtain the optimal buffer space allocation that maximizes the throughput for a three-stage tandem queue.

Sign in / Sign up

Export Citation Format

Share Document