Synthesis of the matrix of transitional probabilities of the final markov chain describing process of information exchange in the point-to-point connection of method of fictitious states

A feature of the information exchange process in data transmission networks in a complex interference environment is its randomness. Traditionally, such processes are modeled on the basis of the apparatus of the theory of finite Markov chains. At the same time, the classical approach to determining the characteristics of the message delivery process does not allow taking into account real time. This disadvantage is eliminated using the dummy state method. In this paper, on the basis of a system analysis, we have revealed the regularities of constructing a matrix of transition probabilities of an absorbing finite Markov chain using the dummy state method when simulating the process of delivering message packets through data transmission networks with a point-to-point connection. Construction regularities made it possible to formulate the rules for the automated synthesis of this matrix. The use of the proposed rules for finding the probabilistic-temporal characteristics of information exchange between network nodes is considered.