A method, apparatus, equipment and medium for accelerating convergence in satellite networks

By defining the local network scope within the satellite network and using a horizontal segmentation approach to query and update routes, the problems of slow convergence speed and high bandwidth utilization in satellite networks are solved, achieving fast and optimized network convergence.

CN117833988BActive Publication Date: 2026-11-17PURPLE MOUNTAIN LAB
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202311865247.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-12-29
Publication Date
2026-11-17
Estimated Expiration
2043-12-29

AI Technical Summary

Technical Problem

Traditional satellite networks suffer from slow convergence speed, frequent link failures, and high bandwidth utilization, resulting in poor network performance.

Method used

By determining the local network range within the satellite network, query messages are sent using a horizontal splitting method to determine the existence of routes. If no route exists, all routes in the network are deleted and updated; if a route exists, the optimal route is determined to complete network convergence.

Benefits of technology

It improves the convergence speed of satellite networks, reduces network bandwidth overhead, avoids routing loops, reduces the number of messages sent and processed, and ensures rapid convergence and optimal route determination.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117833988B_ABST
    Figure CN117833988B_ABST
Patent Text Reader

Abstract

This application discloses a method, apparatus, device, and medium for accelerating convergence in satellite networks, relating to the field of satellite networking. The method includes: when the original optimal route from the source node to the target node does not exist, determining, based on a horizontal segmentation approach, within a defined local network scope by sending query messages, whether other routes to the target node exist within the local network scope; if they exist, determining the current optimal route from the source node to the target node; if they do not exist, deleting routes to the target node from all nodes in the satellite network by sending request messages; and during the deletion process, when it is determined that the source node can reach the target node within the satellite network, updating the route to the target node within the satellite network by sending update messages. The local network scope reduces the scope of judgment, and the horizontal segmentation approach ensures that packets received by a node will not be sent from that node, reducing the number of packets sent and processed, lowering bandwidth overhead, and improving convergence efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of satellite networking technology, and in particular to a method, apparatus, equipment and medium for accelerating satellite network convergence. Background Technology

[0002] Low Earth orbit constellations consist of multiple orbital planes and satellites evenly distributed across those planes. Each satellite has four inter-satellite links (front, rear, left, and right) that connect to its four neighboring satellites. The configurations include polar orbit constellations and inclined orbit constellations.

[0003] Currently, inter-satellite links are an important carrier for realizing satellite networking. They can not only solve the problem of limited ground station construction that prevents the provision of network services, but also provide long-distance, low-latency transmission. However, while new low-Earth orbit constellations have a large number of satellite nodes, traditional routing protocols suffer from problems such as slow satellite network convergence speed, frequent link failures, and high bandwidth occupancy. Therefore, how to improve the convergence speed of satellite networks and reduce network bandwidth overhead is an urgent problem to be solved. Summary of the Invention

[0004] In view of this, the purpose of this invention is to provide a method, apparatus, device, and medium for accelerating satellite network convergence, which can improve the convergence speed of satellite networks and reduce network bandwidth overhead. The specific solution is as follows: Firstly, this application discloses a method for accelerating convergence of satellite networks, including: When the original optimal route from the source node to the target node does not exist, the local network range corresponding to the source node is determined from the satellite network; Based on the horizontal splitting method, a query message is sent to determine whether there are other routes from the source node to the target node within the local network range; If it exists, the current optimal route from the source node to the target node is determined to complete the convergence of the satellite network; If it does not exist, the routes to the target node in all nodes of the satellite network are deleted by sending request messages. During the deletion process, when it is determined that the source node in the satellite network can reach the target node, the routes to the target node in the satellite network are updated by sending update messages to complete the convergence of the satellite network.

[0005] Optionally, determining the local network range corresponding to the source node from the satellite network includes: The local network range centered on the source node is determined from the satellite network.

[0006] Optionally, determining whether there are other routes from the source node to the target node within the local network range based on the split-horizon approach by sending query messages includes: The first current node sends a routing query message to the first neighbor node that meets the sending conditions; the initial first current node is the source node. Based on the routing query message, the first neighbor node queries whether there is a route among the first neighbor nodes that reaches the target node without passing through the first current node; If it exists, the first neighbor node will send a target reachable message back to the source node based on the routing query message; If it does not exist, a new routing query message is generated based on the routing query message, and it is determined whether the first neighbor node is the boundary node of the local network range based on the new routing query message. If it is, the first neighbor node sends a target unreachable message to the source node through the first current node. If not, the first neighbor node is taken as the first current node, and the process jumps to the step of sending a routing query message to the first neighbor node corresponding to the first current node that meets the sending conditions through the first current node. The source node determines whether it has obtained the target reachable message. If the target reachable message has been obtained, then there are other routes from the source node to the target node within the local network scope. If the target reachable message has not been obtained, then there are no other routes.

[0007] Optionally, the routing query message sent by the first current node to the first neighbor node records the metric value from the first current node to the boundary node; Accordingly, generating a new routing query message based on the routing query message includes: A new routing query message is generated by subtracting the unit metric value from the metric value recorded in the routing query message; the maximum metric value corresponding to the local network range is recorded in the routing query message sent by the source node. Accordingly, if the metric value recorded in the new routing query message generated by the first neighbor node is not 0, the first neighbor node is not a boundary node of the local network range; if the metric value recorded in the new routing query message generated by the first neighbor node is 0, the first neighbor node is a boundary node of the local network range.

[0008] Optionally, the step of sending a target reachable message back to the source node through the first neighbor node based on the routing query message includes: The first current node is determined by the first neighbor node based on the routing query message, and a reference reachability message recording the metric value from the first neighbor node to the target node is fed back to the first current node; The first current node generates a new reference reachable message based on the reference reachable message, which records the metric value from the first current node to the target node; The first current node is designated as the first neighbor node, and the previous first current node is determined based on the routing query message of the first neighbor node. The process then proceeds to the step of feeding back a reference reachable message that records the metric value from the first neighbor node to the target node to the first current node, until a target reachable message is fed back to the source node; the target reachable message records the metric value from the source node to the target node. Accordingly, determining the current optimal route from the source node to the target node includes: The route corresponding to the target reachable message with the smallest metric value among all the target reachable messages is taken as the current optimal route from the source node to the target node.

[0009] Optionally, the step of deleting routes to the target node from all nodes in the satellite network based on sending request messages, and updating routes to the target node in the satellite network by sending update messages during the deletion process when it is determined that the source node in the satellite network can reach the target node, includes: The second current node sends a route deletion request message to the second neighbor node of the second current node; the initial second current node is the source node; If the second neighbor node is not the target node, then the route to the target node in the second neighbor node is deleted through the second neighbor node, and the second neighbor node is set as the second current node. Then, the process jumps to the step of sending a route deletion request message to the second neighbor node of the second current node through the second current node, until the route to the target node in all nodes in the satellite network is deleted. If the second neighbor node is the target node, it is determined that the source node in the satellite network can reach the target node, and the route to the target node is updated in the satellite network by sending an update message.

[0010] Optionally, updating the route to the target node in the satellite network by sending update messages includes: The third current node sends a route update message to its third neighbor node, recording the metric values ​​between the third current node and the target node; the initial third current node is the target node. The third neighbor node adds a route to the target node based on the route update message, and updates the metric value from the third neighbor node to the target node to obtain a new route update message; The third neighbor node is designated as the third current node, and the process jumps to the step of sending a route update message recording the metric value between the third current node and the target node to the third neighbor node of the third current node through the third current node, until the route to the target node is updated in the satellite network.

[0011] Secondly, this application discloses a satellite network accelerated convergence device, comprising: The range determination module is used to determine the local network range corresponding to the source node from the satellite network when the original optimal route from the source node to the target node does not exist. The judgment module is used to determine, based on the horizontal splitting method, whether there are other routes to the target node within the local network range by sending query messages; The optimal path determination module is used to determine the current optimal route from the source node to the target node if it exists, so as to complete the convergence of the satellite network. The deletion or update module is used to delete routes to the target node from all nodes of the satellite network if the route does not exist by sending a request message, and to update the route to the target node in the satellite network by sending an update message when it is determined during the deletion process that the source node in the satellite network can reach the target node, so as to complete the convergence of the satellite network.

[0012] Thirdly, this application discloses an electronic device, including: Memory, used to store computer programs; A processor is used to execute the computer program to implement the aforementioned disclosed method for accelerating convergence of satellite networks.

[0013] Fourthly, this application discloses a computer-readable storage medium for storing a computer program; wherein, when the computer program is executed by a processor, it implements the aforementioned satellite network accelerated convergence method.

[0014] As can be seen, when the original optimal route from the source node to the target node does not exist, this application determines the local network range corresponding to the source node from the satellite network; based on the horizontal segmentation method, it determines whether there are other routes from the source node to the target node in the local network range by sending query messages; if they exist, it determines the current optimal route from the source node to the target node to complete the convergence of the satellite network; if they do not exist, it deletes the routes to the target node from all nodes in the satellite network by sending request messages, and during the deletion process, when it is determined that the source node can reach the target node in the satellite network, it updates the routes to the target node in the satellite network by sending update messages to complete the convergence of the satellite network. Therefore, this application queries within a local network scope rather than the entire satellite network, reducing the query scope and improving the convergence speed of the satellite network. In addition, the horizontal segmentation method prevents routing loops in message transmission, ensuring that messages received by a node do not originate from that node, reducing the number of messages sent and processed, lowering network bandwidth overhead, and facilitating rapid convergence. Furthermore, when a route from the source node to the target node is found within the local network scope, the optimal route is determined to complete network convergence. When no route from the source node to the target node is found within the local network scope, all routes leading to the target node are deleted. However, if during the deletion process it is discovered that the source node can reach the target node within the satellite network, the satellite network route is updated to correct the judgment error within the local network scope, thereby completing network convergence. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0016] Figure 1 This is a flowchart of a satellite network accelerated convergence method disclosed in this application; Figure 2 This is a schematic diagram of a local network range disclosed in this application; Figure 3 This is a schematic diagram of a satellite network message header structure disclosed in this application; Figure 4 This is a schematic diagram of a satellite network IP metric message structure disclosed in this application; Figure 5 This application discloses a flowchart of a specific method for accelerating convergence in satellite networks. Figure 6 This is a schematic diagram of a satellite network IP request message structure disclosed in this application; Figure 7 This is a schematic diagram of the structure of a satellite network accelerated convergence device disclosed in this application; Figure 8 This is a structural diagram of an electronic device disclosed in this application. Detailed Implementation

[0017] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0018] Currently, inter-satellite links are an important carrier for realizing satellite networking. They can not only solve the problem of limited ground station construction that prevents the provision of network services, but also provide long-distance, low-latency transmission. However, while new low-Earth orbit constellations have a large number of satellite nodes, traditional routing protocols suffer from problems such as slow satellite network convergence speed, frequent link failures, and high bandwidth occupancy. Therefore, how to improve the convergence speed of satellite networks and reduce network bandwidth overhead is an urgent problem to be solved.

[0019] Therefore, this application proposes a satellite network convergence scheme that can improve the convergence speed of satellite networks and reduce network bandwidth overhead.

[0020] This application discloses a method for accelerating convergence in satellite networks. (See also...) Figure 1 As shown, the method includes: Step S11: When the original optimal route from the source node to the target node does not exist, determine the local network range corresponding to the source node from the satellite network.

[0021] In this embodiment, determining the local network range corresponding to the source node from the satellite network includes: determining the local network range centered on the source node from the satellite network.

[0022] In this embodiment, the local network range can be set by means of metrics such as setting distance and hop count. The specific distance and hop count are set according to the network size. They can be set randomly by humans or according to the characteristics of the source node and the target node.

[0023] See Figure 2The diagram shows a local network range; S is the source node, D is the target node, and the local network range is set based on the number of hops. The P line indicates a local network range of 1 hop, the Q line indicates a local network range of 2 hops, and the M line indicates a local network range of 3 hops.

[0024] Step S12: Based on the horizontal splitting method, determine whether there are other routes to the target node within the local network range by sending query messages.

[0025] It should be noted that split horizon is a technique to avoid routing loops and speed up route convergence. Since a router may receive routing information that it itself has sent, and this information is useless, split horizon does not reverse-promote any routing update information received from the interruption. Instead, it only promotes routes that will not be cleared due to counting to infinity. Therefore, by using split horizon, routing information received on an interface can be prevented from being sent out again from that interface, reducing the amount of routing information sent and processed, which is beneficial for fast convergence.

[0026] In this embodiment, the existence of other routes to the target node can be determined based on the method of message transmission between nodes in the local network range. It should be noted that determining within the local network range takes less time than determining within the entire satellite network range, which can improve the convergence speed of the satellite network. The number of messages sent is also less, which can reduce network bandwidth overhead.

[0027] The specific method is as follows: Based on the horizontal splitting approach, determining whether there are other routes from the source node to the target node within the local network range by sending query messages includes: sending a route query message from the first current node to a first neighbor node that meets the sending conditions; the initial first current node is the source node; the first neighbor node queries whether there is a route to the target node that does not pass through the first current node based on the route query message; if it exists, the first neighbor node sends a target reachability message back to the source node based on the route query message; if it does not exist, a new route query is generated based on the route query message. The message is processed, and based on the new routing query message, it is determined whether the first neighbor node is a boundary node of the local network range. If so, the first neighbor node sends a target unreachable message to the source node through the first current node. If not, the first neighbor node is taken as the first current node, and the process jumps to the step of sending a routing query message to the first neighbor node corresponding to the first current node that meets the sending conditions. The source node determines whether the target reachable message has been obtained. If the target reachable message has been obtained, the source node has other routes to the target node in the local network range. If the target reachable message has not been obtained, there are no other routes.

[0028] In this embodiment, the specific process of feeding back a target reachable message to the source node through the first neighbor node based on the routing query message is as follows: the first neighbor node determines the first current node based on the routing query message, and feeds back a reference reachable message recording the metric value from the first neighbor node to the target node to the first current node; the first current node generates a new reference reachable message recording the metric value from the first current node to the target node based on the reference reachable message; the first current node is taken as the first neighbor node, and the previous first current node is determined based on the routing query message of the first neighbor node, and the process jumps to the step of feeding back the reference reachable message recording the metric value from the first neighbor node to the target node to the first current node, until the target reachable message is fed back to the source node; the target reachable message records the metric value from the source node to the target node.

[0029] It should be noted that the target unreachable message is a message that records a preset metric value indicating that the message is unreachable. The preset metric value is a pre-set metric value that will not be the same as the metric value in the message.

[0030] It should be noted that if the local network range is 3 hops, the default metric is the number of hops greater than 3 hops, so as not to be confused with reachable messages.

[0031] In this embodiment, the routing query message sent by the first current node to the first neighbor node records the metric value from the first current node to the boundary node; correspondingly, generating a new routing query message based on the routing query message includes: subtracting the unit metric value from the metric value recorded in the local network scope field of the routing query message to generate a new routing query message; correspondingly, when the metric value recorded in the new routing query message generated by the first neighbor node is not 0, the first neighbor node is not the boundary node of the local network scope; when the metric value recorded in the new routing query message generated by the first neighbor node is 0, the first neighbor node is the boundary node of the local network scope.

[0032] In one specific embodiment, see Figure 2 As shown, within a 1-hop range, S sends routing query messages to its three adjacent neighbor nodes other than D. Since the three neighbor nodes are boundary nodes and not D, they will send back an unreachable message to S.

[0033] In one specific embodiment, see Figure 2 As shown, within a 2-hop range, S sends route query messages to its three adjacent neighbor nodes other than D. If only one of the three neighbor nodes has a route to D via S, then the three neighbor nodes will send back an S unreachable message and continue to send query messages to the other neighbor nodes other than S. At this point, the boundary node is reached and is not D, so an S unreachable message will be sent back.

[0034] In one specific embodiment, see Figure 2As shown, within a 3-hop range, S sends route query messages to its three adjacent neighbor nodes (excluding D). If only one of these three neighbor nodes has a route to D via S, then the three neighbor nodes will report an unreachable message for S and continue sending query messages to the other neighbor nodes (excluding S). If at this time, one of the other neighbor nodes has a route to D that does not go through S, then that node corresponding to the route that does not go through S will report a reachable message to the node that sent the query message to that node, and continue to send new reachable messages. The reachable message is fed back to the node that sent the query message to the node that received the reachable message, until it reaches node S. However, if there is no route to D without going through S, an unreachable message is fed back to the node that sent the query message to that node, and this unreachable message continues to be fed back to the node that sent the query message to the node that received the unreachable message, until it reaches node S. A single-sided example is as follows: 1. S sends a query message upwards to node A. Node A detects that it has no route to D without going through S, and sends a query message to the right to node B. Node B queries... 1. Upon discovering that a route exists from B to node D, B determines the metric from B to D. B sends a feedback message containing the metric from B to D back to A. A determines the metric from A to D based on the received feedback message and sends a feedback message containing the metric from A to D back to S. S calculates the metric from S to D. (The above feedback message is a reachability message.) 2. S sends a query message to node A. Node A detects that it has a route to D without going through S, determines the metric from A to D, and sends a feedback message containing the metric from A to D back to S. S calculates the metric from S to D. 3. S sends a query message to node A. Node A detects that it has no route to D without going through S, and sends a query message to node C. Node C detects that it has no route to D without going through S, and sends a query message to node E to the right. Since node E is a boundary node, E sends an unreachable message with a preset metric to node C. Node C sends an unreachable message with a preset metric to node A. Node A sends an unreachable message with a preset metric to S.

[0035] It should be noted that the message format in this application may be as follows: Figure 3 and Figure 4 As shown, Figure 3 This is a schematic diagram of the satellite network message header structure. Figure 4 This is a schematic diagram of the IP metric message structure for a satellite network (IP stands for Internet Protocol).

[0036] It should be noted that the routing query message is shown below. Figure 3 and Figure 4As shown, the message uses a TLV (Type, Length, Value) format, containing, but not limited to, fields such as the target network address (IP address), subnet mask length, metric value, and query range (restricted range). The query operation field (opcode, usually represented by 3) is included in the message header. When the source node sends a query message, it sets the query range field to the maximum query range value and sends it to neighboring nodes in a decreasing metric value manner until the limit value reaches 0, at which point it stops sending queries. It should be noted that the restricted range represents the limited query scope (local network scope), and the restricted range records the metric value corresponding to the local network scope; that is, refer to... Figure 2 As shown, if the local network range is P, then the restricted range records 1 hop; if it is Q, then the restricted range records 2 hops; and if it is M, then the restricted range records 3 hops. Additionally, Figure 3 The identifier indicates whether it's the initial message sent (identified as 01) or an intermediate message (identified as 02); the sequence number indicates which message the current node sent, used to distinguish messages sent by the current node; the acknowledgment number indicates which message the current node replied to, and in a routing query message, the acknowledgment number is 0; the autonomous system number is used to distinguish different network areas, and nodes in different network areas cannot communicate; the checksum is used to ensure that the routing query message received by a neighboring node is the same as the routing query message sent by the current node. The neighboring node will recalculate the checksum of the routing query message and compare it with the checksum recorded in the routing query message. If they are the same, the routing query message is the same; if they are different, the routing query message has changed.

[0037] It should be noted that the routing reply messages (including reachable and unreachable messages) are detailed in [link to documentation]. Figure 3 and Figure 4 As shown, the TLV format is used. The TLV includes, but is not limited to, fields such as the target network address (IP address), subnet mask length, metric value, and query range (restricted range or limited range). The response operation field (opcode, usually represented by 4) is included in the message header. When the query range field is equal to 0, the result is replied to the neighbor node that sent the query request based on the routing convergence status of the edge nodes of the range. If convergence is completed within the limited range, the metric value of the current node reaching the target node is replied (recorded in the metric value field); otherwise, the metric value of reaching the target network is replied as unreachable, i.e., a preset metric value is replied.

[0038] In one specific embodiment, node A sends a routing query message to node B. At this time, the sequence number in the routing query message indicates which message node A sent. Let's say the sequence number is 3. The acknowledgment number in the routing query message is 0. When node B sends a routing reply message back to node A, the sequence number indicates which message node B sent. Let's say the sequence number is 20. Since the routing reply message is the routing query message with sequence number 3 from node A, the acknowledgment number of the routing reply message is 3.

[0039] Step S13: If it exists, determine the current optimal route from the source node to the target node to complete the convergence of the satellite network.

[0040] In this embodiment, determining the current optimal route from the source node to the target node includes: taking the route corresponding to the target reachable message with the smallest metric value among all the target reachable messages as the current optimal route from the source node to the target node.

[0041] It should be noted that the smallest metric value indicates the shortest path, which can be considered the optimal path.

[0042] Step S14: If it does not exist, delete the routes to the target node from all nodes in the satellite network by sending a request message. During the deletion process, when it is determined that the source node in the satellite network can reach the target node, update the routes to the target node in the satellite network by sending an update message to complete the convergence of the satellite network.

[0043] In this embodiment, if there is no reachable message, it means that there is no other route from the source node to the target node in the local network range, that is, there is no path from the source node to the target node. At this time, the routes in all nodes of the network need to be deleted. However, if it is found that the source node in the satellite network can reach the target node during the deletion process, the route to the target node is updated in the satellite network by sending an update message.

[0044] In one specific embodiment, see Figure 2 As shown, when querying within the P range, the result is that there is no route from the source node S to the target node D, but there is a route within the M range: for example, the SABD route. Therefore, when querying within the local P range, the query result is correct locally (that is, there is no route from the source node S to the target node D within the P range), but incorrect in the entire network range (that is, the SABD route exists in the entire network range). Therefore, during the deletion process (the deletion process in the entire network range mentioned above), it will be found that the source node has a route to the target node.

[0045] In summary, the satellite network range-limited routing query method refers to a method where, when network topology changes render the original path unreachable, the source node uses a horizontal splitting strategy to limit the range of routes to the target network. This avoids the problems of slow convergence, high network overhead, and prolonged response time caused by a full network query. The satellite network routing query range is affected by factors such as topology and link failure rate. Furthermore, the satellite network route reachability determination method uses the metric field of the route from the source node to the target node in the feedback message received within the limited range to determine the reachability of the target node. If the current node does not have a reachable route to the target node, it needs to send a query message to its neighboring nodes. After receiving the query message, the neighboring node checks if there are any backup reachable routes besides the querying neighbor. If so, it replies with the metric value of the currently reachable path to the querying node; otherwise, it continues querying until it replies that the target node is unreachable from the source node. The source node determines the reachability of the target network based on the received replies.

[0046] For details, see Figure 2 As shown, based on the horizontal partitioning approach, the specific method for determining whether the source node has other routes to the target node within the local network range by sending query messages is as follows: First, after the source node S discovers that the path to the target node D is unreachable, it uses the horizontal partitioning approach to send range-restricted query messages to its neighboring nodes to check whether the neighboring nodes have paths to the target node. Second, after receiving the query messages, the neighboring nodes determine whether the current node is a range-restricted boundary node. If it is a boundary node, it sends a path-unreachable reply message to the original querying node; otherwise, it determines whether there is a backup reachable path. If there is, it sends a distance metric to the target node to the source querying node; otherwise, it continues to query reachable paths to the target node in decreasing order within the restricted range. Third, after receiving all the sent query messages, the source node reconverges based on the path metric values ​​replied by the neighboring nodes to find the optimal path.

[0047] As can be seen, when the original optimal route from the source node to the target node does not exist, this application determines the local network range corresponding to the source node from the satellite network; based on the horizontal segmentation method, it determines whether there are other routes from the source node to the target node in the local network range by sending query messages; if they exist, it determines the current optimal route from the source node to the target node to complete the convergence of the satellite network; if they do not exist, it deletes the routes to the target node from all nodes in the satellite network by sending request messages, and during the deletion process, when it is determined that the source node can reach the target node in the satellite network, it updates the routes to the target node in the satellite network by sending update messages to complete the convergence of the satellite network. Therefore, this application queries within a local network scope rather than the entire satellite network, reducing the query scope and improving the convergence speed of the satellite network. In addition, the horizontal segmentation method prevents routing loops in message transmission, ensuring that messages received by a node do not originate from that node, reducing the number of messages sent and processed, lowering network bandwidth overhead, and facilitating rapid convergence. Furthermore, when a route from the source node to the target node is found within the local network scope, the optimal route is determined to complete network convergence. When no route from the source node to the target node is found within the local network scope, all routes leading to the target node are deleted. However, if during the deletion process it is discovered that the source node can reach the target node within the satellite network, the satellite network route is updated to correct the judgment error within the local network scope, thereby completing network convergence.

[0048] This application discloses a specific method for accelerating convergence in satellite networks. Compared to the previous embodiment, this embodiment further explains and optimizes the technical solution. See also... Figure 5 As shown, the method of deleting routes to the target node from all nodes in the satellite network based on sending request messages, and updating the routes to the target node in the satellite network by sending update messages during the deletion process when it is determined that the source node in the satellite network can reach the target node, specifically includes: Step S21: Send a route deletion request message to the second neighbor node of the second current node through the second current node; the initial second current node is the source node.

[0049] In this embodiment, the network-wide request message format of the satellite network is a message sent by the source node to neighboring nodes to request and facilitate rapid convergence of relevant nodes when the source node fails to find a reachable path to the target node within a limited range. The route deletion request message is a network-wide request message; the network-wide request message uses the TLV format, which includes, but is not limited to, TLV type, TLV length, subnet mask bits, destination address (IP address), etc., and the request operation field is included in the message header. See details... Figure 3 and Figure 6 As shown, Figure 6 This is a schematic diagram of the structure of a satellite network IP request message, in which... Figure 3 The opcode is a setting request identifier, usually represented by 2. Figure 6 This represents the structure of a satellite network IP address request message, used to indicate the requested IP address and mask length.

[0050] Step S22: If the second neighbor node is not the target node, then delete the route to the target node from the second neighbor node, and set the second neighbor node as the second current node, and jump to the step of sending a route deletion request message to the second neighbor node of the second current node through the second current node, until the route to the target node from all nodes in the satellite network is deleted.

[0051] In this embodiment, in the step of deleting routes from the second neighboring nodes that pass through all the second current nodes and through the source node to the target node, all the second current nodes refer to nodes that have previously sent route deletion request messages. When there are routes from the second neighboring nodes that pass through all the second current nodes, it indicates that a path loop has occurred. In this case, the target node cannot be reached, and this loop needs to be prevented; therefore, the route needs to be deleted.

[0052] Step S23: If the second neighbor node is the target node, then it is determined that the source node in the satellite network can reach the target node, and the route to the target node is updated in the satellite network by sending an update message.

[0053] In this embodiment, updating the route to the target node in the satellite network by sending update messages includes: sending a route update message recording the metric value between the third current node and the target node to the third neighbor node of the third current node; the initial third current node is the target node; the third neighbor node adds a route to the target node based on the route update message and updates the metric value between the third neighbor node and the target node to obtain a new route update message; the third neighbor node is set as the third current node, and the process jumps to the step of sending a route update message recording the metric value between the third current node and the target node to the third neighbor node of the third current node, until the route to the target node is updated in the satellite network. It should be noted that this update involves updating the route from a node in the satellite network to the target node within the satellite network itself.

[0054] It should be noted that for details on routing update messages, please refer to [link / reference]. Figure 3 and Figure 4 As shown, Figure 3 In this context, the opcode is the setting update identifier, usually represented by 1. Figure 4 This represents the structure of a satellite network IP address metric message, indicating the metric value reaching the target network.

[0055] In one specific embodiment, the initial second current node is the source node. Starting from node S, a route is deleted across the entire network. Node S sends a route deletion request message to node A (specifically, other neighboring nodes of S are not listed here). Then, node A sends a route deletion request message to node B (specifically, other neighboring nodes of A are not listed here). Node B sends a route deletion request message to node D (specifically, other neighboring nodes of B are not listed here). However, node D is the target node. Therefore, this indicates that the source node can reach the target node, meaning there exists a route from S to D. Then, the routes from each node between S and D to the target node D are restored. Starting from the target node D, route update messages are sent. Node D sends route update messages to node B (details will not be given here, other neighboring nodes of D will not be listed), updating the routes from node B to node D. Then, node B sends route update messages to node A (details will not be given here, other neighboring nodes of B will not be listed), updating the routes from node A to node D. Then, node A sends route update messages to node S (details will not be given here, other neighboring nodes of A will not be listed), updating the routes from node S to node D.

[0056] In one specific embodiment, in the step of updating the route to the target node in the satellite network by sending update messages, the added route to the target node can be multiple, with the one with the lowest metric value being selected as the optimal route and the others as backup routes. Alternatively, routes with higher metrics can be removed. For details, see [link to documentation]. Figure 2 As shown, the route between node D and node A includes DBA and DBECA. The former has a metric value of 2 and the latter has a metric value of 4. The former can be used as the optimal route and the latter as the backup route.

[0057] In summary, the accelerated convergence method for unreachable routes in satellite networks proposed in this application refers to the following: when no reachable path to the target network can be found within a limited range, the current node will determine that the target network is unreachable. The source node sends a network-wide request message to its neighboring nodes. Upon receiving the request message, the neighboring nodes determine whether there is a route passing through the requesting node or a route to the target network. If a route passing through the requesting node or a route to the target network exists, the request message is forwarded to the neighboring nodes and the route to that network is deleted; otherwise, no action is taken.

[0058] For detailed steps, please refer to Figure 2 As shown, firstly, source node S receives all replies and determines that target node D is unreachable, requiring convergence of all routes to target node D across the entire network (updating routes, including deleting non-existent routes and adding new routes); secondly, source node S sends request messages to all neighboring nodes. When the next hop of the target node is a requesting node that previously sent a request message (i.e., when the target node's neighboring node is a requesting node that previously sent a request message), it continues to forward request messages and deletes routes from the current node to target node D; thirdly, when a route to target node D exists, it continues to forward request messages along the path to target node D and deletes routes from the current node to target node D, until all routes to target node D across the entire network are converged.

[0059] In summary, the convergence method for reachable routes in satellite networks refers to the process where, when a request message is sent to a node, the node checks the reachability of the interface connecting to the target node and then sends an update message to its neighboring nodes, thus completing the re-convergence of routes across the entire network. The convergence mechanism for reachable routes in satellite networks refers to the process where, if a node confirms that the target node is functioning correctly, it sends the target node address to its neighboring nodes according to the convergence message format. After receiving the message, the neighboring nodes calculate the metric value of the current node reaching the target node and complete the convergence, then send the latest metric value to their neighboring nodes, thereby achieving the re-convergence of routes to the target node across the entire network.

[0060] For detailed steps, please refer to Figure 2 As shown, firstly, when the source node S determines that the destination network is unreachable and sends a request message, when the request message is sent to the target node D where the destination network is located, the target node D finds that the destination network is in a normal state. Secondly, the target node D sends a target network update message to its neighboring nodes to correct the network's erroneous judgment on the reachability of the target network and to reconverge the routes to the destination network. Thirdly, after receiving the update message sent by the target node D, the neighboring nodes recalculate the metric value to reach the target network, complete the convergence, and send the updated metric value to the neighboring nodes again, thereby achieving the reconvergence of the network's reach to the target network.

[0061] As can be seen, this application sends a route deletion request message to the second neighbor node of the second current node through the second current node; the initial second current node is the source node; if the second neighbor node is not the target node, the route to the target node in the second neighbor node is deleted through the second neighbor node, and the second neighbor node is set as the second current node, and the process jumps to the step of sending a route deletion request message to the second neighbor node of the second current node through the second current node, until the route to the target node in all nodes in the satellite network is deleted; if the second neighbor node is the target node, it is determined that the source node in the satellite network can reach the target node, and the route to the target node is updated in the satellite network by sending an update message. Therefore, it can be seen that during the network convergence process of this application, the horizontal segmentation method still ensures that there are no routing loops in message transmission, so that messages received by a node will not be sent from that node, reducing the number of messages sent and processed, reducing network bandwidth overhead, and facilitating rapid convergence. In addition, when no route from the source node to the target node can be found in the local network, this application will delete all routes in the satellite network that pass through the second current node and the source node to the target node. However, if a route from the source node to the target node is found during the deletion process, the route in the satellite network will be updated to correct the judgment error in the local network and further complete the network convergence.

[0062] Accordingly, this application also discloses a satellite network accelerated convergence device, see [link to relevant documentation]. Figure 7 As shown, the device includes: The range determination module 11 is used to determine the local network range corresponding to the source node from the satellite network when the original optimal route from the source node to the target node does not exist. The judgment module 12 is used to determine, based on the horizontal splitting method, whether there are other routes to the target node in the local network range by sending a query message; The optimal path determination module 13 is used to determine the current optimal route from the source node to the target node if it exists, so as to complete the convergence of the satellite network. The deletion or update module 14 is used to delete the routes to the target node from all nodes of the satellite network by sending a request message if the route does not exist, and to update the route to the target node in the satellite network by sending an update message when it is determined during the deletion process that the source node in the satellite network can reach the target node, so as to complete the convergence of the satellite network.

[0063] The more specific working process of each of the above modules can be found in the corresponding content disclosed in the foregoing embodiments, and will not be repeated here.

[0064] As can be seen, this application queries within a local network scope rather than the entire satellite network, reducing the query scope and improving the convergence speed of the satellite network. In addition, the horizontal segmentation method prevents routing loops in message transmission, ensuring that messages received by a node do not originate from that node, reducing the number of messages sent and processed, lowering network bandwidth overhead, and facilitating rapid convergence. Furthermore, when a route from the source node to the target node is found within the local network scope, the optimal route is determined to complete network convergence. When no route from the source node to the target node is found within the local network scope, all routes leading to the target node are deleted. However, if during the deletion process it is discovered that the source node can reach the target node within the satellite network, the satellite network route is updated to correct the judgment error within the local network scope, thereby completing network convergence.

[0065] Furthermore, embodiments of this application also provide an electronic device. Figure 8 This is a structural diagram of an electronic device 20 according to an exemplary embodiment. The content of the diagram should not be construed as limiting the scope of this application.

[0066] Figure 8 This is a schematic diagram of the structure of an electronic device 20 provided in an embodiment of this application. Specifically, the electronic device 20 may include: at least one processor 21, at least one memory 22, a display screen 23, an input / output interface 24, a communication interface 25, a power supply 26, and a communication bus 27. The memory 22 stores a computer program, which is loaded and executed by the processor 21 to implement the relevant steps in the satellite network accelerated convergence method disclosed in any of the foregoing embodiments. Alternatively, the electronic device 20 in this embodiment may specifically be an electronic computer.

[0067] In this embodiment, the power supply 26 is used to provide operating voltage for each hardware device on the electronic device 20; the communication interface 25 can create a data transmission channel between the electronic device 20 and external devices, and the communication protocol it follows can be any communication protocol applicable to the technical solution of this application, and is not specifically limited here; the input / output interface 24 is used to acquire external input data or output data to the outside world, and its specific interface type can be selected according to specific application needs, and is not specifically limited here.

[0068] Furthermore, the memory 22, as a carrier for resource storage, can be a read-only memory, random access memory, disk, or optical disk, etc. The resources stored thereon may include computer programs 221, and the storage method may be temporary storage or permanent storage. The computer programs 221 may include, in addition to computer programs capable of performing the satellite network accelerated convergence method executed by the electronic device 20 as disclosed in any of the foregoing embodiments, computer programs capable of performing other specific tasks.

[0069] Furthermore, embodiments of this application also disclose a computer-readable storage medium for storing a computer program; wherein, when the computer program is executed by a processor, it implements the aforementioned satellite network accelerated convergence method.

[0070] The specific steps of this method can be found in the corresponding content disclosed in the foregoing embodiments, and will not be repeated here.

[0071] The various embodiments in this application are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. For the same or similar parts between the various embodiments, refer to each other. As for the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple, and relevant parts can be referred to in the method section.

[0072] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0073] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0074] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0075] The above provides a detailed description of a satellite network accelerated convergence method, apparatus, device, and storage medium provided in this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for accelerating convergence in satellite networks, characterized in that, include: When the original optimal route from the source node to the target node does not exist, the local network range corresponding to the source node is determined from the satellite network; Based on the horizontal splitting method, a query message is sent to determine whether there are other routes from the source node to the target node within the local network range; If it exists, the current optimal route from the source node to the target node is determined to complete the convergence of the satellite network; If it does not exist, the routes to the target node in all nodes of the satellite network are deleted by sending request messages. During the deletion process, when it is determined that the source node in the satellite network can reach the target node, the routes to the target node in the satellite network are updated by sending update messages to complete the convergence of the satellite network. The step of deleting routes to the target node from all nodes in the satellite network based on sending request messages, and updating routes to the target node in the satellite network by sending update messages when it is determined during the deletion process that the source node in the satellite network can reach the target node, includes: The second current node sends a route deletion request message to the second neighbor node of the second current node; the initial second current node is the source node; If the second neighbor node is not the target node, then the route to the target node in the second neighbor node is deleted through the second neighbor node, and the second neighbor node is set as the second current node. Then, the process jumps to the step of sending a route deletion request message to the second neighbor node of the second current node through the second current node, until the route to the target node in all nodes in the satellite network is deleted. If the second neighbor node is the target node, it is determined that the source node in the satellite network can reach the target node, and the route to the target node is updated in the satellite network by sending an update message.

2. The satellite network accelerated convergence method according to claim 1, characterized in that, Determining the local network range corresponding to the source node from the satellite network includes: The local network range centered on the source node is determined from the satellite network.

3. The satellite network accelerated convergence method according to claim 1, characterized in that, The method of determining whether there are other routes from the source node to the target node within the local network range by sending query messages based on the horizontal segmentation approach includes: A routing query message is sent from the first current node to the first neighbor node that meets the sending conditions; the initial first current node is the source node. Based on the routing query message, the first neighbor node queries whether there is a route among the first neighbor nodes that reaches the target node without passing through the first current node; If it exists, the first neighbor node will send a target reachable message back to the source node based on the routing query message; If it does not exist, a new routing query message is generated based on the routing query message, and it is determined whether the first neighbor node is the boundary node of the local network range based on the new routing query message. If it is, the first neighbor node sends a target unreachable message to the source node through the first current node. If not, the first neighbor node is taken as the first current node, and the process jumps to the step of sending a routing query message to the first neighbor node corresponding to the first current node that meets the sending conditions through the first current node. The source node determines whether it has obtained the target reachable message. If the target reachable message has been obtained, then there are other routes from the source node to the target node within the local network scope. If the target reachable message has not been obtained, then there are no other routes.

4. The satellite network accelerated convergence method according to claim 3, characterized in that, The routing query message sent by the first current node to the first neighbor node records the metric value from the first current node to the boundary node; Accordingly, generating a new routing query message based on the routing query message includes: Subtract the unit metric value from the metric value recorded in the routing query message to generate a new routing query message; The routing query message sent by the source node records the maximum metric value corresponding to the local network range; Accordingly, if the metric value recorded in the new routing query message generated by the first neighbor node is not 0, the first neighbor node is not a boundary node of the local network range; if the metric value recorded in the new routing query message generated by the first neighbor node is 0, the first neighbor node is a boundary node of the local network range.

5. The satellite network accelerated convergence method according to claim 3, characterized in that, The step of sending a target reachable message back to the source node through the first neighbor node based on the routing query message includes: The first current node is determined by the first neighbor node based on the routing query message, and a reference reachability message recording the metric value from the first neighbor node to the target node is fed back to the first current node; The first current node generates a new reference reachable message based on the reference reachable message, which records the metric value from the first current node to the target node; The first current node is designated as the first neighbor node, and the previous first current node is determined based on the routing query message of the first neighbor node. The process then proceeds to the step of feeding back a reference reachable message that records the metric value from the first neighbor node to the target node to the first current node, until a target reachable message is fed back to the source node; the target reachable message records the metric value from the source node to the target node. Accordingly, determining the current optimal route from the source node to the target node includes: The route corresponding to the target reachable message with the smallest metric value among all the target reachable messages is taken as the current optimal route from the source node to the target node.

6. The satellite network accelerated convergence method according to claim 5, characterized in that, The method of updating the route to the target node in the satellite network by sending update messages includes: The third current node sends a route update message to its third neighbor node, recording the metric values ​​between the third current node and the target node; the initial third current node is the target node. The third neighbor node adds a route to the target node based on the route update message, and updates the metric value from the third neighbor node to the target node to obtain a new route update message; The third neighbor node is designated as the third current node, and the process jumps to the step of sending a route update message recording the metric value between the third current node and the target node to the third neighbor node of the third current node through the third current node, until the update of all routes to the target node is completed in the satellite network.

7. A satellite network accelerated convergence device, characterized in that, include: The range determination module is used to determine the local network range corresponding to the source node from the satellite network when the original optimal route from the source node to the target node does not exist. The judgment module is used to determine, based on the horizontal splitting method, whether there are other routes to the target node within the local network range by sending query messages; The optimal path determination module is used to determine the current optimal route from the source node to the target node if it exists, so as to complete the convergence of the satellite network. The deletion or update module is used to delete the routes to the target node from all nodes of the satellite network by sending a request message if the route does not exist, and to update the route to the target node in the satellite network by sending an update message when it is determined that the source node in the satellite network can reach the target node during the deletion process, so as to complete the convergence of the satellite network. The deletion or update module is specifically used to send a route deletion request message to the second neighbor node of the second current node through the second current node; the initial second current node is the source node; If the second neighbor node is not the target node, then the route to the target node in the second neighbor node is deleted through the second neighbor node, and the second neighbor node is set as the second current node. Then, the process jumps to the step of sending a route deletion request message to the second neighbor node of the second current node through the second current node, until the route to the target node in all nodes in the satellite network is deleted. If the second neighbor node is the target node, it is determined that the source node in the satellite network can reach the target node, and the route to the target node is updated in the satellite network by sending an update message.

8. An electronic device, characterized in that, include: Memory, used to store computer programs; A processor for executing the computer program to implement the satellite network accelerated convergence method as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, Used to store computer programs; wherein, when the computer programs are executed by a processor, they implement the satellite network accelerated convergence method as described in any one of claims 1 to 6.

Citation Information

Patent Citations

  • Wireless sensor network topology self-healing algorithm based on node neighbor relationships

    CN104010342A

  • Method and system for discovering survivability route of wireless ad hoc network

    CN114760671A