finite capacity queue
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

2018 ◽  
Vol 9 (11) ◽  
pp. 1671-1680
Author(s):  
Rinsy Thomas ◽  
Susha D.

2014 ◽  
Vol 31 (04) ◽  
pp. 1450029 ◽  
Author(s):  
ROSTISLAV V. RAZUMCHIK

Consideration is given to the queueing system with incoming Poisson flows of regular and negative customers. Regular customers await service in buffer of finite size r. Each negative customer upon arrival pushes a regular customer out of the queue in buffer (if it is not empty) and moves it to another queue of finite capacity r (bunker). Customers from both queues are served according to exponential distribution with parameter μ, first-come, first-served discipline, but customers in bunker are served with relative priority. Using method based on Chebyshev and Gegenbauer polynomials the algorithm for computation of stationary blocking probabilities and joint probability distribution of the number of customers in buffer and bunker is obtained. Numerical example is provided.


Sign in / Sign up

Export Citation Format

Share Document