Loading...
Analysis of Queueing Networks in Equilibrium: Numerical Steady-State Solutions of Markov Chains
Journal Title
International Journal of Interdisciplinary Telecommunications and Networking (IJITN)
Readers/Advisors
Journal Title
Term and Year
Publication Date
2020
Book Title
Publication Volume
Publication Issue
Publication Begin
Publication End
Number of pages
Research Projects
Organizational Units
Journal Issue
Abstract
Equilibria of queueing networks are a means for performance analysis of real communication networks introduced as Markov chains. In this paper, the authors developed, evaluated, and compared computational procedures to obtain numerical solutions for queueing networks in equilibrium with the use of direct, iterative, and aggregative techniques in steady-state analysis of Markov chains. Advanced computational procedures are developed with the use of Gaussian elimination, power iteration, Courtois’ decomposition, and Takahashi’s iteration techniques. Numerical examples are provided together with comparative analysis of obtained results. The authors consider these procedures are also applicable to other domains where systems are described with comparable queuing models and stochastic techniques are sufficiently relevant. Several suitable domains of applicability are proposed.
Citation
Lokshina, I. V. and Lanting, C. J. M. (2020). Analysis of Queueing Networks in Equilibrium: Numerical Steady-State Solutions of Markov Chains. International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global. Vol. 12(4), pp. 1-17. DOI: 10.4018/IJITN.2020100101.
Description
IGI GLOBAL AUTHORS, UNDER FAIR USE CAN: Post the final typeset PDF (which includes the title page, table of contents and other front materials, and the copyright statement) of their chapter or article (NOT THE ENTIRE BOOK OR JOURNAL ISSUE), on the author or editor's secure personal website and/or their university repository site. [Accessed 1/11/22 from https://www.igi-global.com/about/rights-permissions/content-reuse/]