Abstract
The Markov model of a two-stage queueing network with feedback is proposed. Poisson flows arrive to both stages from outside. A part of already serviced calls at the first node instantaneously enter the second node (if there is free space here) while the other calls leave the network. After the service is completed at the second node, there are three possibilities: (i) the call leaves the network; (ii) it instantaneously feeds back to the first node (if there is free space here); (iii) it feeds back to the first node after some delay in orbit. All feedbacks are determined by known probabilities. Both nodes have finite capacities. The mathematical model of the investigated network is a three-dimensional Markov chain, and a hierarchical space merging algorithm is developed to calculate its steady-state probabilities. The results of numerical experiments are demonstrated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Takacs, “A single-server queue with feedback,” Bell System Technical J., 42, 505–519 (1963).
A. Z. Melikov, L. A. Ponomarenko, and A. M. Rustamov, “Methods for analysis of queueing models with instantaneous and delayed feedbacks,” Communications in Computer and Information Sciences, 564, 185–199 (2015).
V. S. Koroliuk, A. Z. Melikov, L. A. Ponomarenko, and A. M. Rustamov, “Methods for analysis of multi-channel queueing models with instantaneous and delayed feedbacks,” Cybern, Syst. Analysis, 52, No. 1, 58–70 (2016).
O. Gemikonakli, E. Ever, and A. Kocyigit, “Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem,” J. of Computational and Applied Mathematics, 223, No. 1, 519–533 (2009).
Y. Kirsal, E. Gemikonakli, E. Ever, G. Mapp, and O. Gemikonakli, “An analytical approach for performance analysis of handoffs in the next generation integral cellular networks and WLANs,” in: Proc. 19th IEEE Intern. Conf. on Computer Communications and Networks, Zurich, Switzerland, Aug. 2–5, 2010 (2010), pp. 1–6.
E. Ever, O. Gemikonakli, A. Kocyigit, and E. Gemikonakli, “A hybrid approach to minimize state explosion problem for the solution of two stage tandem queues,” J. of Network and Computer Applications, 36, 908–926 (2013).
Y. Kirsal, E. Ever, A. Kocyigit, O. Gemikonakli, and G. Mapp, “A generic analytical modeling approach for performance evaluation of the handover schemes in heterogeneous environments,” Wireless Personal Communications, 79, 1247–1276 (2014).
Y. Kirsal, E. Ever, A. Kocyigit, O Gemikonakli, and G. Mapp, “Modeling and analysis of vertical handover in highly mobile environments,” J. of Supercomputing, 71, 4352–4380 (2015).
C. S. Kim, V. I. Klimenok, and A. N. Dudin, “Priority tandem queueing system with retrials and reservation of channels as a model of call center,” Computers and Industrial Engineering, 96, 61–71 (2016).
G. Ciardo and E. Smirni, “ETAQA: An efficient technique for the analysis of QBD-processes by aggregation,” Performance Evaluation, 36–37, 71–93 (1999).
G. Ciardo, W. Mao, A. Riska, and E. Smirni, “ETAQA-MG1: An efficient technique for the analysis of a class M/G/1-type processes by aggregation,” Performance Evaluation, 57, 235–260 (2004).
I. Mitrani and R. Chakka, “Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method,” Performance Evaluation, 23, 241–260 (1995).
I. Mitrani, “Approximate solutions for heavily loaded Markov-modulated queues,” Performance Evaluation, 62, 117–131 (2005).
R. Chakka, “Spectral expansion solution for some finite capacity queues,” Annals of Oper. Research, 79, 27–44 (1998).
V. I. Klimenok and A. N. Dudin, “Multi-dimensional asymptotically quasi-Teoplitz Markov chains and their application in queueing theory,” Queueing Systems, 54, 245–259 (2006).
M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, John Hopkins Univ. Press, Baltimore (1981).
T. T. Hung and T. V. Do, “Computational aspects for steady state analysis of QBD processes,” Periodica Polytechnica, Ser. Electrical Engineering, 44, Issue 2, 179–200 (2001).
H. Baumann and W. Sandmann, “Numerical solution of level dependent QBD processes,” Procedia Computer Science, 1, 1555–1563 (2010).
L. D. Servi, “Algorithmic solution of two-dimensional BDP with application to capacity planning,” Telecommunication Systems, 21, Issue 2–4, 205–212 (2002).
J. Ye and S. Q. Li, “Folding algorithm: A computational method for finite QBD processes with level dependent transitions,” IEEE Trans. on Communications, 42, 625–639 (1994).
V. De Nitto Persone and V. Grassi, “Solution of finite QBD processes,” Applied Probability, 33, 1003–1010 (1996).
L. Ponomarenko, C. S. Kim, and A. Melikov, Performance Analysis and Optimization of Multi-Traffic on Communication Networks, Springer, Heidelberg–Dortrecht–London–New York (2010).
V. S. Korolyuk and V. V. Korolyuk, Stochastic Models of Systems, Kluwer, Boston (1999).
C. Liang and H. Luh, “Cost estimation queuing model for large-scale file delivery service,” Intern. J. of Electronic Commerce Studies, 2, Issue 1, 19–34 (2011).
C. Liang and H. Luh, “Optimal services for content delivery based on business priority,” J. of the Chinese Institute of Engineers, 36, Issue 4, 422–440 (2013).
C. Liang and H. Luh, “Efficient method for solving a two-dimensional Markov chain model for call centers,” Industrial Management & Data Systems, 115, Issue 5, 901–922 (2015).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2016, pp. 40–52.
Rights and permissions
About this article
Cite this article
Melikov, A.Z., Ponomarenko, L.A. & Rustamov, A.M. Hierarchical Space Merging Algorithm for the Analysis of Open Tandem Queueing Networks. Cybern Syst Anal 52, 867–877 (2016). https://doi.org/10.1007/s10559-016-9888-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-016-9888-0