FIELD: physics.
SUBSTANCE: invention relates to routing means for determining an optimum route. Searching for optimal routes, where the shortest paths to each communication node within the network are calculated, where the cost of passing the graph arm is determined by the speed of the transit network corresponding to the arm, where in the presence of several paths between communication nodes, that path will be selected, the total cost of the traversed arms of which will be the least, and the cost of the arm is determined COST = 1,000,000,000,000 / SPEED, where SPEED is the speed of the network interface in bits per second, and the cost of passing each arm is equal to the cost of passing through the transit network, starting from the vertex, which corresponds to the communication node performing the calculations, the shortest path to all communication nodes of the network segment is determined, where the cost of the path to each communication node (COSTR) is defined as the sum of the cost of all arms (transit subnetworks COSTtrnet), through which the path to the communication node passes, COSTR = COSTtrnet1 +COSTtrnet2+ COSTtrnet3 + … +COSTtrnetN, and determining the routes to the individual subnetworks, all the networks from the networks database (NDB) are successively searched and for each network the cost of the path to it (COSTNET) is determined as the sum of the path to the communication node to which the network is connected, plus the cost of entering this network, determined based on the sum of the speeds of all the interfaces of the communication node (COSTDNET), which are connected to this network COSTNET = COSTR + COSTDNET, after determination, the optimal routes to each subnet will be only the optimal COSTNET paths, and the corresponding optimal route record is added to the NDB memory.
EFFECT: provision of efficient, fast and low-cost in terms of computing resources determination of optimal route in data switching and IP-routing networks.
3 cl, 7 dwg
Title | Year | Author | Number |
---|---|---|---|
METHOD OF PROCESSING CHANGES IN ROUTING INFORMATION DURING DYNAMIC ROUTING | 2024 |
|
RU2824173C1 |
METHOD OF DISTRIBUTING ROUTING INFORMATION THROUGH DEDICATED COMMUNICATION CHANNELS IN IP NETWORKS | 2024 |
|
RU2827142C1 |
METHOD FOR CHECKING THE CONNECTIVITY OF NETWORK NODES USING A DEDICATED COMMUNICATION CHANNEL | 2022 |
|
RU2796650C1 |
DEVICE AND METHOD FOR PERFORMING HIGH-SPEED SEARCH FOR ROUTES OF INTERNET PROTOCOL AND CONTROLLING ROUTING/TRANSFER TABLES | 2001 |
|
RU2233473C2 |
DATA BLOCKS IN THE SWITCHED NETWORK MULTI-ROUTING METHOD | 2018 |
|
RU2678470C1 |
METHOD, DEVICE AND SYSTEM FOR ROUTING DATA BETWEEN NETWORK SEGMENTS | 2010 |
|
RU2544766C2 |
METHOD, RADIO SYSTEM AND BASE STATION | 2008 |
|
RU2497307C9 |
CREATION OF VIRTUAL NETWORKS COVERING MANY PUBLIC CLOUDS | 2018 |
|
RU2766313C2 |
METHOD OF ROUTING IN COMMUNICATION NETWORK WITH HIGH PROBABILITY OF FAILURE OF ITS ELEMENTS | 2023 |
|
RU2814686C1 |
METHOD FOR STABLE DATA ROUTING IN A VIRTUAL COMMUNICATION NETWORK | 2021 |
|
RU2757781C1 |
Authors
Dates
2025-05-19—Published
2024-12-05—Filed