Спектральна оцінка сумарного потоку в ієрархічній mesh мережі великої розмірності з фрактальною топологією рівня доступу

Abstract

Grounded synthesis of multi-network structure in the form of large-scale fractal graph of cyclically repeating structures. The method otsinyuvannnya hierarchical structure mesh networking using spectral estimation flow additive cost function. The complexity of calculating the values of spectral graph network is that the major networks are not effective direct methods and iterative methods have long-term convergence. Using graph representation of a virtual fractal structure calculated spectrum allocated at each level of the hierarchy. This has allowed to reduce the solution of linear algebraic equations to graph with n l tops the order not higher than n.