Open AccessCONTROL OF LOAD OF THE COMMUNICATION NETWORK WITH VIRTUAL FRAGMENTATION AND TAKING INTO ACCOUNT THE CURRENT «COMPOSITION» OF OVERLOADED FRAGMENTS
Author(s) -
Oleksandr Lehenkov,
Tetiana Labutkina
Publication year - 2021
Publication title -
ìnformacìjnì tehnologìï v metalurgìï ta mašinobuduvannì
Language(s) - English
Resource type - Journals
ISSN - 2708-0102
DOI - 10.34185/1991-7848.itmm.2021.01.030
Subject(s) - network packet , load balancing (electrical power) , computer science , fragment (logic) , set (abstract data type) , fragmentation (computing) , abstraction , distributed computing , topology (electrical circuits) , computer network , mathematics , algorithm , grid , combinatorics , geometry , philosophy , epistemology , programming language , operating system
The problems of network load management for a generalized version of a large packet switching network are investigated. The network is divided into elementary fragments according to the selected rule. Data routing is "flat" (not hierarchical). Abstraction is used - a set of network fragments can be represented as a set of networked elements. For each fragment, a significant indicator of its load (for example, the average load of its nodes or another) is defined. The limit of this indicator is set, which provides the definition of an elementary fragment as a fragment with an increased load. In the entered imaginary "network of fragments" there are connected groups of fragments with the increased loading. For groups of elementary fragments with high load, modifications of the load control method are used due to the choice of the lowest cost paths, in which the routing takes into account the node's belonging to the fragments with high load.