Entropy calculation for networks with determined values of flows in nodes
Authors:
- Yuriy Fedkovych Chernivtsi National UniversityYUYuriy Fedkovych Chernivtsi National University
- R. L. PolitanskyiRPR. L. Politanskyi
- Y. Y. BobaloYBY. Y. Bobalo
- Lviv Polytechnic National UniversityLULviv Polytechnic National University
- O. L. ZarytskaOZO. L. Zarytska
- M. D. KiselychnykMKM. D. Kiselychnyk
- M. V. VistakMVM. V. Vistak
- Danylo Halytsky Lviv National Medical UniversityDUDanylo Halytsky Lviv National Medical University
- 1 January 2022
- journal article
- research article
- Published by Lviv Polytechnic National University in Mathematical Modeling and Computing
- Vol. 9 (4) , 936-944
Abstract
The paper analyses a network with given input and output flows in each of its nodes. The basis of this analysis is the algorithm for determining the set of solutions of the linear equations system, using the Gaussian method. The power of the set determines the structural entropy of the system. By introducing uncertainty into the value of part of the information flows, the deviation of the network from its equilibrium state is simulated. The set of potential solutions, as a part of the total set of the system solutions, determines the statistical entropy of the system. The probability entropy is calculated for a network with four nodes and a total flow of 10 erlangs with a sampling step of 1 erlang. Calculated entropy values for 1, 2, 3, and 4 uncertain flows out of a total of 16 flows that are transmitted between nodes of the fully connected network. As a result of the conducted statistical analysis of entropy values, the optimal number of statistical intervals for entropy values is determined: 4, 11, 24, and 43 intervals for 1, 2, 3, and 4 uncertain flows, respectively. This makes it possible to highlight the set of flows in the system that have the greatest influence on the entropy value in the system. The obtained results are of practical importance, as they enable the detection of deviations of the network from its equilibrium state by monitoring the passage of traffic on individual branches of a complex telecommunication network. Since, as shown in our previous works, the task of determining the complete set of solutions of the system for the number of nodes greater than 4 has a significant computational complexity, the application of the algorithm to such networks requires an increase in the discretization step of the values of information flows in the network. Another way to reduce computational complexity can be to reduce the set of analysed solutions to a subset of solutions close to the equilibrium state of the system.Keywords
This publication has 18 references indexed in Scilit:
- A Tensor Based Framework for Multi-Domain Communication SystemsIEEE Open Journal of the Communications Society, 2020
- Analysis of Using of Fractal Signals for Noise Immune Information Transmission Systems2020
- Generalized Approach to Analysis of Multifractal Properties from Short Time SeriesInternational Journal of Advanced Computer Science and Applications, 2020
- Maximum Entropy Analysis of Flow Networks: Theoretical Foundation and ApplicationsEntropy, 2019
- Structural Entropy: Monitoring Correlation-Based Networks Over Time With Application To Financial MarketsScientific Reports, 2019
- Enhanced method of fast re-routing with load balancing in software-defined networksJournal of Electrical Engineering, 2017
- A Load Balancing Algorithm Based on Maximum Entropy Methods in Homogeneous ClustersEntropy, 2014
- Digital Video Processing2012
- Introduction to Modern Traffic Flow Theory and Control2009
- Calculating Maximum Entropy Flows in NetworksJournal of the Operational Research Society, 1993