A comprehensive routing construction method based on hierarchical relationships between information systems

Abstract

The present invention proposes a method for constructing a comprehensive route based on a superior-subordinate relationship between information systems, comprising: step 1, configuring one or more links between a current information system and other information systems connected thereto; step 2, establishing a comprehensive route between the systems of the current information system, and obtaining a local routing table of the current system; step 3, deleting routing information; step 4, closing the link between the current information system and an alternative superior system to avoid routing loops, and completing the route construction of the current information system; step 5, reselecting any information system as the current information system, and executing steps 1 to 4 until all information systems complete the route construction, thereby obtaining a final comprehensive route based on the superior-subordinate relationship between information systems.

Description

Technical Field

[0001] The present 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. These networks consist of highly efficient meshed IP communication links as the backbone, and low-speed non-IP point-to-point communication links as backup. However, if the IP network fails, the non-IP point-to-point communication links only provide point-to-point communication capabilities, failing to form effective global routing and achieve system-wide interoperability. A global routing mechanism is needed to achieve dynamic, integrated routing across the entire system using these 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 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 method for constructing a comprehensive routing based on the hierarchical relationship between information systems in response to the shortcomings of the existing technology.

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

[0007] Step 1: Configure 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 to it, as well as the link test message, routing information update request message, and routing information message, 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 alternative 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 obtain the final comprehensive route based on the hierarchical relationship between the information systems.

[0012] Furthermore, the other information systems connected thereto 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-level system or the directly connected lower-level system, and regularly send link test messages from each link to the opposite system, setting the link status to pending activation (IACT).

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

[0017] Step 2-3: When the communication status of any system B in any link with the peer system A changes from inactive to active, system B sends a routing information update request message to the peer system A.

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

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

[0020] In 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, sets its next hop to 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 ACT to IACT or OFF, the status of the system is set to DEACT or OFF in the local routing table of the current system, and its next-hop system is set to null;

[0024] Step 3-2: assemble a routing information cancellation message about the system and send 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, set the system status of all systems C that are routes to this system to inactive, set the next-hop system of system C to null, assemble a routing information cancellation message about system C, and send it to all directly connected systems of the current system whose communication status and system status are both active ACT;

[0026] In 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 C in the routing information cancellation message to the status specified in the cancellation message, 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 upper-level system;

[0029] In step 4-2, if any link with the alternative upper-level 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 switches 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 the link times out, activate all links with the upper-level system.

[0032] Furthermore, the specified state 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 in step 4-4 is 3.

[0035] Beneficial effects:

[0036] 1. The routing 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, 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 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 below in conjunction with the accompanying drawings and specific embodiments, and the above and / or other advantages of the present invention will become more apparent.

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

[0041] Figure 2 This 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 The figure is a schematic diagram of the process of processing the routing information cancellation report in implementation. DETAILED DESCRIPTION

[0047] The principle of the present invention is to generate, establish, maintain and forward routing information through mutual detection between upper and lower levels of information systems, and finally form a dynamic integrated routing for the whole system.

[0048] The present invention designs a method for constructing integrated routing based on the hierarchical 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 hierarchical relationship between information systems mainly includes the following steps:

[0050] Step 1: Configure at least one link for the system's upper level, directly connected lower level, and alternative upper level 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 the link status (LS), communication status (CS), system status (SS) information between the upper and lower systems, as well as the link test report (Test), route information update request report (Route Information Update Request), and route information report (Route Information). 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 periodically (2 seconds) send a link test message from each link to the peer system, setting the link status to pending activation (IACT);

[0053] Step 2-2: Receive a link test message from the peer system on a certain link, set the link state to active (ACT), check the communication state, and if it is not ACT, set 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: assemble the routing information packets of other systems whose routes are not the peer system and whose system status is ACT, and send them to the peer system;

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

[0058] Step 3: Delete the routing information using the link status, communication status, system status information, and route information cancellation message (Route Information Drop) between the upper and lower systems. Specifically, this step is broken down as follows:

[0059] Step 3-1: When the communication status of a system changes from ACT to IACT or OFF (the communication link is manually closed or abnormally disconnected), the system status 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 to 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 alternative upper level. Specifically, this step is broken down as follows:

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

[0065] In step 4-2, if it is found that a link with the candidate upper level is accidentally or manually activated, the link is automatically shut down immediately, and the status of each link is kept as OFF;

[0066] In step 4-3, when 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 upper level of the system.

[0068] Example 1:

[0069] The present invention discloses a method for constructing integrated routing between information systems based on hierarchical relationships. Links are configured between systems, and integrated routing between the systems is established using link status, communication status, system status information, link test reports, routing information update request reports, and routing information reports. Routing information is deleted using link status, communication status, system status information, and routing information cancellation reports. Routing loops are avoided by closing links with alternative superiors. This routing technology supports a mix of IP links and non-IP point-to-point links. Based on the hierarchical relationships between information systems and system status, the transmission of routing information-related messages is triggered only when the communication status and system status change. This method occupies minimal communication link bandwidth resources, and can effectively and quickly converge to form a dynamic integrated routing for the entire system, particularly when non-IP point-to-point link bandwidth resources are very limited.

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

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

[0072] A directly connected subordinate is a subordinate that is directly connected to the system (with only one hop). A system can have zero or more directly connected subordinates. An alternative superior is a superior that can serve as the system's superior, but is not currently its superior. At any given moment, a system has only one directly connected superior, 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 concurrently over these links. Only systems with explicitly configured links can communicate; otherwise, information must be routed and forwarded from other nodes. For example, in an information network with a hybrid of IP and non-IP point-to-point links, there are four systems, A, B, C, and D. B is the superior of C, and A is the superior of B. One IP link and one non-IP point-to-point link are configured between A and B, while one IP link and two non-IP point-to-point links are configured between B and C. From the perspective of IP links, IP routing between A and C is possible. However, since no links are explicitly configured between A and C, from the perspective of integrated routing, there is no direct connection between A and C, and information exchange between them must be forwarded through routing point B.

[0074] Step 2: Establish inter-system comprehensive routing using the link status (LS), communication status (CS), system status (SS) information between the upper and lower systems, as well as the link test report (Test), route information update request report (Route Information Update Request), and route information report (Route Information). 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 periodically (2 seconds) send a link test message from each link to the peer system, setting the link status 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 packets are sent and received for each link. The sending period is generally set to 2 seconds, but can also be set to other values ​​based on actual needs. For example, if the bandwidth of a non-IP point-to-point link is low, only 1200bps, the sending period can be lowered to 6 seconds or 12 seconds. The main basis for link state changes is whether a link test packet has been received, see Figure 2 Upon receiving a link test message, the link status changes to ACT. If no link test message is received from the peer end for three cycles, the link status changes to IACT. If link transmission and reception are disabled, the link status changes to OFF. A link test message should contain information such as the source system, destination system, and transmission and reception counts. The specific format can be customized.

[0077] Step 2-2: Receive a link test message from the peer system on a certain link, set the link state to active (ACT), check the communication state, and if it is not ACT, set the communication state to ACT;

[0078] Communication status (CS) refers to the comprehensive status of the link between systems, including active (ACT), pending activation (IACT), and closed (OFF). Figure 3 , if all LSs 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: assemble the routing information packets of other systems whose routes are not the peer system and whose system status is ACT, and send them to the peer system;

[0082] Step 2-6: Receive the routing information message sent by the peer end, set the system status in the routing information message to ACT in the routing table of this system, set its next hop to the peer end system, and forward 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 directly closed. 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 routing information confusion. The above-mentioned directly connected system refers to the system that has a communication link with this system with only one hop, including the upper and directly connected lower systems.

[0084] 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; and if CS changes from ACT to OFF, SS becomes OFF.

[0085] Step 3: Delete the routing information using the link status, communication status, system status information, and route information cancellation message (Route Information Drop) between the upper and lower systems. Specifically, this step is broken down as follows:

[0086] Step 3-1: When the communication status of a system changes from ACT to IACT or OFF (the communication link is manually closed or abnormally disconnected), the system status 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 to 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] A routing information cancel message is generated when the system communication status changes from ACT to OFF or IACT. It should include at least the reporting system and its system status information. The specific format can be customized based on actual needs. A system does not generate a routing information cancel message regarding itself. For example, if two systems A and B are directly connected, system A will not send a routing information cancel message regarding itself to system B, and system B will not generate a routing information cancel message regarding itself.

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

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

[0093] In step 4-2, if it is found that a link with the candidate upper level is accidentally or manually activated, the link is automatically shut down immediately, and the status of each link is kept as OFF;

[0094] In step 4-3, when 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 issue for every routing protocol. In this routing protocol, each system has a unique parent, naturally forming a tree-like structure. However, the presence of alternate parent systems introduces uncertain loops into the tree-like interconnection architecture. Therefore, routing loops can be avoided by ensuring that links to alternate parent systems are closed.

[0098] Example 2:

[0099] This embodiment details the entire process of establishing, maintaining, and canceling integrated routing between systems, as well as upper-level switching to avoid loops. Figure 5 On the left, there is one IP link and one non-IP point-to-point link between system A1 and its superior A; one IP link and one non-IP point-to-point link between system A2 and its superior A; one non-IP point-to-point link between system B1 and its superior system A1, and one non-IP point-to-point link between system B1 and its alternative superior system A2; one non-IP point-to-point link between system B2 and its superior system B1, and one non-IP point-to-point link between system B2 and its alternative superior system A2. Before B1 establishes a link with its superior system 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 chain with its superior A1, see Figure 5 In the process, the link state changes to ACT, and the communication state changes to ACT simultaneously. Then, both parties send routing information update request messages to each other. After receiving A1's routing information update request message, B1 replies to A1 with B1's own routing information message and B2's routing information message. After receiving B1's routing information update request message, A1 replies to B1 with A1's own routing information message, A's routing information message, and A2's routing information message. 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 between 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 routing information cancellation message about A1, A, and A2, and sends it to B2. At A1, since no changes in the link and communication status with B1 have been detected, the relevant routing information remains unchanged. At this point, 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] After waiting for three link test message cycles, A1's link status with B1 changes to IACT due to link timeout, the communication status changes to IACT, and the system status changes to DEACT. A1 clears the routing information of B1 and B2, assembles a routing information cancellation message for B1 and B2, and sends it to A. After receiving it, A also forwards it to A2. At this point, 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 its candidate superior, A2. The link state changes to ACT, and the communication state changes to ACT. Then, both parties exchange routing information update requests. After receiving A2's routing information update request, B1 replies to A2 with B1's own routing information and B2's routing information. After receiving B1's routing information update request, A2 replies to B1 with A2's own routing information, A's routing information, and A1's routing information. At this point, the routing information formed by each system node is shown in Table 5:

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

[0113]

[0114] Example 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 status 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, system A assembles the routing information message of system A and sends it back to system B along the original route;

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

[0119] In step 2-6, system B receives the routing information message from peer system A, sets the system status in the routing information message to ACT in the routing table of this system, sets its next hop to 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 this invention, the term "next hop" is a common term used in the concept of routing. From the source node to the destination node, each node passed through is called 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 through from the source. If the source node A and the destination node B are directly connected, then the next hop from A to B is B, or simply said that 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 simply said that the route from A to B is C.

[0121] Example 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 are as shown in Table 6:

[0123] Table 6 Routing and system status information at system B, C, and 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, follow step 3-2 to assemble a 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. For all systems A1 and A2 whose routes are to 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 routing information cancellation message for 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 active 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 systems B, C, and D

[0130]

[0131] Assume that the link between system C and C1 is disconnected and the link status changes to OFF. At system B:

[0132] According to steps 3-4, system B receives a routing information cancellation message about system C1 from 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 null, 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 systems 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 is capable of storing a computer program, and when the computer program is executed by the data processing unit, the computer program can run the invention content of the method for constructing a comprehensive routing between information systems based on a hierarchical relationship provided by the present invention and some or all of the steps in each embodiment. The storage medium can be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

[0137] Those skilled in the art will 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 this understanding, the technical solutions in the embodiments of the present invention, in essence or in other words, the part that contributes to the prior art, can be embodied in the form of a computer program, i.e., a software product. The computer program software product can be stored in a storage medium and includes a number of instructions for enabling a device including a data processing unit (which can be a personal computer, server, single-chip microcomputer, MCU, or 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 approach for constructing a comprehensive routing system based on hierarchical relationships between information systems. There are numerous methods and approaches for implementing this technical solution. The above is merely a preferred embodiment of the present invention. It should be noted that those skilled in the art may make improvements and modifications without departing from the principles of the present invention, and such improvements and modifications are also within the scope of protection of the present invention. Any components not specified in this embodiment may be implemented using existing technologies.

Claims

1. A method for constructing a comprehensive routing between information systems based on hierarchical relationships, characterized in that: The steps include: Step 1: Configure 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 to it, as well as the link test message, routing information update request message, and routing information message, 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 alternative 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 hierarchical relationship between the information systems; The link described in step 1 is an IP link or a non-IP point-to-point link; The establishment of the integrated routing between the information systems described in step 2 specifically includes: Step 2-1: Activate each link between the current information system and the upper-level system or the directly connected lower-level system, and regularly send link test messages from each link to the opposite system, setting the link status to pending activation (IACT). Step 2-2: If a link test message is received from the peer system on a link, the link state is set to active ACT, and the communication state of the link is checked. If it is not active ACT, the communication state is set to active ACT. Step 2-3: When the communication status of any system B in any link with the peer system A changes from inactive to active, system B sends a routing information update request message to the peer system A. Step 2-4: After receiving the routing information update request message, peer system A assembles the routing information message of peer system A and sends it back to the system B along the original route. Step 2-5, peer system A assembles routing information packets of other systems whose routes are not to system B and whose system status is activated ACT, and sends the packets to system B; Step 2-6: System B receives the routing information message from the peer system A, sets the system status in the routing information message to ACT in the routing table of the system, sets the next hop to the peer system A, and forwards the routing information message to other directly connected systems whose communication status and system status are both ACT. Deleting routing information in step 3 specifically includes: Step 3-1: When the communication status of any system changes from ACT to IACT or OFF, the status of the system is set to DEACT or OFF in the local routing table of the current system, and its next-hop system is set to null; Step 3-2: assemble a routing information cancellation message about the system and send 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, set the system status of all systems C that are routes to this system to inactive, set the next-hop system of system C to null, assemble a routing information cancellation message about system C, and send it to all directly connected systems of the current system whose communication status and system status are both active ACT; Step 3-4: When the current system receives a routing information cancellation message from a directly connected system, it sets the system status of system C in the routing information cancellation message to the status specified in the cancellation message, sets the next hop system of the current system to null, 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. Closing the link between the current information system and the alternative superior system as described in step 4 specifically includes: Step 4-1, closing each link between the current information system and the alternative upper-level system; In step 4-2, if any link with the alternative upper-level 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 switches 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; The specified state described in steps 3-4 is OFF or DEACT.

2. A method for constructing a comprehensive routing based on hierarchical relationships between information systems according to claim 1, characterized in that: Other information systems connected to it as described in step 1 include: upper-level systems, directly connected lower-level systems, and alternative upper-level systems.

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

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

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

Images