On the algorithmization of construction of the transition intensity matrix in systems with a large number of same elements
Journal: Discrete and Continuous Models and Applied Computational Science (Vol.31, No. 4)Publication Date: 2024-04-01
Authors : Sergey Matyushenko; Ivan Zaryadov;
Page : 332-344
Keywords : queuing system; dynamic construction of transition intensity matrix; systems with reordering of requests;
Abstract
In this article, using the example of a multi-channel exponential queueing system with reordering of requests, we study the problem of computer construction of the state space and coefficient matrix of a system of equilibrium equations. As a result, general principles for solving problems of this type are formulated.
Other Latest Articles
- Chronology of the development of Active Queue Management algorithms of RED family. Part 1: from 1993 up to 2005
- Alleen Pace Nilsen and Don L.F. Nilsen. 2019. The Language of Humor. Cambridge: CUP
- Anatoly P. Chudinov, Edward V. Budaev & Olga A. Solopova. 2023. Political Metaphorology: Cognitive and Discursive Studies 政治隐喻学 认知-话语研究. Peking University Press
- Modern metaphor research in Russia: Trends, schools and results
- Metaphor power in the context of the author’s opinion expression and perception
Last modified: 2024-04-01 17:50:30