Synthesis of the topological structure of a self-healing and scalable data network segment

An approach is proposed to reduce the load on the backbone channels of the data network. The scientific novelty lies in the improvement of the method for reducing the load of backbone channels by synthesizing the topological structure of its segments, which have the properties of local self-healing and scalability, and segment recovery and scaling occur without access to the backbone channels of the main network. The following tasks were solved: the structure of the primary regular communication network was formed, assuming the possibility of self-recovery; an algorithm for the formation of a secondary communication network of a local segment based on the existing primary regular network has been developed; the principles of local scaling are formulated; a method for local scaling of the topological structure of data transmission network segments is proposed; the comparative analysis of the load of the main channels of the data transmission network was carried out using the standard and the proposed variants of the synthesis of its local components. A regular graph with a given connectivity is used as the initial structure. Further transformations were carried out using a modified combinatorial optimization method. The topological features of the "grid" type graph are used to scale the segment. With a large number of segment switching nodes, the additional load on the trunk channels increases with the proposed approach more slowly than with the standard one. The main computational difficulties arise when applying the method of indefinite Lagrange multipliers. Therefore, the development of this study may consist in reducing the computational complexity of the algorithm for forming a secondary communication network of the segment under consideration.