CN117097664B - Routing networking method, system and medium suitable for high-pressure environment - Google Patents
Routing networking method, system and medium suitable for high-pressure environment Download PDFInfo
- Publication number
- CN117097664B CN117097664B CN202311333856.6A CN202311333856A CN117097664B CN 117097664 B CN117097664 B CN 117097664B CN 202311333856 A CN202311333856 A CN 202311333856A CN 117097664 B CN117097664 B CN 117097664B
- Authority
- CN
- China
- Prior art keywords
- routing
- node
- nodes
- route
- load
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 230000006855 networking Effects 0.000 title claims abstract description 27
- 230000005540 biological transmission Effects 0.000 claims abstract description 31
- 238000004364 calculation method Methods 0.000 claims description 10
- 230000002093 peripheral effect Effects 0.000 claims description 8
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 6
- 238000004422 calculation algorithm Methods 0.000 claims description 6
- 230000002829 reductive effect Effects 0.000 claims description 6
- 238000012546 transfer Methods 0.000 claims description 4
- 230000002238 attenuated effect Effects 0.000 claims description 3
- 238000004590 computer program Methods 0.000 claims description 3
- 239000002360 explosive Substances 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 2
- 230000001360 synchronised effect Effects 0.000 claims description 2
- 238000011217 control strategy Methods 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000001276 controlling effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000001105 regulatory effect Effects 0.000 description 2
- ODCKICSDIPVTRM-UHFFFAOYSA-N [4-[2-hydroxy-3-(propan-2-ylazaniumyl)propoxy]naphthalen-1-yl] sulfate Chemical compound C1=CC=C2C(OCC(O)CNC(C)C)=CC=C(OS(O)(=O)=O)C2=C1 ODCKICSDIPVTRM-UHFFFAOYSA-N 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000670 limiting effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/036—Updating the topology between route computation elements, e.g. between OpenFlow controllers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/39—Credit based
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the technical field of computer science and information technology, in particular to a routing networking method, a system and a medium suitable for a high-pressure environment, wherein the core content comprises that a central routing server collects the states of all routing nodes and transmits updated information to all routing nodes; calculating the optimal route path from each route node to other nodes in advance, and updating the optimal route path to all route nodes in the network; acquiring congestion and load conditions of all routing nodes in a network, evaluating the performance of all routing nodes, and setting warning values of the routing nodes; and when the warning value is reached, acquiring the existing passing path of the routing node. The central routing server collects the current use condition of each node router, and any router in the network can acquire the optimal routing table of the current network at any moment by distributing the dynamic routing table, so that the maximum transmission performance of the network is improved.
Description
Technical Field
The invention relates to the technical fields of computer science and information technology, in particular to a routing networking method, a routing networking system and a routing networking medium suitable for a high-pressure environment.
Background
The present invention relates to the fields of computer science and information technology, and in particular to technology related to network communication. Routing is critical for network transmission, and data needs to be forwarded through a router when the data needs to reach a destination safely and quickly; the invention fully mobilizes the performances of all routers in the networking through the advanced networking structure and algorithm, and realizes the maximization of the communication capacity of the whole network.
In a traditional network environment, a routing algorithm mainly comprises a static routing and a dynamic routing, a router takes a routing table through the two methods, and data are packetized and then sent according to the routing table. In this process, there may be a problem that the very individual routers are overloaded, resulting in transmission timeout, and such transmission problem triggers retransmission after timeout, resulting in more serious network congestion. Meanwhile, after the sender adopts a timeout transmission strategy, the sending rate can be reduced, and the transmission efficiency of the network is affected.
The interconnections between all devices all rely on the network to transfer data. However, with the increasing number of devices, the pressure and day-to-day increases in data transmission, under the vast data transmission pressures, some nodes in the network may send congestion, thereby affecting all data transmissions through the node. In this original mode, data transmission is greatly hindered.
In the prior art, a transmitting end manages and controls the transmitting flow through a TCP congestion control algorithm, repeatedly probing and adjusting the quantity of transmitted packets through the TCP congestion control algorithm, and controlling the data quantity at the maximum point which can be born by a routing path. However, this transmission method requires a large number of retransmission attempts, and since the user of the routing node is likely to be more than one party, it is easy to cause a situation that some routing nodes are too much used and some routing nodes are too low in use, which is called a situation that the routing nodes operate in a high pressure environment.
To sum up, the prior art optimizes the network congestion problem: the traditional dynamic route configuration routing table has the advantages that the router collects and records route information, the collected information is relatively single and fixed, and the congestion of a router at a certain node on a transmission path can influence the transmission.
Transmission efficiency problem: due to uneven load of the transmission network, some routers may be overloaded, resulting in network congestion. This affects the transmission efficiency of the entire network.
Disclosure of Invention
The invention aims to provide a routing networking method, a system and a medium suitable for a high-pressure environment, which are used for solving the technical problems in the prior art.
The embodiment of the invention is realized by the following technical scheme:
in a first aspect, the present invention provides a routing networking method suitable for use in a high pressure environment, including;
collecting the states of all routing nodes, and transmitting updated information to all routing nodes;
calculating the optimal route path from each route node to other nodes in advance, and updating the optimal route path to all route nodes in the network;
acquiring congestion and load conditions of all routing nodes in the network by a polling mode, evaluating the performance of all routing nodes, and setting warning values of the routing nodes;
when a certain routing node reaches an alarm value, the existing passing path of the routing node is acquired, and the pressure part of the existing passing path is transferred to a suboptimal path through calculation.
In the embodiment of the invention, the set alert value of the routing node comprises a load alert value and a congestion alert value;
the load warning value comprises a regulation window, wherein the regulation window comprises an upper threshold and a lower threshold;
when the load of the routing node reaches the upper threshold of the regulation window, the routing node triggers an alarm to share the pressure;
when the load of the routing node is at the lower threshold of the regulation window, the condition of the routing node is obtained, and the pressure of the routing node for bearing the nearby high load is planned and distributed;
the congestion warning value comprises the step of setting the credit value of the routing node to be 0 or X, wherein when the credit value is 0, the routing node is full, and when the credit value is X, the node is idle, and X is not 0.
In an embodiment of the invention, said transferring the pressure portion thereof to the suboptimal path by calculation comprises;
when a certain route node load is in an upper threshold or the credit value of the route node is 0, the route node load is over-loaded or congestion occurs, and the route information is redrawn;
creating a zero-time topological graph, wherein the network topological graph does not contain the node, redrawing an optimal routing path from a routing node to the routing node according to the topological graph, and distributing the information to other regulatable routing nodes in the network according to a load regulation strategy;
after the other routing nodes receive the new routing information, updating the routing table of the other routing nodes, and the routing nodes after data updating lose paths passing through the routing nodes, and the routing nodes which do not receive the randomly transmitted routing information can still transmit the data to the routing nodes.
In an embodiment of the present invention, the distributing the pressure of the route node which receives the nearby high load by the plan further comprises;
the central routing server monitors the peripheral nodes according to the network topology owned by the routing node;
if the peripheral node is in the low load condition as well, the routing node will maintain the existing routing table;
if the load of a certain routing node appears nearby and is in the regulation window, the route is re-planned according to the network topology, and the route which is partially passed through the routing node and is modified and added with five distance units or two hops is transferred to the idle routing node.
In the embodiment of the invention, the method also comprises the step that the central routing server regulates and controls the pressure of the congested routing node;
if a certain routing node obtains a load with explosive growth to cause the node to be congested, the credit value of the routing node is directly set to 0;
after receiving the credit value of the routing node, immediately responding, gradually synchronizing the previously stored alternative routing information to surrounding routing nodes, and starting a credit value based on the maximum credit for waiting for a plurality of times around each synchronization;
after the credit value time passes, the routing node will continue to synchronize the new modified routing path to the surrounding routing nodes, provided the routing node does not relieve the congestion alarm.
In the embodiment of the invention, the method also comprises the calculation of the route path distance;
defining a hop with minimum transmission time between two adjacent routers as a distance unit;
the distances between all the other routing nodes are based on the fact that the unification in the time of twice one distance unit is two distance units, the unification in the time of three times of one distance unit is three distance units, and so on.
In an embodiment of the present invention, further comprising;
when the individual routing nodes trigger the warning value after sharing the routing information, the sharing routing information is not shared, and the optimal routing information passing through the routing nodes is shared.
In an embodiment of the present invention, further comprising;
waiting for credit time when congestion alarm occurs, if the congestion alarm is not released, waiting again, setting the credit value to be twice that of congestion at the moment, and the like;
when the congestion state is relieved in a certain time of credit, the credit value is set to be one half of the credit at the moment;
the credit value is continuously attenuated in the subsequent time, and in the non-congestion state, the credit value is reduced by a plurality of values every time when one credit passes, and meanwhile, a piece of shared routing information is recovered.
In a second aspect, the present invention further provides a routing networking system applicable to a high-pressure environment, which is roughly divided into the following parts.
The collecting device is configured to collect the states of all routing nodes and transmit updated information to all routing nodes;
the computing device is configured to pre-calculate the optimal routing paths from each routing node to other nodes and update the optimal routing paths to all routing nodes in the network;
the node condition acquisition device is configured to acquire congestion and load conditions of all routing nodes in the network by a polling mode, evaluate the performance of all routing nodes and set an alarm value of the routing nodes;
the distribution device is configured to acquire the existing passing path of the routing node when reaching the warning value, and transfer the pressure part of the existing passing path to the suboptimal path through calculation;
the central server is connected with the acquisition device, the computing device, the node condition acquisition device and the distribution device and is used for executing the routing networking method applicable to the high-pressure environment.
In a third aspect, the present invention further provides a computer readable storage medium, where a computer program is stored, where the computer program, when executed by a processor, implements a routing networking method applicable to a high-pressure environment as described above.
The technical scheme of the embodiment of the invention has at least the following advantages and beneficial effects:
1. congestion reduction: compared with the traditional route networking, the invention can achieve the purpose of quickly recovering congestion and slowly placing the transmission link in a stable state by regulating and controlling the central route server when congestion occurs and sharing out the pressure.
2. Load balancing: the invention adopts a load monitoring method to collect the load condition of each node in the whole routing network, thereby optimizing the routing path of the routing node nearby and providing a relatively balanced and reasonable rapid transmission network for the whole network.
3. Adaptivity: the self-adaptive routing networking can automatically allocate and optimize the load of the whole network in a simple mode, so that the environment can automatically cope with sudden network congestion and simultaneously can avoid the network congestion to a great extent.
In summary, compared with the prior art, the adaptive routing networking of the invention can provide a good and stable transmission network through congestion reduction control and load balancing control under a high-pressure environment, reduce the retransmission rate, and adapt to many complex network conditions, so that the invention is more excellent and reliable in the high-pressure and high-reliability network environment.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
The division of the modules presented in this application is a logical division, and there may be other manners of division in practical application, for example, multiple modules may be combined or integrated in another system, or some features may be omitted, or not performed.
The modules or sub-modules described separately may or may not be physically separate, may or may not be implemented in software, and may be implemented in part in software, where the processor invokes the software to implement the functions of the part of the modules or sub-modules, and where other parts of the templates or sub-modules are implemented in hardware, for example in hardware circuits. In addition, some or all of the modules may be selected according to actual needs to achieve the purposes of the present application.
Referring to fig. 1, the present invention provides a routing networking method suitable for a high-pressure environment, including;
s101: collecting the states of all routing nodes, and transmitting updated information to all routing nodes;
the network is monitored by a central routing server for the status of the whole network, which collects and analyzes the status of all routing nodes and transmits the analyzed processing information to all routing nodes.
S102: calculating the optimal route path from each route node to other nodes in advance, and updating the optimal route path to all route nodes in the network;
the central routing server always controls the entire routing network, and it calculates in advance the optimal routing path from each routing node to other nodes, and updates the optimal routing path to all routing nodes in the network.
S103: the central routing server obtains congestion and load conditions of all routing nodes in the network by a polling mode, evaluates the performance of all routing nodes and sets an alert value of the routing nodes; the polling in this embodiment is used to periodically query or check whether the status or data of a certain resource has changed. In polling, the program periodically sends a request to the resource, then waits for a response, and then sends the next request. Such methods may be used to monitor network connections, check file status, obtain sensor data, and so forth.
S104: when the warning value is reached, the existing passing path of the routing node is acquired, and the pressure part is transferred to the suboptimal path through calculation.
The central routing server monitors the service condition of routing nodes in the whole network, and distributes and adjusts the transmission capacity of the whole network according to the reporting condition of each routing node;
in the embodiment of the invention, the set alert value of the routing node comprises a load alert value and a congestion alert value;
the load warning value comprises a regulation window, wherein the regulation window comprises an upper threshold and a lower threshold;
the actual maximum throughput of the routing node is reported by the routing node, and 80% of the actual throughput is reached as an upper threshold according to the conventional convention. When a certain routing node exceeds the upper threshold, an alarm is reported to the central routing server, and above the alarm, the network congestion is considered. The central routing server starts to regulate and control the load after receiving the alarm. When the load is reduced below the upper threshold of the regulation window, the central routing server will gradually recover the original state of the routing node after taking the information.
The lower threshold of the regulation window is also reported to the central routing server through the routing node. When the central routing server obtains that the load of a certain node is in the lower limit of the regulation window, the central routing server searches for the peripheral node according to the network topology owned by the central routing server, and if the peripheral node is in the low load condition as well, the routing node keeps the existing routing table. When the load of a certain routing node appears nearby and is in the regulation window, the central routing server re-programs according to the network topology, and the routing path which partially passes through the routing node and is modified and added with five distance units or two hops is transferred to the idle routing node.
The congestion warning value comprises setting the credit value of the routing node to be 0 or X, when the credit value is 0, the routing node is full, and when the credit value is X, the node is idle, and X is not 0.
In one exemplary embodiment of the invention, said computationally transferring the pressure portion thereof to the suboptimal path comprises;
when a certain route node load is in an upper threshold or the credit value of the route node is 0, the route node load is over-loaded or congestion occurs, and the route information is redrawn;
creating a zero-time topological graph, wherein the network topological graph does not contain the node, redrawing an optimal routing path from a routing node to the routing node according to the topological graph, and distributing the information to other regulatable routing nodes in the network according to a load regulation strategy;
after the other routing nodes receive the new routing information, updating the routing table of the other routing nodes, and the routing nodes after data updating lose paths passing through the routing nodes, and the routing nodes which do not receive the randomly transmitted routing information can still transmit the data to the routing nodes.
The modification of the path is not fixed along with the modification, and the routing information is resent according to the regulation strategy to update the routing information of the node along with the judgment of the load information of the central router to the node router, so that the purpose of unmasking is achieved.
In an embodiment of the present invention, the distributing the pressure of the route node which receives the nearby high load by the plan further comprises;
searching for surrounding nodes according to the network topology owned by the routing node;
if the peripheral node is in the low load condition as well, the routing node will maintain the existing routing table;
if the load of a certain routing node appears nearby and is in the regulation window, the route is re-planned according to the network topology, and the route which is partially passed through the routing node and is modified and added with five distance units or two hops is transferred to the idle routing node.
In an embodiment of the present invention, further comprising;
if a certain routing node obtains a load with explosive growth to cause the node to be congested, the credit value of the routing node is directly set to 0;
after receiving the credit value of the routing node, immediately responding, gradually synchronizing the previously stored alternative routing information to surrounding routing nodes, and starting a credit time waiting based on the maximum credit around each synchronization;
when the routing node has elapsed a credit time, the new modified routing path will continue to be synchronized to surrounding routing nodes provided the routing node has not decongested with the alarm.
The credit time is the number of credit values, and the time unit may be seconds, for example, a node with a credit value of 1 waits for 1 second.
In the embodiment of the invention, the method also comprises the calculation of the route path distance;
defining a hop with minimum transmission time between two adjacent routers as a distance unit; the distances between all the other routing nodes are based on the fact that the unification in the time of twice one distance unit is two distance units, the unification in the time of three times of one distance unit is three distance units, and so on.
Specifically, there are two paths from routing node a to routing node G: 1: a- > B- > C- > D- > G; 2: a- > E- > F- > G; in this model, line 2 has only three hops, while line 1 has 4 hops, calculated from the number of hops. Their run times are identical. This situation exists everywhere in the network, we define that in this network the hop between two adjacent routers where the transmission time is smallest is one distance unit. The distances between all the other routing nodes are based on the fact that the unification in the time of twice one distance unit is two distance units, the unification in the time of three times of one distance unit is three distance units, and so on. In the example, route 1 would have a minimum of 7 distance units and route 2 would have a maximum of 6 distance units provided that the distance difference per hop is not too great. If there are two routes with the same distance unit and the same hop count, even if the transmission times are different, we consider their transmissions to be the same.
In an embodiment of the present invention, further comprising;
when the individual routing nodes trigger the warning value after sharing the routing information, the sharing routing information is not shared, and the optimal routing information passing through the routing nodes is shared.
In an embodiment of the present invention, further comprising;
waiting for credit time when congestion alarm occurs, if the congestion alarm is not released, waiting again, setting the credit value to be twice that of congestion at the moment, and the like; when the congestion state is relieved in a certain time of credit, the credit value is set to be one half of the credit at the moment; the credit value is continuously attenuated in the subsequent time, and in the non-congestion state, the credit value is reduced by a plurality of values every time when one credit passes, and meanwhile, a piece of shared routing information is recovered.
Because a piece of route information is transferred to surrounding route nodes for bearing in each credit period, the pressure with proper size can be shared out through the pressure-bearing algorithm; meanwhile, by means of another credit attenuation system, the routing information recovery is controlled slowly, so that skills ensure that the congested routing node cannot be congested again in a short period, and meanwhile, a slow balance is achieved in the process, so that the network tends to be stable.
In a second aspect, the present invention also provides a routing networking system suitable for use in a high-pressure environment, including the following parts.
The collecting device is configured to collect the states of all routing nodes and transmit updated information to all routing nodes;
the computing device is configured to pre-calculate the optimal routing paths from each routing node to other nodes and update the optimal routing paths to all routing nodes in the network;
the node condition acquisition device is configured to acquire congestion and load conditions of all routing nodes in the network by a polling mode, evaluate the performance of all routing nodes and set an alarm value of the routing nodes;
the distribution device is configured to acquire the existing passing path of the routing node when reaching the warning value, and transfer the pressure part of the existing passing path to the suboptimal path through calculation;
the central server is connected with the acquisition device, the computing device, the node condition acquisition device and the distribution device and is used for executing the routing networking method applicable to the high-pressure environment.
The route information acquisition of the routing nodes is entirely dependent on the central route server assignment. The central routing server monitors the whole routing network in real time, and monitors the whole network so as to ensure that the maximum transmission quantity is provided for the whole networking in real time.
The central routing server has the topology of the entire network and it will calculate the optimal routing path from node to node. It synchronizes the optimal routing information to the corresponding routing nodes while these sub-optimal paths are saved as alternatives for use when needed. Each routing node only needs to passively maintain and update own routing table
The central routing server gathers information for each routing node in the network, including but not limited to current throughput, current credit value. It will store and manage the information classification of each routing node. Some of which are stored in key fields of the central routing server, i.e. the regulatory windows. The regulation window has an upper threshold and a lower threshold. When the load exceeds the upper threshold, the alarm of the node is triggered, the central routing server updates the routing table of partial routing nodes around the routing node, so that the load is reduced, and when the load of a certain peripheral routing node is lower than the lower threshold, the priority path distribution is obtained, and the load of the peripheral alarm routing node is transferred to the routing node. Thereby improving the transmission efficiency of the whole network.
The central routing server manages the routing tables of all routing nodes in the entire network. And updating the route information in real time and transmitting the route information to all routers. In the routing table of a node maintained by the central routing server, it is actually divided into two parts: one part of the information belongs to the optimal route information passing through the routing node, and the other part of the information is the sharing route information from the switching after the alarm or the blocking. If a certain routing node also triggers an alarm or blocks after sharing the routing information, it will not share the sharing routing information, but will only share the optimal routing information passing through the routing node.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. The computer software product is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods of the various embodiments of the invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only memory (ROM), a random access memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (7)
1. The routing networking method suitable for the high-pressure environment is characterized by comprising the following steps of:
collecting and analyzing states of all routing nodes, and transmitting analyzed processing information to all routing nodes;
calculating the optimal route path from each route node to other nodes in advance, and updating the optimal route path to all route nodes in the network;
the congestion and load conditions of all routing nodes in the networking are acquired in a polling mode, the performance of all routing nodes is evaluated, the warning values of the routing nodes are set, the warning values comprise load warning values and congestion warning values, the load warning values comprise setting regulation windows, the congestion warning values comprise setting the credit value of the routing nodes to be 0 or X, the nodes are full when the credit value is 0, and the nodes are idle when the credit value is X, and the X is not 0;
monitoring the service condition of routing nodes in the whole network, and distributing and adjusting the transmission capacity of the whole network according to the reported condition of each routing node; when the warning value is reached, the existing passing path of the routing node is acquired, and the pressure part is transferred to a suboptimal path through calculation;
searching for surrounding nodes according to the network topology owned by the routing node; if the peripheral node is in the low load condition, the low load routing node will maintain the existing routing table;
if the load of a certain routing node appears nearby and is in the regulation window, re-planning according to the network topology, and transferring a part of routing paths which pass through the routing node and are modified to be added with five distance units or two hops to the idle routing node;
the regulation window comprises an upper threshold value and a lower threshold value;
when the load of the routing node reaches the upper threshold of the regulation window, the routing node reports an alarm, and the central routing server performs pressure sharing on the alarm;
when the load of the routing node is in the lower threshold value of the regulation window, judging that the routing node is relatively idle, acquiring the condition of the routing node by a central routing server, and planning and distributing the transmission pressure of the routing node for adapting to the nearby high-load routing node;
further comprises:
when a certain route node load is in an upper threshold or the credit value of the route node is 0, judging that the route node load is overlarge or congestion occurs, and redrawing route information by the central route server;
the central routing server creates a temporary topological graph which does not contain the node, redraws the optimal routing path from routing node to routing node according to the topological graph, and distributes the information to other controllable routing nodes in the network according to a load control strategy;
after the other routing nodes receive the new routing information, updating the routing table of the other routing nodes, and the routing nodes after data updating lose the path passing through the up-reporting police routing node, and the routing nodes which do not receive the randomly transmitted routing information can still transmit the data to the up-reporting police routing node.
2. The method of claim 1, further comprising planning the pressure of nearby nodes to accept congested nodes;
if a certain routing node obtains a load with explosive growth to cause the node to be congested, the credit value of the routing node is set to 0;
the central routing server responds immediately after receiving the credit value of the routing node, gradually synchronizes the previously stored alternative routing information to surrounding routing nodes, and starts a credit time waiting based on the maximum credit around each synchronization;
when the routing node has elapsed a credit time, the new modified routing path will continue to be synchronized to surrounding routing nodes provided the routing node has not decongested with the alarm.
3. The method of routing networking in a high pressure environment of claim 2, further comprising calculating a distance of a routing path, comprising:
defining a hop with minimum transmission time between two adjacent routers as a distance unit;
the distances between all the other routing nodes are based on the fact that the unification in the time of twice one distance unit is two distance units, the unification in the time of three times of one distance unit is three distance units, and so on.
4. A routing networking method suitable for use in a high pressure environment according to claim 3, further comprising a pressure sharing rule of the routing node;
when a route node triggers congestion alarm, the central server will share its transmission pressure part to surrounding route nodes;
when a certain routing node also triggers an alert value after sharing the routing information, the sharing routing information will not be shared out, and the optimal routing information passing through the routing node will be shared out.
5. The method of claim 1, further comprising congestion control and credit algorithms;
waiting for the time of the current credit unit when the congestion alarm occurs, if the congestion alarm is not released, waiting again, setting the credit value to be twice that of the congestion at the moment, and the like;
when the congestion state is relieved in a certain time of credit, the credit value is set to be one half of the credit at the moment;
the credit value is continuously attenuated in the subsequent time, and in the non-congestion state, the credit value is reduced by a fixed value and a piece of shared routing information is recovered every time a credit time passes.
6. The routing networking system suitable for the high-pressure environment is characterized in that;
the collecting device is configured to collect the states of all routing nodes and transmit updated information to all routing nodes;
the computing device is configured to pre-calculate the optimal routing paths from each routing node to other nodes and update the optimal routing paths to all routing nodes in the network;
the node condition acquisition device is configured to acquire congestion and load conditions of all routing nodes in the network by a polling mode, evaluate the performance of all routing nodes and set an alarm value of the routing nodes;
the distribution device is configured to acquire the existing passing path of the routing node when reaching the warning value, and transfer the pressure part of the existing passing path to the suboptimal path through calculation;
the central server is used for uniformly scheduling connection of the acquisition device, the calculation device, the node condition acquisition device and the distribution device and executing the route networking method suitable for the high-pressure environment according to any one of claims 1-5.
7. A computer readable storage medium, wherein a computer program is stored on the computer readable storage medium, which when executed by a processor implements a routing networking method according to any one of claims 1 to 5, suitable for use in a high pressure environment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311333856.6A CN117097664B (en) | 2023-10-16 | 2023-10-16 | Routing networking method, system and medium suitable for high-pressure environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311333856.6A CN117097664B (en) | 2023-10-16 | 2023-10-16 | Routing networking method, system and medium suitable for high-pressure environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117097664A CN117097664A (en) | 2023-11-21 |
| CN117097664B true CN117097664B (en) | 2024-01-12 |
Family
ID=88775680
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311333856.6A Active CN117097664B (en) | 2023-10-16 | 2023-10-16 | Routing networking method, system and medium suitable for high-pressure environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117097664B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674630A (en) * | 2009-09-25 | 2010-03-17 | 南京邮电大学 | Implementation method of cross-layer routing capable of perceiving congestion |
| CN103139069A (en) * | 2013-03-15 | 2013-06-05 | 北京安拓思科技有限责任公司 | Multi-measurement-parameter communication network route method based on analytic hierarchy process (AHP) |
| CN110753000A (en) * | 2019-10-21 | 2020-02-04 | 张丽媛 | Communication improvement method |
| CN114338513A (en) * | 2021-12-24 | 2022-04-12 | 南京邮电大学 | Wireless multi-hop routing quick decision-making method and system based on cross-layer information perception |
| CN115087064A (en) * | 2022-06-13 | 2022-09-20 | 中国电子科技集团公司第十研究所 | Cross-domain high-availability routing method and system for measurement and control communication access network |
-
2023
- 2023-10-16 CN CN202311333856.6A patent/CN117097664B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674630A (en) * | 2009-09-25 | 2010-03-17 | 南京邮电大学 | Implementation method of cross-layer routing capable of perceiving congestion |
| CN103139069A (en) * | 2013-03-15 | 2013-06-05 | 北京安拓思科技有限责任公司 | Multi-measurement-parameter communication network route method based on analytic hierarchy process (AHP) |
| CN110753000A (en) * | 2019-10-21 | 2020-02-04 | 张丽媛 | Communication improvement method |
| CN114338513A (en) * | 2021-12-24 | 2022-04-12 | 南京邮电大学 | Wireless multi-hop routing quick decision-making method and system based on cross-layer information perception |
| CN115087064A (en) * | 2022-06-13 | 2022-09-20 | 中国电子科技集团公司第十研究所 | Cross-domain high-availability routing method and system for measurement and control communication access network |
Non-Patent Citations (1)
| Title |
|---|
| 自组织网络中基于负载均衡的多径路由设计;郭俊等;微电子学与计算机;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117097664A (en) | 2023-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sergiou et al. | A comprehensive survey of congestion control protocols in wireless sensor networks | |
| US6310881B1 (en) | Method and apparatus for network control | |
| Kar et al. | Achieving proportional fairness using local information in Aloha networks | |
| Ying et al. | Cluster-based back-pressure routing algorithm | |
| Chowdhury et al. | TCP CRAHN: A transport control protocol for cognitive radio ad hoc networks | |
| CN109547340A (en) | SDN data center network jamming control method based on heavy-route | |
| CN104272653A (en) | Congestion control in packet data networking | |
| Collotta et al. | Dynamic load balancing techniques for flexible wireless industrial networks | |
| Karenos et al. | Cluster-based congestion control for supporting multiple classes of traffic in sensor networks | |
| CN113891426A (en) | Distributed multi-node networking method and device | |
| Beulah Jayakumari et al. | Priority based congestion control dynamic clustering protocol in mobile wireless sensor networks | |
| Wei et al. | A congestion control scheme based on fuzzy logic for wireless sensor networks | |
| Abdulsahib et al. | A modified bandwidth prediction algorithm for wireless sensor networks | |
| CN117097664B (en) | Routing networking method, system and medium suitable for high-pressure environment | |
| CN113692058A (en) | Spectrum resource evaluation set-based satellite optical network spectrum allocation method and system | |
| Al-Rawi et al. | Reinforcement learning for routing in cognitive radio ad hoc networks | |
| EP3468262B1 (en) | Energy efficient scheduling method and algorithm for the non-deterministic traffic in ieee 802.15.4e time slotted channel hopping (tsch) medium access control | |
| Asonye et al. | Analysis of personal area networks for zigbee environment using random early detection-active queue management model | |
| Li et al. | Lower bound of weighted fairness guaranteed congestion control protocol for WSNs | |
| Mamduhi et al. | State-dependent data queuing in shared-resource networked control systems | |
| Liu et al. | Research on Load Balancing Algorithm of Multicast Services Based on EON | |
| Kathuria et al. | Design, Implementation, and Evaluation of Modern Approaches for the Augmentation of QoS in Medical Body Sensor Network. | |
| Zhang et al. | A fuzzy ranking based buffer replacement strategy for opportunistic networks | |
| Sunitha et al. | Classical and soft computing based congestion control protocols in WSNs: A survey and comparison | |
| Yang et al. | Traffic Management for Distributed Machine Learning in RDMA-enabled Data Center Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |