Abstract
We consider a finite-buffer single-server queue with renewal input where the service is provided in batches of random size according to batch Markovian service process (BMSP). Steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs have been obtained along with some important performance measures. The model has potential applications in the areas of computer networks, telecommunication systems, and manufacturing systems, etc.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. J. Albores-Velasco, and F. S. Tajonar-Sanabria, “Anlysis of the GI/MSP/c/r queueing system,” Information Processing vol.4 pp. 46–57, 2004.
T. P. Bagchi, and J. G. C. Templeton, “Finite waiting space bulk queueing system,” Journal of Engineering Mathematics vol. 7 pp. 313–317, 1973.
P. P. Bocharov, “Stationary distribution of a finite queue with recurrent flow and Markovian service,” Automation and Remote Control vol. 57 pp. 66–78, 1996.
P. P. Bocharov, C. D’Apice, A. Pechinkin, and S. Salerno, “The stationary characteristics of the G/MSP/1/r queueing system,” Automation and Remote Control vol. 64 pp. 288–301, 2003.
G. Brière, and M. L. Chaudhry, “Computational analysis of single server bulk-service queues, M/G Y/1,” Advances in Applied Probability vol. 21 pp. 207–225, 1989.
S. Chakravarthy, “A finite capacity GI/PH/1 queue with group services,” Naval Research Logistics vol. 39 pp. 345–357, 1992.
S. Chakravarthy, “Analysis of a finite MAP/G/1 queue with group services,” Queueing Systems vol. 13 pp. 385–407, 1993.
V. V. Chaplygin, “The mass-service G/BMSP/1/r (In Russian),” Information Processes vol. 3 pp. 97–108, 2003.
M. L. Chaudhry, and J. G. C. Templeton, A First Course in Bulk Queues, Wiley, New York, 1983.
M. L. Chaudhry, U. C. Gupta, and B. R. Madil, “Computational aspects of bulk-service queueing system with variable capacity and finite waiting space: M/G Y/1/N + B,,” Journal of Operations Research Society of Japan vol. 34 pp. 404–421, 1991.
A. Economou, and D. Fakinos, “On the stationary distribution of GI X/M Y/1 queueing system,” Stochastic Analysis and Applications vol. 21 pp. 559–565, 2003.
W. K. Grassmann, M. I. Taksar, and D. P. Heyman, “Regenerative analysis and steady state distributions for Markov chains” Operations Research vol. 33 pp. 1107–1116, 1985.
U. C. Gupta, and A. D. Banik “Complete analysis of finite and infinite buffer GI/MSP/1 queue—a computational approach,” Operations Research Letters vol. 35 pp. 273–280, 2006.
U. C. Gupta, and P. Vijaya Laxmi, “Analysis of MAP/G a,b/1/N queue,” Queueing Systems Theory Application vol. 38 pp. 109–124, 2001.
D. M. Lucantoni, “New results on the single server queue with a batch Markovian arrival process,” Stochactic Models vol. 7 pp. 1–46, 1991.
D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts, “A single-server queue with server vacations and a class of non-renewal process,” Advances in Applied Probability vol. 22 pp. 676–705, 1990.
F. Machihara, “A BMAP/SM/1 queue with service times depending on the arrival process,” Queueing Systems vol. 33, pp. 277–291, 1999.
M. F. Neuts, “A versatile Markovian point process,” Journal of Applied Probability vol. 16 pp. 764–779, 1979.
M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, Johns Hopkins Univ. Press, Baltimore, MD. 1981.
Q. Zhang, A. Heindl, E. Smirni, “Characterizing the BMAP/MAP/1 departure process via ETAQA truncation,” Stochastic Models vol. 21 pp. 821–846 2005.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Banik, A.D., Chaudhry, M.L. & Gupta, U.C. On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N . Methodol Comput Appl Probab 10, 559–575 (2008). https://doi.org/10.1007/s11009-007-9064-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-007-9064-0