Intersatellite routing method and device under link status periodic oscillation scenario

Abstract

The present invention discloses an inter-satellite routing method and device in a link state periodic oscillation scenario, belonging to the field of satellite communications. The method comprises: when it is detected that the link state changes from UP to DOWN, determining the destination satellite node corresponding to the forwarding next-hop satellite node of the optimal route before the link state changes is the first adjacent satellite node, and determining whether the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes after the link state changes is located outside the corresponding forwarding rectangle; if so, notifying the second adjacent satellite node of the route change, and other adjacent satellite nodes delay notifying the route change; if the link state and the optimal route are restored before the delayed release time arrives, the delayed release notification to other adjacent satellite nodes is no longer released. The present invention can reduce the impact on the inter-satellite routing of the constellation network in the link state periodic oscillation scenario.

Description

Technical Field

[0001] The present invention relates to the field of satellite communication technology, and in particular to an inter-satellite routing method and device in a link state periodic oscillation scenario. Background Art

[0002] Low earth orbit (LEO) satellite constellations, with their wide coverage and all-weather characteristics, have become the most effective solution to make up for the blind spots in ground network coverage, and are an important part of the future integrated sky, land and sea network. Satellite Internet is generally divided into three parts: constellation network, ground network and satellite terminal. Among them, the constellation network mainly carries inter-satellite interconnection services and realizes the Internet networking of the sky and the earth. Due to the characteristics of high-speed movement of the low-orbit constellation network to the ground, with an average movement speed of 7 to 8 km / s, it basically orbits the earth in about 100 minutes. Therefore, the links between satellites are extremely unstable, and the topological relationship is constantly changing, which brings great challenges to the inter-satellite routing method.

[0003] The links between satellites in the constellation network are extremely unstable. As the satellites periodically orbit the earth, the on-off status of the inter-satellite laser links changes periodically. For example, after a satellite passes through the earth's pole, the co-orbital laser link between satellites needs to be interrupted for a period of time before it can be restored; for another example, in order to prevent the satellite laser link from being affected by the solar eclipse, it also needs to be periodically opened and closed; in addition, as the satellites orbit the earth, the physical distance of the inter-satellite link also changes periodically. These factors of periodic changes in link status will lead to frequent refreshes of the routing of the entire constellation network, which in turn affects the convergence and forwarding performance of the routing.

[0004] How to reduce the impact of periodic link state oscillation on inter-satellite routing in constellation networks is an issue that needs to be addressed urgently. Summary of the invention

[0005] The present invention provides an inter-satellite routing method and device in a link state periodic oscillation scenario, which can reduce the impact of link state periodic oscillation on constellation network inter-satellite routing. The technical solution is as follows:

[0006] On the one hand, an inter-satellite routing method in a link state periodic oscillation scenario is provided, which is applied to any satellite node in a low-orbit constellation network, and the method includes:

[0007] When it is detected that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, it is determined that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and it is determined whether the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes is located outside the corresponding forwarding rectangle; if so, the current satellite node notifies the second adjacent satellite node of the route change, and other adjacent satellite nodes delay notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes;

[0008] If, before the preset delay time arrives, the link status between the current satellite node and the first adjacent satellite node recovers from DOWN to UP, and the optimal route recovers to the optimal route before the link status changes, the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if, when the preset delay time arrives, the link status between the current satellite node and the first adjacent satellite node fails to recover from DOWN to UP, the delayed notification of the route change is notified to other adjacent satellite nodes.

[0009] On the other hand, an inter-satellite routing device in a link state periodic oscillation scenario is provided, located at any satellite node in a low-orbit constellation network, the device comprising:

[0010] A determination unit is used to, when detecting that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, determine that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and determine whether the forwarding next-hop satellite node of the optimal route between the current satellite node and the first adjacent satellite node after the link state changes is located outside the corresponding forwarding rectangle; if so, trigger the route publishing processing unit to perform corresponding operations;

[0011] The route publishing processing unit is used to notify the second adjacent satellite node of the route change, and other adjacent satellite nodes are delayed in notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the current satellite node and the destination satellite node after the link state changes; if before the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state changes, then the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if when the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node fails to be restored from DOWN to UP, then the delayed route change is notified to other adjacent satellite nodes.

[0012] On the other hand, a computer device is provided, comprising a memory and a processor, wherein the memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory to implement the steps of the inter-satellite routing method in the link status periodic oscillation scenario described above.

[0013] On the other hand, a computer-readable storage medium is provided, wherein a computer program is stored in the storage medium, and when the computer program is executed by a processor, the steps of the inter-satellite routing method in the link status periodic oscillation scenario are implemented.

[0014] On the other hand, a computer program product is provided, including a computer program, which, when executed by a processor, implements the steps of the inter-satellite routing method in the link status periodic oscillation scenario described above.

[0015] The technical solution provided by the present invention can at least bring the following beneficial effects:

[0016] By improving the routing publishing rules, when the optimal route changes due to the periodic oscillation of the link status, the current satellite node only notifies the second adjacent satellite node of the route change to ensure the accurate path calculation of the second adjacent satellite node, while the notification of the route change to other adjacent satellite nodes of the current satellite node is delayed. This can reduce the frequent refresh of the constellation network route caused by the periodic oscillation of the link status, further reduce the occupation of resources such as CPU and power consumption by the routing system, make the routing learning of the entire constellation network more efficient and stable, and greatly improve the efficiency and reliability of the transmission of inter-satellite carried services. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0018] Figure 1 This is a flow chart of an inter-satellite routing method in a link status periodic oscillation scenario provided by an embodiment of the present invention;

[0019] Figure 2 is a constellation network schematic diagram provided by an embodiment of the present invention;

[0020] Figure 3 is another constellation network schematic diagram provided by an embodiment of the present invention;

[0021] Figure 4 This is a structural diagram of an inter-satellite routing device in a link status periodic oscillation scenario provided by an embodiment of the present invention;

[0022] Figure 5 It is a hardware architecture diagram of a computer device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0023] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0024] As mentioned above, the periodic oscillation of the link status will lead to frequent refresh of the routing of the entire constellation network, thereby affecting the convergence and forwarding performance of the routing.

[0025] By analyzing the existing route publishing rules, for the periodic oscillation link status, when the link status changes from UP to DOWN, the optimal route changes, and it is necessary to notify the external neighbor nodes of the route change. When the link status is restored, the optimal route will also be restored, that is, it will be restored to the optimal route before the change. At this time, it is necessary to publish the route change to the neighbor nodes again, which causes frequent route refreshes.

[0026] Based on this, the inventive concept of the present invention is that: when the link state changes from UP to DOWN, resulting in a change in the optimal route, the route change is not notified to the external neighboring nodes first, but the link state is waited to be restored from DOWN to UP, that is, the optimal route is waited to be restored to the optimal route before the link state changes. Since the optimal route before the link change is still stored in the neighboring node, there is no need to publish the route to the neighboring node after the optimal route is restored. This can reduce the frequent refresh of the constellation network route caused by the periodic oscillation factor of the link state.

[0027] The specific implementation of the above concept is described below.

[0028] Please refer to Figure 1 An inter-satellite routing method in a link state periodic oscillation scenario provided by an embodiment of the present invention is applied to any satellite node in a low-orbit constellation network. The method includes:

[0029] Step 100, when it is detected that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, it is determined that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and it is determined whether the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes after the link state changes is located outside the corresponding forwarding rectangle; if so, the current satellite node notifies the second adjacent satellite node of the route change, and other adjacent satellite nodes delay notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes;

[0030] Step 102: If, before the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node recovers from DOWN to UP, and the optimal route recovers to the optimal route before the link state changes, the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if, when the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node fails to recover from DOWN to UP, the delayed notification of the route change is notified to other adjacent satellite nodes.

[0031] In the embodiment of the present invention, by improving the route publishing rule, when the optimal route changes due to the link state periodic oscillation factor, the current satellite node only notifies the second adjacent satellite node of the route change, thereby ensuring the accurate path calculation of the second adjacent satellite node, and delays the notification of the route change to other adjacent satellite nodes of the current satellite node. In this way, the frequent refresh of the constellation network route caused by the link state periodic oscillation factor can be reduced, and the occupation of resources such as CPU and power consumption by the routing system can be further reduced, so that the route learning of the entire constellation network is more efficient and stable, and the efficiency and reliability of the inter-satellite carried service transmission are greatly improved.

[0032] In the embodiment of the present invention, when it is detected that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, the optimal route between the current satellite node and the destination satellite node will change, and the destination satellite node is a satellite node whose next-hop satellite node of the optimal route before the link state changes is the first adjacent satellite node, wherein the change of the optimal route after the link state changes has the following two situations:

[0033] Case 1: The optimal route after the change is still within the forwarding rectangle corresponding to the current satellite node and the destination satellite node;

[0034] Case 2: The optimal route after the change is outside the forwarding rectangle corresponding to the current satellite node and the destination satellite node.

[0035] For the above two situations, different routing publishing rules can be set to reduce the frequent refreshing of the entire constellation network routing.

[0036] For the above situation 1, the optimal route after the link state changes is still located in the forwarding rectangle corresponding to the current satellite node and the destination satellite node, which means that before the link state between the current satellite node and the first adjacent satellite node changes, there are at least two routes between the current satellite node and the destination satellite node in the forwarding rectangle, and the change of the optimal route this time is the switching of the primary and backup forwarding paths. Although the AsPath attributes of the primary and backup forwarding paths in the forwarding rectangle are different, the h-hops and v-hops of the routes corresponding to the primary and backup forwarding paths are equal. For the HVHR forwarding rectangle algorithm, the optimal path is calculated based on h-hops and v-hops. It can be seen that the difference in AsPath attributes does not affect the routing results of the HVHR forwarding rectangle algorithm. Therefore, when the route selection is completed and the route changes are notified outside the forwarding rectangle, whether the primary forwarding path of the route or the backup forwarding path of the route is updated as the optimal route outside the forwarding rectangle, the effect is the same.

[0037] For the first situation, in one embodiment of the present invention, in order to reduce the impact of the periodic switching of the primary and backup forwarding paths when the constellation network moves around the earth, when the primary and backup forwarding paths switch to each other or one of the primary and backup forwarding paths is interrupted, the route change situation may not be notified to those outside the forwarding rectangle, that is: if it is determined that the forwarding next-hop satellite node of the optimal route between the destination satellite node and the destination satellite node after the link state changes is located within the corresponding forwarding rectangle, the current satellite node does not notify the adjacent satellite nodes outside the corresponding forwarding rectangle of the route change situation.

[0038] Please refer to Figure 2 The constellation network shown will Figure 2 In the example, satellite node S is used as the current satellite node and satellite node M is used as the destination satellite node. Then the forwarding rectangle formed between satellite node S and satellite node M is as follows: Figure 2 As shown in the dashed box, the forwarding path between S and M includes: SHM and SLM. Assume that when it is detected that the link state between satellite node S and satellite node H changes from UP to DOWN, the optimal route changes from the SHM route to the SLM route, then the satellite node S updates the local route, but does not notify the adjacent satellite nodes C and G outside the forwarding rectangle of the route change.

[0039] For the above situation 2, the optimal route after the link state changes is outside the forwarding rectangle corresponding to the current satellite node and the destination satellite node, which means that after the link state changes, the paths between the current satellite node and the destination satellite node within the forwarding rectangle are not connected.

[0040] Please continue to refer to Figure 2 , assuming that the link status between the current satellite node S and the satellite node L changes from UP to DOWN, then the optimal route before the link status changes is the route corresponding to SHM. At this time, the link between the satellite node S and the satellite node H is disconnected, then the optimal route changes to SCDHM. The optimal route after the change is outside the forwarding rectangle.

[0041] Please refer to Figure 3 As shown in the constellation network diagram, it is assumed that satellite node S is the current satellite node and satellite node H is the destination satellite node. The forwarding rectangle between satellite node S and satellite node H is as follows: Figure 3 As shown in the dotted box (the forwarding rectangle can be equivalent to a straight line at this time), the optimal route before the link state changes is the route corresponding to the forwarding path SH. At this time, the link state between the satellite node S and the satellite node H changes from UP to DOWN, then the optimal route changes to the route corresponding to the forwarding path SCDH. The optimal route after the change is outside the forwarding rectangle.

[0042] because Figure 2 and Figure 3 The situation is the same as in the above example, both of which belong to the optimal route after the change is located outside the forwarding rectangle. The route publishing rules of the two cases are the same. Figure 3 Take the example to illustrate the improved route publishing rules.

[0043] The route publishing rule before the improvement is: after the current satellite node normally updates the optimal route after the change locally, it notifies the adjacent satellite nodes of the route change. That is, when the direct link between satellite node S and satellite node H is disconnected, satellite node S needs to send the revocation message of these routes to the satellite nodes outside the forwarding rectangle for the routes sent by all satellite nodes (satellite node H, satellite node I, ...) in the same horizontal orbit plane received from the direct link stored locally.

[0044] The improved route publishing rule is: after the current satellite node normally updates the optimal route after the change, when notifying the adjacent satellite nodes of the route change, the second adjacent satellite node is notified of the route change, and other adjacent satellite nodes are notified of the route change in a delayed manner. Among them, the second adjacent satellite node is the forwarding next hop satellite node of the optimal route between the destination satellite node and the link state after the change.

[0045] Continue to refer Figure 3 , the second adjacent satellite node is Figure 3 In order to prevent the second adjacent satellite node from calculating the direct link between the current satellite node S and the destination satellite node H during the routing calculation, it is necessary to notify the second adjacent satellite node of the route change, while the release can be delayed for other adjacent satellite nodes.

[0046] In an embodiment of the present invention, a preset delay time T needs to be pre-set, and the preset delay time can be set according to the oscillation period of the link state, and the delay time can be slightly greater than the oscillation period of the link state. If the delay time of publishing to other adjacent satellite nodes is before the preset delay time, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state changes, because the optimal route before the link state changes is still stored in the other adjacent satellite nodes, the route change situation can no longer be notified to the other adjacent satellite nodes; if the delay time of publishing to other adjacent satellite nodes reaches the preset delay time, it indicates that the disconnection of the link state is not caused by periodic oscillation, but may be caused by other reasons. At this time, it is necessary to notify the other adjacent satellite nodes of the route change situation of the delayed publishing, so as to realize the route update of the entire constellation network.

[0047] In the embodiment of the present invention, since different constellation networks use different routing protocols, the concept of the present invention can be used to perform inter-satellite routing for different routing protocols. In addition, since different routing protocols use different routing methods, different notification methods are used to notify the second adjacent satellite node of the routing change.

[0048] The following uses the currently common BGP protocol and OSPF protocol as examples to illustrate the notification methods for notifying the second adjacent satellite node of the route change.

[0049] First, the inter-satellite routing protocol is the BGP protocol

[0050] In an embodiment of the present invention, when the current satellite node notifies the second adjacent satellite node of the route change, it may specifically include: the current satellite node normally publishes the optimal route after the link state changes to the second adjacent satellite node, so that after receiving the optimal route after the link state changes, the second adjacent satellite node will detect the AsPath loop and thereby cancel the optimal route before the link state changes published by the current satellite node.

[0051] Continue with Figure 3 For example, satellite node S normally publishes the optimal route after the link state changes to satellite node C. Since the optimal route after the link state changes is sent by satellite node C, the AsPath attribute carried in the optimal route after the link state changes published by satellite node S to satellite node C includes the As value of satellite node C. Therefore, after receiving the optimal route after the link state changes, satellite node C detects the AsPath loop based on the As value of satellite node C, thereby revoking the optimal route before the link state changes published by satellite node S. At the same time, since the route in satellite node C also has a forwarding path from satellite node D, satellite node C does not need to notify adjacent satellite nodes outside the forwarding rectangle to update the routes.

[0052] If, before the delayed publishing time, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state change, the current optimal route needs to be published to the second adjacent satellite node again. In this case, the current satellite node does not need to publish the current optimal route to other adjacent satellite nodes except the second adjacent satellite node, and exits the delayed publishing state for other adjacent satellite nodes except the second adjacent satellite node.

[0053] Second, the inter-satellite routing protocol is ISIS protocol or OSPF protocol

[0054] In an embodiment of the present invention, when the current satellite node notifies the second adjacent satellite node of the route change, it may specifically include: the current satellite node publishes a link status message after the link status change and a delayed publication notification to the second adjacent satellite node, so that the second adjacent satellite node delays publishing the link status message after the link status change to its own adjacent satellite node according to the delayed publication notification.

[0055] Because in the ISIS protocol or OSPF protocol, after receiving the link state message after the link state changes, the second adjacent satellite node will not only update locally, but also notify its own adjacent satellite nodes of the link state message after the link state changes. Based on this, a delayed release notification can be sent to the second adjacent satellite node, and after receiving the delayed release notification, the second adjacent satellite node delays the release of the link state message after the link state changes to its own adjacent satellite nodes to wait until the link state is restored. This can not only avoid loops, but also reduce the frequent updates of routes in the constellation network.

[0056] It should be noted that the time for the second adjacent satellite node to delay publishing to its own adjacent satellite node may be equal to the preset delay time, or may be slightly greater than the preset delay time.

[0057] Further, since the current satellite node sends a delayed release notification to the second adjacent satellite node, if before the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state changes, then when notifying the second adjacent satellite node of the current route change, it can be achieved in at least the following two ways:

[0058] Mode 1: The current satellite node publishes the current link state message and delayed publication revocation notification to the second adjacent satellite node, so that the second adjacent satellite node cancels the publication of the link state message in the delayed publication state according to the delayed publication revocation notification.

[0059] In the first method, the second adjacent satellite node performs a local update based on the current link status message received from the current satellite node, and the route stored in the adjacent satellite node of the second adjacent satellite node itself is the same as the current optimal route. Therefore, the route status message in the delayed release state can be de-published based on the delayed release revocation notification.

[0060] Method 2: The current satellite node publishes the current link status message to the second adjacent satellite node, so that the second adjacent satellite node cancels the publication of the link status message in the delayed publication state after receiving the current link status message, and when it is determined that the current link status message is the same as the link status message published to the adjacent satellite node last time, the second adjacent satellite node no longer publishes the link status message to the adjacent satellite node.

[0061] In the second mode, the current satellite node may not send a delayed release cancellation notification, but when the second adjacent satellite node receives the current link state message released by the current satellite node, regardless of whether the link state message received this time is the link state message before the link state changes, the link state message in the delayed release state will exit the delayed release state. In addition, if it is determined that the current link state message is the same as the link state message released to the adjacent satellite node last time, there is no need to release it again.

[0062] In the embodiment of the present invention, continue with Figure 3 For example, within the scope of the route delay release time, the current satellite node S does not publish the changed optimal route to the other delayed adjacent satellite nodes (satellite node G, satellite node L). Afterwards, if the service traffic message sent from the other adjacent satellite nodes is a satellite node H, satellite node I, etc., the current satellite node S forwards the service traffic message to satellite node C according to the locally stored route, satellite node C forwards the service traffic message to satellite node D according to the locally stored route, and satellite node D forwards the service traffic message to satellite node H based on the locally stored route. It can be seen that after the service traffic message arrives at satellite node S, it will temporarily detour through satellite node C, but the service traffic message will not be interrupted.

[0063] In the entire process from link interruption to link recovery, only the second adjacent satellite node is affected by the link interruption, and all other satellite nodes will not perceive the change in routing.

[0064] The embodiments of the present invention can reduce the impact of intersatellite link periodic oscillations caused by satellite nodes in polar and solar eclipse scenarios to the range of local directly connected neighbors, thereby minimizing the impact of intersatellite link periodic oscillations that occur in a large range of constellation networks on constellation network routing. In this way, the occupation of resources such as CPU and power consumption by the routing system can be further reduced, making the routing learning of the entire constellation network more efficient and stable, and greatly improving the efficiency and reliability of intersatellite carried service transmission.

[0065] Please refer to Figure 4 The embodiment of the present invention provides an inter-satellite routing device in a link state periodic oscillation scenario, located at any satellite node in a low-orbit constellation network, and the device includes:

[0066] The determination unit 400 is used to, when detecting that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, determine that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and determine whether the forwarding next-hop satellite node of the optimal route between the current satellite node and the first adjacent satellite node after the link state changes is located outside the corresponding forwarding rectangle; if so, trigger the route publishing processing unit 402 to perform corresponding operations;

[0067] The route publishing processing unit 402 is used to notify the second adjacent satellite node of the route change, and other adjacent satellite nodes are delayed in notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the destination satellite node after the link state changes; if before the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state changes, then the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if when the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node fails to be restored from DOWN to UP, then the delayed route change is notified to other adjacent satellite nodes.

[0068] In one embodiment of the present invention, if the determination unit determines that the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state after the change is located within the corresponding forwarding rectangle, the current satellite node does not notify the adjacent satellite nodes outside the corresponding forwarding rectangle of the route change.

[0069] In one embodiment of the present invention, the inter-satellite routing protocol is the BGP protocol;

[0070] When notifying the second adjacent satellite node of the route change, the route publishing processing unit specifically includes: normally publishing the optimal route after the link state change to the second adjacent satellite node, so that after receiving the optimal route after the link state change, the second adjacent satellite node will detect the AsPath loop and thereby cancel the optimal route before the link state change published by the current satellite node.

[0071] In one embodiment of the present invention, the inter-satellite routing protocol is the ISIS protocol or the OSPF protocol;

[0072] When notifying the second adjacent satellite node of the route change, the route publishing processing unit specifically includes: publishing a link status message after the link status change and a delayed publishing notification to the second adjacent satellite node, so that the second adjacent satellite node delays publishing the link status message after the link status change to its own adjacent satellite node according to the delayed publishing notification.

[0073] In one embodiment of the present invention, when the route publishing processing unit notifies the second adjacent satellite node of the current route change, it specifically includes: publishing the current link status message and delayed publication revocation notification to the second adjacent satellite node, so that the second adjacent satellite node cancels the publication of the link status message in the delayed publication state according to the delayed publication revocation notification.

[0074] In one embodiment of the present invention, when the route publishing processing unit notifies the second adjacent satellite node of the current route change, it specifically includes: publishing the current link status message to the second adjacent satellite node, so that the second adjacent satellite node will cancel the publication of the link status message in the delayed publication state after receiving the current link status message, and when it is determined that the current link status message is the same as the link status message published to the adjacent satellite node last time, the link status message will no longer be published to the adjacent satellite node.

[0075] It should be noted that: the inter-satellite routing device in the link state periodic oscillation scenario provided in the above embodiment is only illustrated by the division of the above functional modules. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the inter-satellite routing device in the link state periodic oscillation scenario provided in the above embodiment and the inter-satellite routing method embodiment in the link state periodic oscillation scenario belong to the same concept. The specific implementation process is detailed in the method embodiment, which will not be repeated here.

[0076] The embodiment of the present application also provides a computer device, please refer to Figure 5 The computer device includes a processor and a memory, wherein at least one instruction, at least one program, a code set or an instruction set is stored in the memory, and the at least one instruction, at least one program, a code set or an instruction set is loaded and executed by the processor to implement the inter-satellite routing method in the link state periodic oscillation scenario provided by the above-mentioned method embodiments.

[0077] An embodiment of the present application also provides a computer-readable storage medium, on which is stored at least one instruction, at least one program, code set or instruction set, and the at least one instruction, at least one program, code set or instruction set is loaded and executed by a processor to implement the inter-satellite routing method in the link state periodic oscillation scenario provided by the above-mentioned method embodiments.

[0078] An embodiment of the present application also provides a computer program product, which includes a computer program. A processor of a computer device reads the computer program from a computer-readable storage medium, and the processor executes the computer program, so that the computer device executes the inter-satellite routing method in the link status periodic oscillation scenario described in any of the above embodiments.

[0079] For the convenience of description, the above system or device is described by dividing it into various modules or units according to its functions. Of course, when implementing the present application, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0080] It can be known from the description of the above implementation methods that those skilled in the art can clearly understand that the present application can be implemented by means of software plus a necessary general hardware platform. Based on such an understanding, the technical solution of the present application can be essentially or partly contributed to the prior art in the form of a software product, which can be stored in a storage medium such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in the various embodiments of the present application or certain parts of the embodiments.

[0081] Finally, it should be noted that, in this article, relational terms such as first, second, third and fourth are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0082] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. An inter-satellite routing method in a link state periodic oscillation scenario, characterized in that: Applied to any satellite node in a low-orbit constellation network, the method comprises: When it is detected that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, it is determined that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and it is determined whether the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes is located outside the corresponding forwarding rectangle; if so, the current satellite node notifies the second adjacent satellite node of the route change, and other adjacent satellite nodes delay notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state changes; If, before the preset delay time arrives, the link status between the current satellite node and the first adjacent satellite node recovers from DOWN to UP, and the optimal route recovers to the optimal route before the link status changes, the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if, when the preset delay time arrives, the link status between the current satellite node and the first adjacent satellite node fails to recover from DOWN to UP, the delayed notification of the route change is notified to other adjacent satellite nodes.

2. The method according to claim 1, characterized in that Also includes: If it is determined that the forwarding next-hop satellite node of the optimal route between the destination satellite node and the link state change is located within the corresponding forwarding rectangle, the current satellite node does not notify the adjacent satellite nodes outside the corresponding forwarding rectangle of the route change.

3. The method according to claim 1, characterized in that The inter-satellite routing protocol is BGP protocol; The current satellite node notifies the second adjacent satellite node of the route change, including: The current satellite node normally publishes the optimal route after the link state changes to the second adjacent satellite node, so that after receiving the optimal route after the link state changes, the second adjacent satellite node will detect the AsPath loop and thus cancel the optimal route before the link state changes published by the current satellite node.

4. The method according to claim 1, characterized in that The inter-satellite routing protocol is ISIS protocol or OSPF protocol; The current satellite node notifies the second adjacent satellite node of the route change, including: The current satellite node publishes a link state message after the link state changes and a delayed publication notification to the second adjacent satellite node, so that the second adjacent satellite node delays publishing the link state message after the link state changes to its own adjacent satellite node according to the delayed publication notification.

5. The method according to claim 4, characterized in that The notifying the second adjacent satellite node of the current route change includes: The current satellite node publishes the current link state message and delayed publication revocation notification to the second adjacent satellite node, so that the second adjacent satellite node cancels the publication of the link state message in the delayed publication state according to the delayed publication revocation notification.

6. The method according to claim 4, characterized in that The notifying the second adjacent satellite node of the current route change includes: The current satellite node publishes the current link status message to the second adjacent satellite node, so that the second adjacent satellite node cancels the publication of the link status message in the delayed publication state after receiving the current link status message, and when it is determined that the current link status message is the same as the link status message published to the adjacent satellite node last time, the second adjacent satellite node no longer publishes the link status message to the adjacent satellite node.

7. An inter-satellite routing device in a link state periodic oscillation scenario, characterized in that: Any satellite node located in a low-orbit constellation network, the device comprising: A determination unit is used to, when detecting that the link state between the current satellite node and the first adjacent satellite node changes from UP to DOWN, determine that the forwarding next-hop satellite node of the optimal route before the link state changes is the destination satellite node corresponding to the first adjacent satellite node, and determine whether the forwarding next-hop satellite node of the optimal route between the current satellite node and the first adjacent satellite node after the link state changes is located outside the corresponding forwarding rectangle; if so, trigger the route publishing processing unit to perform corresponding operations; The route publishing processing unit is used to notify the second adjacent satellite node of the route change, and other adjacent satellite nodes are delayed in notifying the route change; the second adjacent satellite node is the forwarding next-hop satellite node of the optimal route between the current satellite node and the destination satellite node after the link state changes; if before the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node is restored from DOWN to UP, and the optimal route is restored to the optimal route before the link state changes, then the current route change is notified to the second adjacent satellite node, but the route change is no longer notified to other adjacent satellite nodes; if when the preset delay time arrives, the link state between the current satellite node and the first adjacent satellite node fails to be restored from DOWN to UP, then the delayed route change is notified to other adjacent satellite nodes.

8. A computer device, characterized in that: The computer device includes a memory and a processor, the memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory to implement the steps of any one of the methods described in claims 1-6.

9. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method described in any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The method comprises a computer program, wherein when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images