82
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Analysis of a tandem queuing system with blocking and group service in the second node

ORCID Icon, ORCID Icon, ORCID Icon & ORCID Icon
Article: 2235270 | Received 17 Jan 2023, Accepted 29 Jun 2023, Published online: 19 Jul 2023

References

  • Asmussen, S. (2003). Applied probability and queues. Vol. 2, Springer: New York.
  • Balsamo, S., Persone, V. D. N., & Inverardi, P. (2003). A review on queueing network models with finite capacity queues for software architectures performance prediction. Performance Evaluation, 51(2-4), 269–288. https://doi.org/10.1016/S0166-5316(02)00099-8
  • Banik, A. D. (2009). Queueing analysis and optimal control of BMAP/G(a,b)/1/N and BMAP/MSP(a,b)/1/N systems. Computers and Industrial Engineering, 57(3), 748–761. https://doi.org/10.1016/j.cie.2009.02.002
  • Baumann, H., & Sandmann, W. (2017). Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers. European Journal of Operational Research, 256(1), 187–195. https://doi.org/10.1016/j.ejor.2016.07.035
  • Bladt, M., & Nielsen, B. F. (2017). Matrix-exponential distributions in applied probability. Boston: Springer.
  • Breuer, D., Dudin, A. N., Klimenok, V. I., & Tsarenkov, G. V. (2004). A Two-Phase BMAP/G/1/N→∙PH/1/M1 system with blocking. Automation and Remote Control, 65(1), 104–115. https://doi.org/10.1023/B:AURC.0000011694.78809.a0
  • Chakravarthy, S. R. (1992). A finite capacity GI/PH/1 queue with group services. Naval Research Logistics, 39, 345–357. https://doi.org/10.1002/(ISSN)1520-6750
  • Chakravarthy, S. R. (1993). Analysis of a finite MAP/G/1 queue with group services. Queuing Systems: Theory and Applications, 13(4), 385–407. https://doi.org/10.1007/BF01149262
  • Chakravarthy, S. R. (1995). Two finite queues in series with nonrenewal input and group services. Proceedings of the Seventh International Symposium on Applied Stochastic Models and Data Analysis, 78–87.
  • Chakravarthy, S. R. (2001). The batch Markovian arrival process: A review and future work. In Advances in Probability Theory and Stochastic Processes, Eds., A. Krishnamoorthy, et.al., Notable Publications, Inc., New Jersey, 21–49.
  • Chakravarthy, S. R. (2010). Markovian arrival processes. Wiley Encyclopedia of Operations Research and Management Science. Published Online: 15 JUN 2010.
  • Chakravarthy, S. R. (2022). Introduction to matrix-analytic methods in queues 1: Analytical and simulation approach basics. New York: ISTE Ltd, London and John Wiley and Sons.
  • Chakravarthy, S. R. (2022). Introduction to matrix-analytic methods in queues 2: Analytical and simulation approach queues and simulation. New York: ISTE Ltd, London and John Wiley and Sons.
  • Chakravarthy, S. R., & Rumyantsev, A. (2021). Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance. Methodology and Computing in Applied Probability, 23(4), 1551–1579. https://doi.org/10.1007/s11009-020-09828-4
  • Claeys, D., Steyaert, B., Walraevens, J., Laevens, K., & Bruneel, H. (2013). Analysis of a versatile batch-service queueing model with correlation in the arrival process. Performance Evaluation, 70(4), 300–316. https://doi.org/10.1016/j.peva.2012.12.004
  • Cooper, T., Ezhilchelvan, P., & Mitrani, I. (2019). A queuing model of a stream-processing server. In 2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 27–35.
  • D'Arienzo, M. P., Dudin, A. N., Dudin, S. A., & Manzo, R. (2020). Analysis of a retrial queue with group service of impatient customers. Journal of Ambient Intelligence and Humanized Computing, 11(6), 2591–2599. https://doi.org/10.1007/s12652-019-01318-x
  • Dudin, A. N., Klimenok, V. I., & Vishnevsky, V. M. (2020). The theory of queuing systems with correlated flows. Springer Nature.
  • Dudin, S., Dudin, A., Kostyukova, O., & Dudina, O. (2020). Effective algorithm for computation of the stationary distribution of multi-dimensional level-dependent Markov chains with upper block-Hessenberg structure of the generator. Journal of Computational and Applied Mathematics, 366, 112425. https://doi.org/10.1016/j.cam.2019.112425
  • Dudin, S., & Dudina, O. (2019). Retrial multi-server queuing system with PHF service time distribution as a model of a channel with unreliable transmission of information. Applied Mathematical Modelling, 65, 676–695. https://doi.org/10.1016/j.apm.2018.09.005
  • Ghosh, S., Banik, A. D., & Walraevesn, J., et al. (2022). A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size phase-dependent bulk-service. 4OR Quarterly Journal of Operations Research, 20(2), 241–272. https://doi.org/10.1007/s10288-021-00478-x
  • Gnedenko, B. W., & Konig, D. (1983). Handbuch der bedienungstheorie. Berlin: Akademie Verlag.
  • Gómez-Corral, A. (2002). A tandem queue with blocking and Markovian arrival process. Queueing Systems, 41(4), 343–370. https://doi.org/10.1023/A:1016235415066
  • Govil, M. K., & Fu, M. C. (1999). Queueing theory in manufacturing: A survey. Journal of Manufacturing Systems, 18(3), 214–240. https://doi.org/10.1016/S0278-6125(99)80033-8
  • Graham, A. (1981). Kronecker products and matrix calculus with applications. Cichester: Ellis Horwood.
  • Grassmann, W. K., & Drekic, S. (2000). An analytical solution for a tandem queue with blocking. Queueing Systems, 36(1/3), 221–235. https://doi.org/10.1023/A:1019139405059
  • He, Q-M. (2014). Fundamentals of matrix-analytic methods. New York: Springer-Verlag.
  • Hillier, F. S., & So, K. C. (1995). On the optimal design of tandem queueing systems with finite buffers. Queueing Systems, 21(3-4), 245–266. https://doi.org/10.1007/BF01149164
  • Horn, R. A., & Johnson, C. R. (1991). Topics in matrix analysis. Cambridge, UK: Cambridge University Press.
  • Kim, C., Dudin, A., Dudin, S., & Dudina, O. (2013). Tandem queueing system with impatient customers as a model of call center with interactive voice response. Performance Evaluation, 70(6), 440–453. https://doi.org/10.1016/j.peva.2013.02.001
  • Kim, C., Dudin, A., Klimenok, V., & Taramin, O. (2011). A tandem BMAP/G/1/→∙M/N/0 queue with group occupation of servers at the second station. Mathematical Problems in Engineering, 913, 17. https://doi.org/10.1155/2012/324604
  • Kim, C. S., Park, S. H., Dudin, A., Klimenok, V., & Tsarenkov, G. (2010). Investigation of the BMAP/G/1→∙/PH/1/M tandem queue with retrials and losses. Applied Mathematical Modelling, 34(10), 2926–2940. https://doi.org/10.1016/j.apm.2010.01.003
  • Klimenok, V. I., & A. N. Dudin (2006). Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 54(4), 245–259. https://doi.org/10.1007/s11134-006-0300-z
  • Latouche, G., & Neuts, M. F. (1980). Efficient algorithmic solutions to exponential tandem queues with blocking. SIAM Journal on Algebraic Discrete Methods, 1(1), 93–106. https://doi.org/10.1137/0601013
  • Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. SIAM.
  • Lucantoni, D. (1991). New results on the single server queue with a batch Markovian arrival process. Stochastic Models, 7(1), 1–46. https://doi.org/10.1080/15326349108807174
  • Lucantoni, D. Meier-Hellstern (1990). A single-server queue with server vacations and a class of nonrenewal arrival processes. Advances in Applied Probability, 22(3), 676–705. https://doi.org/10.2307/1427464
  • Naumov, V., Gaidamaka, Y., Yarkina, N., & Samouylov, K. (2021). Matrix and analytical methods for performance analysis of telecommunication systems. Springer Nature.
  • Neuts, M. F. (1968). Two queues in series with a finite, intermediate waitingroom. Journal of Applied Probability, 5(1), 123–142. https://doi.org/10.2307/3212081
  • Neuts, M. F. (1979). A versatile Markovian point process. Journal of Applied Probability, 16(4), 764–779. https://doi.org/10.2307/3213143
  • Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models. Baltimore: The Johns Hopkins University Press.
  • Neuts, M. F. (1989). Structured stochastic matrices of M/G/1 type and their applications. Marcel Dekker.
  • Neuts, M. F. (1992). Models based on the Markovian arrival processes. IEICE Transactions on Communications, 75(12), 1255–1265.
  • Nikoui, T. S., Rahmani, A. M., Balador, A., & Javadi, H. H. S. (2022). Analytical model for task offloading in a fog computing system with batch-size-dependent service. Computer Communications, 190, 201–215. https://doi.org/10.1016/j.comcom.2022.04.010
  • Perros, H. G. (1989). A bibliography of papers on queueing networks with finite capacity queues. Performance Evaluation, 10(3), 255–260. https://doi.org/10.1016/0166-5316(89)90015-1
  • Reddy, G. K., Nadarajan, R., & Kandasamy, P. R. (1992). A tandem queue with general bulk service and servers' ‘vacation’. Computers in Industry, 20(3), 345–354. https://doi.org/10.1016/0166-3615(92)90083-Y
  • Steeb, W-H., & Hardy, Y. (2011). Matrix calculus and Kronecker product. Singapore: World Scientific Publishing.
  • Wu, K., Shen, Y., & Zhao, N. (2017). Analysis of tandem queues with finite buffer capacity. IISE Transactions, 49(11), 1001–1013. https://doi.org/10.1080/24725854.2017.1342055

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.