On Finite Buffer BMAP/G/1 Queue with Queue Length Dependent Service
This paper deals with the analysis of a finite buffer queueing system where customers are arriving according to the batch Markovian arrival process (BMAP). The service time is considered to be generally distributed and is dependent on the queue length at service initiation epoch. The stationary queue length distribution at various epoch is obtained using the embedded Markov chain technique and the supplementary variable technique. A computational procedure has been discussed by considering phase-type service time distribution. Finally, some numerical results are given to show the numerical compatibility of the analytical results. Also a comparative study is carried out to establish the fact that our model may help in optimizing system performance by controlling the service rate depending on the state of the system.
KeywordsBatch Markovian arrival process Blocking probability Congestion Queue length dependent service
The authors thank the anonymous referee for their valuable comments. The second author acknowledges the Department of Science and Technology (DST), Govt. of India, for the partial financial support under the project grant \(SB/FTP/MS-048/2013\).
- 3.Dudin, A., Klimenok, V.: Queueing system \(BMAP/G/1\) with repeated calls. Math. Comput. Modell. 30(34), 115–128 (1999)Google Scholar
- 14.Neuts, M.F., Li, J.-M.: An algorithm for the \(P(n, t)\) matrices of a continuous BMAP. In: Chakravarthy, S.R., Alfa, A.S. (eds.) Matrix-Analytic Methods in Stochastic Models. Marcel Dekker (1996)Google Scholar