Analysis of GI/M(n)/1/N queue with state-dependent multiple working vacations

This paper analyzes a finite buffer renewal input queueing system with state-dependent services and state-dependent multiple working vacations. Service times during a service period and service times during a vacation period are exponentially distributed with state-dependent rates. We provide a recursive algorithm using the supplementary variable technique and treating the remaining inter-arrival time as the supplementary variable to compute the stationary system length distributions during vacations and regular busy period. Various performance measures and the computational algorithm of the model have been discussed. The computational complexity of the algorithm is O(N-3). Some queueingmodels discussed in the literature are derived as special cases of our model. We present some numerical results to examine the effect of different parameters on the system performance characteristics.