Modeling the dynamics of information flows in the routes of computer networks
Keywords:
data transmission dynamics, information flows, deadlock-free routes, wormhole routing techniques, weight characteristics, transient characteristics, data accumulation process, route modelsAbstract
Introduction: For the development of modern highly specialized software systems for designing wormhole routing networks, it is necessary to compile routing tables. This requires obtaining efficient configurations of deadlock-free routes laid at the initial stages of network design. Purpose: To make the simulation of the dynamics of inertial processes of data accumulation in the receiving nodes of computer networks during the transmission of packets from transmitter nodes. Results: Three examples of network schemes are obtained, which allows us to consider classical network structures with different degrees of computational load. For each network, we construct matrices that describe its structure. As a result of the simulation, using specially developed scenarios in the mathematical software, we have demonstrated the resulting graphs of weight and transient characteristics and provide a number of characteristics of each route under study. The simulation carried out makes it possible to make sure that there is no information collapse of the routes laid in deadlock-free routes. A separate study of two simultaneously functioning data transmission paths in a network with “worm” switching also shows stable transient characteristics, which thus indicates the correctness of the proposed dynamic models and the deadlock-free wormhole routes themselves. Practical relevance: The results of the study can be applied for the design of computer networks with the use of specialized software. Dynamic performance analysis is intended to help in making decisions about the choice of deadlock-free routes offered by a designer of a wormhole switching network.