|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 61 - Number 1
|Year of Publication: 2013
|Authors: S. Bharathidass
S. Bharathidass . Markovian Bulk Service Queue under Accessibility Rules. International Journal of Computer Applications. 61, 1 ( January 2013), 7-12. DOI=10.5120/9890-4449
A single server Markovian queue is considered. The arriving units are served in batches by using Accessibility and Non-Accessibility rules with varying service rates. The expressions for the steady state probabilities when the server is busy as well as idle are derived. The mean and variance for the number of units in the queue are obtained. The expected waiting time of units is also attained. Numerical results for number of units in the queue are computed for various values of ? and exhibited the corresponding graphs when the remaining parameters are fixed.