Comprehensive routing construction method based on superior-subordinate relationship between information systems

By configuring the upper and lower-level relationship links in the information system, using link and system status information to establish and manage routing information, the problem that non-IP links cannot form global routing when IP network fails, and the hybrid link is realized Dynamic integrated routing reduces bandwidth usage and avoids routing loops.

CN119094364AActive Publication Date: 2024-12-06THE 28TH RES INST OF CHINA ELECTRONICS TECH GROUP CORP
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411063683.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-05
Publication Date
2024-12-06
Estimated Expiration
2044-08-05

AI Technical Summary

Technical Problem

In the information system, when the IP network fails, non-IP point-to-point links cannot form effective global routing, resulting in difficulty in interconnection between systems, especially the lack of dynamic comprehensive routing mechanism under the conditions of hybrid communication links.

Method used

By configuring the upper and lower-level relationship links between information systems, using link status, communication status and system status information, establish and delete routing information, avoid routing loops, and realize dynamic comprehensive routing construction. Specific steps include activating and closing the link, sending and canceling routing information messages, ensuring that routing information transmission is triggered only when the communication status and system status change.

Benefits of technology

The generated routes support the mixed use of IP and non-IP links, solving the problem of the lack of dynamic global routing of non-IP point-to-point links, occupying less bandwidth resources, quickly forming dynamic comprehensive routing of the entire system, and avoiding the emergence of routing loops.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119094364A_ABST
    Figure CN119094364A_ABST
Patent Text Reader

Abstract

The invention provides a method for constructing a comprehensive route based on a superior-subordinate relationship between information systems, which comprises the following steps of: 1, respectively configuring more than one link between a current information system and other information systems connected with the current information system; step 2, establishing an inter-system comprehensive route of the current information system to obtain a local routing table of the current system; step 3, deleting routing information; step 4, closing a link between the current information system and the alternative superior system, avoiding a routing loop, and completing routing construction of the current information system; and step 5, reselecting any information system as the current information system, executing the step 1 to the step 4 until all the information systems complete route construction, and obtaining the final comprehensive route based on the superior-subordinate relationship between the information systems.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a comprehensive routing construction method, in particular to a comprehensive routing construction method based on the superior-subordinate relationship between information systems. Background Art

[0002] This section merely provides background information related to the present disclosure and is not necessarily prior art.

[0003] Information systems, especially command information systems, are supported by complex communication networks, with both efficient mesh IP communication links as the backbone communication network and low-speed non-IP point-to-point communication links as backup. However, in the event of IP network failure, non-IP point-to-point communication links only have point-to-point communication capabilities and cannot form effective global routing to achieve system-wide interconnection. It is necessary to establish a global routing mechanism to achieve dynamic integrated routing of the entire system under the conditions of hybrid communication links.

[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0005] Purpose of the invention: The technical problem to be solved by the present invention is to provide a comprehensive routing construction method based on the hierarchical relationship between information systems in view of the deficiencies of the prior art.

[0006] In order to solve the above technical problems, the present invention discloses a comprehensive routing construction method based on the superior-subordinate relationship between information systems, comprising the following steps:

[0007] Step 1, configuring one or more links between the current information system and other information systems connected to it;

[0008] Step 2, using the link status LS, communication status CS, system status SS information between the current information system and other information systems connected thereto, as well as the link test message, routing information update request message and routing information message, to establish the inter-system integrated routing of the current information system and obtain the local routing table of the current system;

[0009] Step 3, using the link status LS, communication status CS, system status information SS and routing information cancellation report between the current information system and other information systems connected to it, delete the routing information;

[0010] Step 4: close the link between the current information system and the candidate upper-level system to avoid routing loops and complete the routing construction of the current information system;

[0011] Step 5: reselect any information system as the current information system, and execute steps 1 to 4 until all information systems complete the route construction, and finally obtain the comprehensive route based on the superior-subordinate relationship between the information systems.

[0012] Furthermore, the other information systems connected thereto described in step 1 include: an upper-level system, a directly connected lower-level system, and an alternative upper-level system.

[0013] Furthermore, the link described in step 1 is an IP link or a non-IP point-to-point link.

[0014] Furthermore, the establishment of the integrated routing between the information systems in step 2 specifically includes:

[0015] Step 2-1, activate each link between the current information system and the upper system or the directly connected lower system, and regularly send a link test message from each link to the opposite system, and set the link state to pending activation IACT;

[0016] Step 2-2, if a link test message is received from a peer system from a link, the link state is set to activated ACT, and the communication state of the link is checked. If it is not activated ACT, the communication state is set to activated ACT;

[0017] Step 2-3, when the communication state of the opposite end system A of any system B in any link changes from inactive to active ACT, the system B sends a routing information update request message to the opposite end system A;

[0018] Step 2-4, after receiving the routing information update request message, the peer system A assembles the routing information message of the peer system A and sends it back to the system B via the original route;

[0019] Step 2-5, the peer system A assembles routing information packets of other systems whose routes are not those of the system B and whose system status is activated ACT, and sends them to the peer system B;

[0020] Step 2-6, the system B receives the routing information message sent by the peer system A, sets the system status in the routing information message to ACT in the routing table of this system, and its next hop is the peer system A, and forwards the routing information message to other directly connected systems whose communication status and system status are both ACT.

[0021] Furthermore, the inactivation described in step 2-3 includes: OFF or pending activation IACT.

[0022] Furthermore, the deleting of routing information in step 3 specifically includes:

[0023] Step 3-1, when the communication status of any system changes from activated ACT to pending activation IACT or closed OFF, the status of the system is set to deactivated DEACT or closed OFF in the local routing table of the current system, and its next hop system is set to null;

[0024] Step 3-2, assembling a routing information cancellation message about the system, and sending it to all directly connected systems of the current system whose communication status and system status are both ACT activated;

[0025] Step 3-3, traverse the routing table, for all systems C whose routes are this system, set the system status of the system C to inactive, set the next hop system of the system C to null, assemble a routing information cancellation message about the system C, and send it to all directly connected systems of the current system whose communication status and system status are both activated ACT;

[0026] Step 3-4, when the current system receives a routing information cancellation message from a system directly connected to it, it sets the system status of system D in the routing information cancellation message to the status specified in the cancellation message, and sets the next hop system of the current system to empty, and sends the routing information cancellation message to all directly connected systems of the current system whose communication status and system status are both activated ACT.

[0027] Furthermore, the closing of the link between the current information system and the alternative upper-level system in step 4 specifically includes:

[0028] Step 4-1, closing each link between the current information system and the alternative superior system;

[0029] Step 4-2: If any link with the candidate upper system is activated, shut down the link and keep the status of each link as OFF;

[0030] Step 4-3: If any candidate upper-level system is switched to the upper-level system, all links with the original upper-level system are closed, the candidate upper-level system is set as the upper-level system, and the original upper-level system is set as the candidate upper-level system;

[0031] Step 4-4, after waiting for the link to time out, activate all links with the upper-level system.

[0032] Furthermore, the specified state described in step 3-4 is OFF or DEACT.

[0033] Furthermore, the link timeout described in step 4-4 is a preset number of link test report cycles.

[0034] Furthermore, the preset number described in step 4-4 is 3.

[0035] Beneficial effects:

[0036] 1. The route generated by the method proposed in the present invention is based on IP routing, and can support the mixed use of IP links and non-IP point-to-point links, thus solving the problem of no dynamic global routing when non-IP point-to-point links are used between systems.

[0037] 2. The routing method proposed in the present invention is based on the hierarchical relationship of the information system and the system status. The transmission of routing information related messages is triggered only when the communication status and the system status change. It occupies less communication link bandwidth resources, especially when the bandwidth resources of non-IP point-to-point links are very limited. It can also effectively and quickly form a dynamic integrated routing for the entire system.

[0038] 3. The routing method proposed in the present invention cleverly avoids the occurrence of routing loops by closing the link with the alternative superior. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments, and the above and / or other advantages of the present invention will become more clear.

[0040] Figure 1 This is a schematic diagram of the hybrid link interconnection between systems proposed by the present invention.

[0041] Figure 2 It is the link state LS transition diagram proposed by the present invention.

[0042] Figure 3 It is the communication state CS transition diagram proposed by the present invention.

[0043] Figure 4 It is the system state SS transition diagram proposed by the present invention.

[0044] Figure 5 It is a diagram of system interconnection and upper-level switching in one embodiment of the present invention.

[0045] Figure 6 The diagram is a partial step diagram of establishing the integrated routing between the information systems in an embodiment.

[0046] Figure 7 It is a schematic diagram of the processing process of canceling the routing information report during implementation. DETAILED DESCRIPTION

[0047] The principle of the present invention is: through mutual detection between upper and lower levels of information systems, the establishment, maintenance and forwarding of routing information are generated, and finally a dynamic integrated routing of the whole system is formed.

[0048] The present invention designs a method for constructing integrated routing based on the superior-subordinate relationship between information systems, which solves the problem of no dynamic integrated routing when hybrid links (IP links and non-IP point-to-point links) are used to interconnect systems, especially when non-IP point-to-point links are used to interconnect systems.

[0049] The specific technical solution is as follows: A method for constructing a comprehensive routing based on the superior-subordinate relationship between information systems, mainly comprising the following steps:

[0050] Step 1: configure at least one link for the upper level, directly connected lower level, and alternative upper level system of the system. The link can be an IP link or a non-IP point-to-point link;

[0051] Step 2: Establish inter-system comprehensive routing using link status (LS), communication status (CS), system status (SS) information between upper and lower systems, link test report (Test), route information update request report (Route Information Update Request), route information report (Route Information), etc. Specifically, this step is broken down as follows:

[0052] Step 2-1, activate each link with the upper level or directly connected to the lower level, and send a link test message from each link to the peer system regularly (2 seconds), and set the link state to pending activation (IACT);

[0053] Step 2-2, receiving a link test message from a peer system from a certain link, setting the link state to active (ACT), checking the communication state, and if it is not ACT, setting the communication state to ACT;

[0054] Step 2-3, when the communication status of a system changes from non-ACT to ACT, a routing information update request message is sent to the other end;

[0055] Step 2-4, after receiving the routing information update request message from the other end, assemble the routing information message about the system and send it to the other end system;

[0056] Step 2-5, assembling the routing information packets of other systems whose routes are not the peer systems and whose system status is ACT, and sending them to the peer system;

[0057] Step 2-6, receiving the routing information message sent by the peer end, setting the system status in the routing information message to ACT in the routing table of this system, and its next hop is the peer end system, and forwarding the routing information message to other directly connected systems whose communication status and system status are both ACT;

[0058] Step 3, using the link status, communication status, system status information and route information cancellation report (Route Information Drop) between the upper and lower systems to delete the route information; specifically, this step is decomposed as follows:

[0059] Step 3-1, when the communication status of a system changes from ACT to IACT or OFF (when the communication link is manually closed or abnormally disconnected), the status of the system in the routing table is immediately set to DEACT or OFF, and its next hop system is set to null;

[0060] Step 3-2, assemble a routing information cancellation message about the system and send it to all directly connected systems whose communication status and system status are ACT;

[0061] Step 3-3, traverse the routing table, set the system status of all systems whose routes are this system to non-ACT, set the next hop system to null, assemble a routing information cancellation message about this system, and send it to all directly connected systems whose communication status and system status are ACT;

[0062] Step 3-4, when receiving a routing information cancellation message, set the system status in the routing information cancellation message to the specified status (OFF or DEACT), set its next hop system to null, and then send the routing information cancellation message to all directly connected systems whose communication status and system status are ACT;

[0063] Step 4: Avoid routing loops by closing the link with the candidate upper level. Specifically, this step is broken down as follows:

[0064] Step 4-1, close each link with the candidate superior;

[0065] Step 4-2: If it is found that a link with the candidate upper level is accidentally or manually activated, the link is automatically closed immediately, and the status of each link is kept OFF;

[0066] Step 4-3: If a candidate upper level is switched to the upper level system, all links with the original upper level system are closed, the system upper level is set as the candidate upper level, and the original system upper level is set as the candidate upper level;

[0067] Step 4-4, after waiting for the link to time out (3 link test report cycles), activate all links with the system superior.

[0068] Embodiment 1:

[0069] The embodiment of the present invention discloses a method for constructing a comprehensive route between information systems based on the superior-subordinate relationship. The method configures links between systems, establishes comprehensive routes between systems by using link status, communication status, system status information, link test reports, routing information update request reports, routing information reports, etc.; deletes routing information by using link status, communication status, system status information, and routing information cancellation reports; and avoids the occurrence of routing loops by closing the link between the candidate superior. The routing technology can support mixed links of IP links and non-IP point-to-point links. It is based on the superior-subordinate relationship of information systems and the system status. Only when the communication status and system status change, the transmission of routing information related messages is triggered. It occupies less bandwidth resources of communication links. Especially when the bandwidth resources of non-IP point-to-point links are very limited, it can also effectively and quickly converge to form a dynamic comprehensive route for the whole system.

[0070] An embodiment of the present invention provides a method for constructing a comprehensive route between information systems based on a hierarchical relationship, comprising the following steps:

[0071] Step 1: configure at least one link for the upper level, directly connected lower level, and alternative upper level system of the system. The link can be an IP link or a non-IP point-to-point link;

[0072] A directly connected subordinate refers to a subordinate that is directly connected to the system (only one hop). A system can have 0 or more directly connected subordinates. An alternative superior refers to a superior that can be used as the superior of the system, but is not the superior of the system at the current moment. A system has only one directly connected superior at a certain moment, but can have multiple alternative superiors.

[0073] See also Figure 1 , multiple links are configured between system A and system B, where link 0 is an IP link, and links 1 and 2 are non-IP point-to-point links. When systems communicate with each other, they can communicate through these links concurrently, and only systems that have explicitly configured links can communicate with each other, otherwise they must be routed and forwarded from other nodes. For example, in an information network with a hybrid network of IP links and non-IP point-to-point links, there are four systems A, B, C, and D, where B is the superior of C, and A is the superior of B. There is 1 IP link and 1 non-IP point-to-point link configured between A and B, and 1 IP link and 2 non-IP point-to-point links configured between B and C. From the perspective of IP links, IP routing between A and C can communicate with each other, but since there is no explicit link configured for A and C, from the perspective of comprehensive routing, A and C are not directly connected, and information interaction between them must be forwarded through routing point B.

[0074] Step 2: Establish inter-system comprehensive routing using link status (LS), communication status (CS), system status (SS) information between upper and lower systems, link test report (Test), route information update request report (Route Information Update Request), route information report (Route Information), etc. Specifically, this step is broken down as follows:

[0075] Step 2-1, activate each link with the upper level or directly connected to the lower level, and send a link test message from each link to the peer system regularly (2 seconds), and set the link state to pending activation (IACT);

[0076] Link state (LS) refers to the state of a single link, including active (ACT), pending activation (IACT), and closed (OFF). Link test messages are sent and received for each link. The sending cycle is generally set to 2 seconds, and can also be set to other values ​​according to actual needs. For example, if the bandwidth of a non-IP point-to-point link is low, only 1200bps, the sending cycle can be lowered to 6 seconds or 12 seconds. The main basis for link state changes is whether a link test message has been received, see Figure 2 , the link state changes to ACT when a link test message is received from the link. If no link test message is received from the other end for 3 cycles, the link state changes to IACT. If the link transmission and reception are closed, the link state changes to OFF. The link test message should contain information such as the source system, the destination system, and the transmission and reception counts. The specific format can be designed according to the actual situation.

[0077] Step 2-2, receiving a link test message from a peer system from a certain link, setting the link state to active (ACT), checking the communication state, and if it is not ACT, setting the communication state to ACT;

[0078] Communication status (CS) refers to the comprehensive status of the link between systems, including activation (ACT), pending activation (IACT), and shutdown (OFF). Figure 3 , if all LS are OFF, then CS is OFF; if one LS is ACT, then CS is ACT; in other cases, CS is IACT.

[0079] Step 2-3, when the communication status of a system changes from non-ACT to ACT, a routing information update request message is sent to the other end;

[0080] Step 2-4, after receiving the routing information update request message from the other end, assemble the routing information message about the system and send it to the other end system;

[0081] Step 2-5, assembling the routing information packets of other systems whose routes are not the peer systems and whose system status is ACT, and sending them to the peer system;

[0082] Step 2-6, receiving the routing information message sent by the peer end, setting the system status in the routing information message to ACT in the routing table of this system, and its next hop is the peer end system, and forwarding the routing information message to other directly connected systems whose communication status and system status are both ACT;

[0083] The routing information update request report should contain information such as the source system, the requested system, and the request type. The specific format can be designed according to actual needs. The routing information report is the reply message to the routing information update request report. If the routing information report of the peer system is not received within three sending cycles, it means that the peer system is abnormal and all links with the peer system should be closed directly. The routing information report is forwarded to other directly connected systems whose communication status and system status are both ACT. The source system needs to be excluded, otherwise it will cause confusion in routing information. The above-mentioned directly connected system refers to a system that is configured with a communication link of only one hop with this system, including the superior and the directly connected subordinate.

[0084] The system status (SS) includes four types: activated (ACT), pending activation (IACT), deactivated (DEACT), and closed (OFF). Figure 4 The system status is determined by the communication status and whether the routing information message is received. If CS is OFF, SS is OFF; if CS changes from OFF to IACT, SS is IACT; if CS changes from OFF or IACT to ACT and a routing information message is received, SS becomes ACT; if CS changes from ACT to IACT, SS becomes DEACT; if CS changes from ACT to OFF, SS becomes OFF.

[0085] Step 3, using the link status, communication status, system status information and route information cancellation report (Route Information Drop) between the upper and lower systems to delete the route information; specifically, this step is decomposed as follows:

[0086] Step 3-1, when the communication status of a system changes from ACT to IACT or OFF (when the communication link is manually closed or abnormally disconnected), the status of the system in the routing table is immediately set to DEACT or OFF, and its next hop system is set to null;

[0087] Step 3-2, assemble a routing information cancellation message about the system and send it to all directly connected systems whose communication status and system status are ACT;

[0088] Step 3-3, traverse the routing table, set the system status of all systems whose routes are this system to non-ACT, set the next hop system to null, assemble a routing information cancellation message about this system, and send it to all directly connected systems whose communication status and system status are ACT;

[0089] Step 3-4, when receiving a routing information cancellation message, set the system status in the routing information cancellation message to the specified status (OFF or DEACT), set its next hop system to null, and then send the routing information cancellation message to all directly connected systems whose communication status and system status are ACT;

[0090] The routing information cancellation report is generated when the system communication status changes from ACT to OFF or IACT. The content should at least include the reported system and its system status information. The specific format can be designed according to the actual situation. The system will not generate a routing information cancellation report about itself, that is, the two systems A and B that are directly connected to each other, the A system will not send a routing information cancellation report about the A system itself to the B system, and the B system will not generate a routing information cancellation report about the B system itself.

[0091] Step 4: Avoid routing loops by closing the link with the candidate upper level. Specifically, this step is broken down as follows:

[0092] Step 4-1, close each link with the candidate superior;

[0093] Step 4-2: If it is found that a link with the candidate upper level is accidentally or manually activated, the link is automatically closed immediately, and the status of each link is kept OFF;

[0094] Step 4-3: If a candidate upper level is switched to the upper level system, all links with the original upper level system are closed, the system upper level is set as the candidate upper level, and the original system upper level is set as the candidate upper level;

[0095] Step 4-4, after waiting for the link to time out (3 link test report cycles), activate all links with the upper level of the system;

[0096] In the present invention, a system can only have one superior (there is no superior for the highest-level system), but can have multiple alternative superiors (systems that can serve as superiors, but are not currently superiors). When the system switches superiors, one of the alternative superiors will become the system superior, and the original superior system will become the alternative superior.

[0097] Avoiding routing loops is the primary problem that every routing protocol solves. In this routing protocol, each system has a unique superior, which can naturally form a tree structure by going up level by level. However, the existence of alternative superiors adds uncertain loops to the tree-like interconnection architecture. Therefore, as long as the link with the alternative superior is closed, the occurrence of routing loops can be avoided.

[0098] Embodiment 2:

[0099] This embodiment describes in detail the entire process of establishing, maintaining, and canceling integrated routing between systems and upper-level switching to avoid loops. Figure 5 Left, there is 1 IP link and 1 non-IP point-to-point link between system A1 and superior A; there is 1 IP link and 1 non-IP point-to-point link between system A2 and superior A; there is 1 non-IP point-to-point link between system B1 and superior system A1, and 1 non-IP point-to-point link between system B1 and alternative superior A2; there is 1 non-IP point-to-point link between system B2 and superior B1, and 1 non-IP point-to-point link between system B2 and alternative superior A2. Before B1 establishes a link with superior A1, the routing information of each system node is shown in Table 1:

[0100] Table 1 Routing information table of each system node before B1 establishes a link with the upper level A1

[0101]

[0102] When B1 establishes a link with its superior A1, see Figure 5 In the process, the link state becomes ACT, and the communication state becomes ACT synchronously. Then the two parties send routing information update request messages to each other. After B1 receives A1's routing information update request message, it replies to A1 with B1's own routing information message and B2's routing information message in turn; after A1 receives B1's routing information update request message, it replies to B1 with A1's own routing information message, A's routing information message, and A2's routing information message in turn. At this time, the routing information of each system node is shown in Table 2:

[0103] Table 2 Routing information table of each system node when B1 establishes a link with the upper level A1

[0104]

[0105] B1 switches the upper level to A2. Figure 5 Right, first close the link with the current superior A1, the link status of B1 and A1 immediately becomes OFF, the communication status becomes OFF, and the system status becomes OFF; B1 clears the routing information of A1, A, and A2, assembles a cancellation report about the routing information of A1, A, and A2, and sends it to B2; at A1, since the change of the link and communication status with B1 has not been detected, the relevant routing information has not changed. At this time, the routing information of each system node is shown in Table 3:

[0106] Table 3 Routing information table of each system node when B1 switches to A2

[0107]

[0108] Then wait for 3 link test report cycles. At A1, due to link timeout, the link status with B1 becomes IACT, the communication status becomes IACT, and the system status becomes DEACT; A1 clears the routing information of B1 and B2, assembles a routing information cancellation report about B1 and B2, and sends it to A. After receiving it, A also forwards it to A2. At this time, the routing information of each system node is shown in Table 4:

[0109] Table 4 Routing information table of each system node when waiting for 3 link test report cycles

[0110]

[0111] B1 opens and activates the link with the candidate superior A2, the link state becomes ACT, the communication state becomes ACT, and then both parties send routing information update request messages to each other. After B1 receives A2's routing information update request message, it replies to A2 with B1's own routing information message and B2's routing information message in turn; after A2 receives B1's routing information update request message, it replies to B1 with A2's own routing information message, A's routing information message, and A1's routing information message in turn. At this time, the routing information formed by each system node is shown in Table 5:

[0112] Table 5B1 Routing information table of each system node when opening and activating the link with the alternative superior A2

[0113]

[0114] Embodiment 3:

[0115] In one embodiment, Figure 6 As shown, steps 2-3 to 2-6 are as follows:

[0116] Step 2-3, at system B, when the communication state of any system A changes from inactive (OFF state or IACT state) to active ACT, system B sends a routing information update request message to the peer system A;

[0117] Step 2-4, after receiving the routing information update request message, the system A assembles the routing information message of the system A and sends it back to the system B via the original route;

[0118] Step 2-5, system A assembles routing information packets of other systems whose routes are not the peer system B and whose system status is activated ACT, and sends them to the peer system B;

[0119] Step 2-6, system B receives the routing information message sent by the peer system A, sets the system status in the routing information message to ACT in the routing table of this system, and its next hop is the peer system A, and forwards the routing information message to other directly connected systems whose communication status and system status are both ACT.

[0120] In the present invention, the next hop is a common term in the concept of routing. From the source node to the destination node, each node passed is a hop, and the next node is called the next hop. The route from the source node to the destination node is the first node passed from the source. If the source A is directly connected to the destination B, then the next hop from A to B is B, or directly speaking, the route from A to B is B; if A reaches B via C, then the next hop from A to B is C, or speaking, the route from A to B is C.

[0121] Embodiment 4:

[0122] In one embodiment, Figure 7 As shown, in the process of processing the routing information cancellation report from step 3-3 to step 4, the routing and system status information at systems B, C, and D is shown in Table 6:

[0123] Table 6 Routing and system status information table at system B, C, D

[0124]

[0125] Assume that the link between system B and system A is disconnected and the link status changes to OFF. At system B:

[0126] First, according to step 3-2, assemble the routing information cancellation message about system A, and send it to all directly connected systems of system B (here, system C and system D) whose communication status and system status are both ACT;

[0127] Then, according to step 3-3, the routing table of system B is traversed, and for all systems A1 and A2 whose routes are system A, the system status of the systems A1 and A2 is set to inactive, the next hop system of the systems A1 and A2 is set to null, and a cancellation message of the routing information about the systems A1 and A2 is assembled and sent to all directly connected systems C and D of system B whose communication status and system status are activated ACT;

[0128] At this time, at systems B, C, and D, the routing and system status information is as shown in Table 7:

[0129] Table 7 Routing and system status information table formed at system B, C, and D

[0130]

[0131] At this time, assume that the link between system C and C1 is disconnected and the link status becomes OFF. At system B:

[0132] According to steps 3-4, system B receives a routing information cancellation message about system C1 from the directly connected system C, sets the system status of the system C1 in the routing information cancellation message to the status OFF specified in the cancellation message, and sets the next hop system of system C1 to empty, and then forwards the routing information cancellation message about system C1 to the directly connected system D whose communication status and system status are both activated ACT.

[0133] At this time, at systems B, C, and D, the routing and system status information is as shown in Table 8:

[0134] Table 8 Routing and system status information table formed at system B, C, and D

[0135]

[0136] In a specific implementation, the present application provides a computer storage medium and a corresponding data processing unit, wherein the computer storage medium can store a computer program, and when the computer program is executed by the data processing unit, the invention content of the method for constructing a comprehensive routing between information systems based on a superior-subordinate relationship provided by the present invention and some or all of the steps in each embodiment can be run. The storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM), etc.

[0137] Those skilled in the art can clearly understand that the technical solutions in the embodiments of the present invention can be implemented by means of computer programs and their corresponding general hardware platforms. Based on such an understanding, the technical solutions in the embodiments of the present invention can be essentially or partly contributed to the prior art in the form of computer programs, i.e., software products, which can be stored in a storage medium and include several instructions for enabling a device including a data processing unit (which can be a personal computer, a server, a single-chip microcomputer, an MCU or a network device, etc.) to execute the methods described in various embodiments of the present invention or certain parts of the embodiments.

[0138] The present invention provides a method and idea for building a comprehensive routing method based on the superior-subordinate relationship between information systems. There are many methods and ways to implement the technical solution. The above is only a preferred implementation of the present invention. It should be pointed out that for ordinary technicians in this technical field, without departing from the principle of the present invention, several improvements and modifications can be made, and these improvements and modifications should also be regarded as the protection scope of the present invention. All components not specified in this embodiment can be implemented by existing technologies.

Claims

1. A method for constructing a comprehensive routing based on the hierarchical relationship between information systems, characterized in that: The steps include: Step 1, configuring one or more links between the current information system and other information systems connected to it; Step 2, using the link status LS, communication status CS, system status SS information between the current information system and other information systems connected thereto, as well as the link test message, routing information update request message and routing information message, to establish the inter-system integrated routing of the current information system and obtain the local routing table of the current system; Step 3, using the link status LS, communication status CS, system status information SS and routing information cancellation report between the current information system and other information systems connected to it, delete the routing information; Step 4: close the link between the current information system and the candidate upper-level system to avoid routing loops and complete the routing construction of the current information system; Step 5: reselect any information system as the current information system, and execute steps 1 to 4 until all information systems complete the route construction, and finally obtain the comprehensive route based on the superior-subordinate relationship between the information systems.

2. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 1, characterized in that: The other information systems connected to it described in step 1 include: the upper-level system, the directly connected lower-level system and the alternative upper-level system.

3. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 2, characterized in that: The link described in step 1 is an IP link or a non-IP point-to-point link.

4. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 3, characterized in that: The establishment of the integrated routing between the information systems in step 2 specifically includes: Step 2-1, activate each link between the current information system and the upper system or the directly connected lower system, and regularly send a link test message from each link to the opposite system, and set the link state to pending activation IACT; Step 2-2, if a link test message is received from a peer system from a link, the link state is set to activated ACT, and the communication state of the link is checked. If it is not activated ACT, the communication state is set to activated ACT; Step 2-3, when the communication state of the opposite end system A of any system B in any link changes from inactive to active ACT, the system B sends a routing information update request message to the opposite end system A; Step 2-4, after receiving the routing information update request message, the peer system A assembles the routing information message of the peer system A and sends it back to the system B via the original route; Step 2-5, the peer system A assembles routing information packets of other systems whose routes are not those of the system B and whose system status is activated ACT, and sends them to the peer system B; Step 2-6, the system B receives the routing information message sent by the peer system A, sets the system status in the routing information message to ACT in the routing table of this system, and its next hop is the peer system A, and forwards the routing information message to other directly connected systems whose communication status and system status are both ACT.

5. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 4, characterized in that: The inactivation described in step 2-3 includes: OFF or pending activation IACT.

6. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 5, characterized in that: Deleting the routing information described in step 3 specifically includes: Step 3-1, when the communication status of any system changes from activated ACT to pending activation IACT or closed OFF, the status of the system is set to deactivated DEACT or closed OFF in the local routing table of the current system, and its next hop system is set to null; Step 3-2, assembling a routing information cancellation message about the system, and sending it to all directly connected systems of the current system whose communication status and system status are both ACT activated; Step 3-3, traverse the routing table, for all systems C whose routes are this system, set the system status of the system C to inactive, set the next hop system of the system C to null, assemble a routing information cancellation message about the system C, and send it to all directly connected systems of the current system whose communication status and system status are both activated ACT; Step 3-4, when the current system receives a routing information cancellation message from a system directly connected to it, it sets the system status of system D in the routing information cancellation message to the status specified in the cancellation message, and sets the next hop system of the current system to empty, and sends the routing information cancellation message to all directly connected systems of the current system whose communication status and system status are both activated ACT.

7. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 6, characterized in that: Closing the link between the current information system and the alternative superior system in step 4 specifically includes: Step 4-1, closing each link between the current information system and the alternative superior system; Step 4-2: If any link with the candidate upper system is activated, shut down the link and keep the status of each link as OFF; Step 4-3: If any candidate upper-level system is switched to the upper-level system, all links with the original upper-level system are closed, the candidate upper-level system is set as the upper-level system, and the original upper-level system is set as the candidate upper-level system; Step 4-4, after waiting for the link to time out, activate all links with the upper-level system.

8. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 7, characterized in that: The specified state described in steps 3-4 is OFF or DEACT.

9. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 8, characterized in that: The link timeout described in step 4-4 is a preset number of link test report cycles.

10. A method for constructing a comprehensive route between information systems based on a hierarchical relationship according to claim 9, characterized in that: The preset number described in step 4-4 is 3.

Citation Information

Patent Citations

  • Method for wireless self-organizing of monitoring system to form tree-shaped routing

    CN101179499A

  • Networking configuration method and device and data communication method and device

    CN106506312A

  • Method for realizing main-standby communication of single-link equipment

    CN118118325A

  • Network system and network connection device

    US20070291649A1

  • System and method for efficient name-based content routing using link-state information in information-centric networks

    US20160182353A1