Computing system length distribution of a finite-buffer bulk-arrival bulk-service queue with variable server capacity

2011 ◽  
Vol 12 (3) ◽  
pp. 294 ◽  
Author(s):  
A. Banerjee ◽  
K. Sikdar ◽  
U.C. Gupta
2021 ◽  
pp. 396-410
Author(s):  
Abhijit Datta Banik ◽  
Mohan L. Chaudhry ◽  
Sabine Wittevrongel ◽  
Herwig Bruneel

Author(s):  
G. Ayyappan ◽  
S. Velmurugan

This paper analyses a queueing model consisting of two units I and II connected in series, separated by a finite buffer of size N. Unit I has only one exponential server capable of serving customers one at a time. Unit II consists of c parallel exponential servers and they serve customers in groups according to the bulk service rule. This rule admits each batch served to have not less than ‘a’ and not more than ‘b’ customers such that the arriving customers can enter service station without affecting the service time if the size of the batch being served is less than ‘d’ ( a ≤ d ≤ b ). The steady stateprobability vector of the number of customers waiting and receiving service in unit I and waiting in the buffer is obtained using the modified matrix-geometric method. Numerical results are also presented. AMS Subject Classification number: 60k25 and 65k30


Sign in / Sign up

Export Citation Format

Share Document