A method, system, terminal, and storage medium for local route update in low-Earth orbit satellite networks under time-delay constraints.
By generating current and future snapshots, calculating the minimum latency baseline path and identifying high-risk links, and partially replacing high-risk links, the link congestion problem caused by a single latency selection in low-Earth orbit satellite networks is solved, and the controllability and stability of route updates are achieved.
Patent Information
- Application Number
- CN202611361540.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-09-03
- Publication Date
- 2026-11-10
AI Technical Summary
In existing low-Earth orbit satellite networks, only propagation delay is considered when selecting routing paths. This leads to multiple selections of links with low latency for multiple concurrent services, resulting in link congestion and an inability to maintain normal operation.
By acquiring the orbital parameters of low-Earth orbit satellites, current and future snapshots are generated, the minimum latency reference path is calculated, and combined with the link contention level and future continuous availability time, continuous high-risk links are identified, a complete candidate path is generated, and only high-risk links are partially replaced to ensure that the latency difference is within a preset range.
This improves the controllability and stability of route updates, avoids link congestion, and ensures the normal operation of the low-Earth orbit satellite network.
Smart Images

Figure CN123074972A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data processing technology, and in particular to a method, system, terminal, and computer-readable storage medium for local routing updates in low-Earth orbit satellite networks under time-delay constraints. Background Technology
[0002] Low Earth Orbit (LEO) satellite networks consist of large-scale satellite constellations, inter-satellite links, and satellite-to-ground links. The continuous motion of satellites causes the topology, satellite-to-ground connections, and end-to-end paths to change over time. Routing selection needs to consider propagation delay, link load, and path continuity simultaneously. Since LEO satellites operate according to predetermined orbital periods, network changes are not entirely random, and appropriate routing paths need to be selected to ensure the normal operation of LEO satellites.
[0003] However, in existing technologies, the selection of routing paths generally only considers propagation delay. Therefore, when multiple services run in parallel, links with low latency will be selected multiple times, resulting in link congestion and preventing low-Earth orbit satellites from maintaining normal operation.
[0004] Therefore, existing technologies still need to be improved and developed. Summary of the Invention
[0005] The main objective of this invention is to provide a method, system, terminal, and computer-readable storage medium for local routing updates in low-Earth orbit satellite networks under latency constraints. This invention aims to address the problem that in the prior art, the selection of routing paths generally only considers propagation latency. Therefore, when multiple services run in parallel, links with low latency are selected multiple times, leading to link congestion and preventing low-Earth orbit satellites from maintaining normal operation.
[0006] To achieve the above objectives, the present invention provides a method for local route update of low-Earth orbit satellite networks under time-delay constraints, the method comprising the following steps: Obtain the orbital parameters of the low-Earth orbit satellite, and generate current and future snapshots based on the orbital parameters; The minimum latency baseline path is calculated based on the current snapshot, and the link contention level and future continuous availability time are calculated based on the minimum latency baseline path and the future snapshot; Calculate consecutive high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the consecutive high-risk links; Calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets a preset difference, then determine the optimal candidate path based on the complete candidate path.
[0007] Optionally, the method for local routing update of low-Earth orbit satellite networks under time-delay constraints, wherein obtaining the orbital parameters of the low-Earth orbit satellites and generating current and future snapshots based on the orbital parameters specifically includes: In STK, set the orbital parameters of the low-Earth orbit satellites, including orbital altitude, orbital inclination, number of orbital planes, number of satellites per orbital plane, simulation start and end time, sampling interval, and ground station location. The position of the low-Earth orbit satellite at each sampling time is calculated based on the orbital parameters. Visibility analysis is performed on the orbital parameters to obtain the communication times of the inter-satellite link and the satellite-to-ground link. The satellite number, position coordinates, two endpoints of the communicable link, and link distance of the low-Earth orbit satellite are generated. Based on the position of the low-orbit satellite at each sampling time, the communication time of the inter-satellite link and the satellite-to-ground link, the satellite number, position coordinates, the two endpoints of the communicable link, and the link distance of the low-orbit satellite, the link propagation delay and link capacity are calculated, and the current snapshot and future snapshot are generated according to the link propagation delay and link capacity corresponding to different times.
[0008] Optionally, in the aforementioned method for local routing updates in low-Earth orbit satellite networks under time-delay constraints, the step of calculating the minimum time-delay reference path based on the current snapshot specifically includes: Determine the available links corresponding to the current snapshot, and obtain the source node and destination node of the available links; Calculate the propagation delay between the source node and the destination node, retain the target node corresponding to the minimum propagation delay, and generate a minimum delay baseline path based on the target node.
[0009] Optionally, the local route update method for low-Earth orbit satellite networks under time-delay constraints, wherein calculating the link contention level and future continuous availability time based on the minimum time-delay reference path and the future snapshot specifically includes: Obtain the target service rate, other service rates, and link capacity on the minimum latency reference path, and calculate the initial link contention level based on the target service rate, the other service rates, and the link capacity; The initial link contention level is normalized to obtain the link contention level. The continuous available length of the minimum latency reference path is calculated based on the future snapshot, and the continuous available length is subjected to instability switching processing to obtain the future continuous available time.
[0010] Optionally, the local route update method for low-Earth orbit satellite networks under time-delay constraints, wherein calculating consecutive high-risk links based on the link contention level and the future continuous availability time specifically includes: The link risk is obtained by weighting the link contention level and the future continuous availability time. If the link risk reaches the risk threshold, then the link in the minimum latency reference path that reaches the risk threshold is marked as a high-risk link; If multiple high-risk links are connected and there are no low-risk links, then the multiple high-risk links are merged to obtain a continuous high-risk link.
[0011] Optionally, in the aforementioned method for local routing updates in low-Earth orbit satellite networks under time-delay constraints, generating complete candidate paths for the continuous high-risk links specifically includes: Select a stable node before and after the continuous high-risk link as a replacement node, and find a sub-path between the replacement nodes that does not form a loop; Connect the first half of the continuous high-risk link, the sub-path, and the second half of the continuous high-risk link to obtain a complete candidate path.
[0012] Optionally, the local route update method for low-Earth orbit satellite networks under time delay constraints, wherein calculating the time delay difference between the complete candidate path and the minimum time delay reference path, and determining the optimal candidate path based on the complete candidate path if the time delay difference meets a preset difference, specifically includes: The complete candidate path is subjected to connectivity and acyclicity checks. If the checks pass, the total propagation delay of the complete candidate path is calculated. Calculate the delay difference between the total propagation delay of the complete candidate path and the total propagation delay of the minimum delay reference path; The delay difference is compared with a preset difference. If the delay difference is less than or equal to the preset difference, the complete candidate path is retained to obtain multiple qualified candidate paths. If the delay difference is greater than the preset difference, the complete candidate path will be eliminated. The time delay difference is evaluated using a candidate evaluation function to obtain the target evaluation value. The optimal candidate path is obtained by selecting the path with the smallest target evaluation value among multiple qualified candidate paths.
[0013] Furthermore, to achieve the above objectives, the present invention also provides a local routing update system for low-Earth orbit satellite networks under time-delay constraints, wherein the local routing update system for low-Earth orbit satellite networks under time-delay constraints includes: The snapshot generation module is used to acquire the orbital parameters of low-Earth orbit satellites and generate current and future snapshots based on the orbital parameters. The minimum latency calculation module is used to calculate the minimum latency reference path based on the current snapshot, and to calculate the link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot; A high-risk link calculation module is used to calculate consecutive high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the consecutive high-risk links; The optimal candidate path determination module is used to calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets a preset difference, the optimal candidate path is determined based on the complete candidate path.
[0014] Furthermore, to achieve the above objectives, the present invention also provides a terminal, wherein the terminal includes: a memory, a processor, and a latency-constrained local routing update program for low-Earth orbit satellite networks stored in the memory and executable on the processor, wherein when the latency-constrained local routing update program for low-Earth orbit satellite networks is executed by the processor, it implements the steps of the latency-constrained local routing update method for low-Earth orbit satellite networks as described above.
[0015] Furthermore, to achieve the above objectives, the present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a local routing update program for a low-Earth orbit satellite network under time constraints, and when the local routing update program for a low-Earth orbit satellite network under time constraints is executed by a processor, it implements the steps of the local routing update method for a low-Earth orbit satellite network under time constraints as described above.
[0016] In this invention, the orbital parameters of low-Earth orbit satellites are acquired, and current and future snapshots are generated based on these parameters. A minimum latency reference path is calculated based on the current snapshot, and the link contention level and future continuous availability time are calculated based on the minimum latency reference path and the future snapshot. Consecutive high-risk links are calculated based on the link contention level and the future continuous availability time, and complete candidate paths for these consecutive high-risk links are generated. The latency difference between the complete candidate paths and the minimum latency reference path is calculated. If the latency difference meets a preset value, the optimal candidate path is determined based on the complete candidate paths. This invention uses the minimum latency reference path as a basis to evaluate the link contention level and future continuous availability time after candidate path changes, thereby replacing only high-risk links in the minimum latency reference path, effectively improving the controllability and stability of route updates. Attached Figure Description
[0017] Figure 1This is a flowchart of a preferred embodiment of the local routing update method for low-Earth orbit satellite networks under time-delay constraints of the present invention; Figure 2 This is a schematic diagram of the overall process of a preferred embodiment of the local routing update method for low-Earth orbit satellite networks under time delay constraints of the present invention. Figure 3 This is a schematic diagram of the STK and MATLAB topology snapshot generation process of a preferred embodiment of the local routing update method for low-Earth orbit satellite networks under time delay constraints of the present invention. Figure 4 This is a schematic diagram of high-risk road segments and local alternative paths in a preferred embodiment of the local route update method for low-Earth orbit satellite networks under time delay constraints of the present invention. Figure 5 This is a structural diagram of a preferred embodiment of the local routing update system for low-Earth orbit satellite networks under time-delay constraints of the present invention; Figure 6 This is a structural diagram of a preferred embodiment of the terminal of the present invention. Detailed Implementation
[0018] To make the objectives, technical solutions, and advantages of this invention clearer and more explicit, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
[0019] Low Earth Orbit (LEO) satellite networks consist of large-scale satellite constellations, inter-satellite links, and satellite-to-ground links. The continuous movement of satellites causes the topology, satellite-to-ground connections, and end-to-end paths to change over time, requiring route selection to simultaneously consider propagation delay, link load, and path continuity.
[0020] Low-Earth orbit satellites operate according to a predetermined orbital period, so network changes are not entirely random. With constellation parameters unchanged, the relative positions between satellites typically repeat with the orbital period; the satellite-to-Earth visibility relationship approximately repeats according to the constellation's repetition period relative to Earth. Utilizing this characteristic, network connectivity at consecutive points in time can be calculated in advance, allowing routing decisions to check current links and their availability for a future period.
[0021] Existing shortest path routing primarily uses propagation delay as the main weight, which can easily lead to different services concentrating on the same low-latency link when multiple services are running concurrently. Existing technologies mainly perform full-path or multi-path optimization, and have not formed the complete process described in this invention, which is based on the minimum delay baseline path, combines the future link continuity maintenance capability and candidate path competition risk, performs limited replacement only for high-risk local segments, and uses hysteresis threshold control for updates.
[0022] Existing technologies have at least the following shortcomings: First, the single shortest path method is difficult to avoid local convergence of services on low-latency links; second, full-path multi-constraint search has high computational and control overhead when snapshots are frequently updated; third, it selects routes based only on the current link state and does not make full use of the computability of future topology snapshots, so the selected links may fail in a short period of time; fourth, some dynamic routing methods lack hysteresis mechanisms and are prone to frequently issuing new paths due to slight fluctuations in state.
[0023] To address the aforementioned issues, this invention discloses a local route update method for low-Earth orbit satellite networks under time-delay constraints. This invention uses the minimum time-delay path as a benchmark, evaluates the link contention occupancy and future continuous availability time after candidate path changes, replaces only high-risk local road segments, and ensures the controllability and stability of route updates through hard time-delay constraints, path change penalties, and update thresholds.
[0024] The local route update method for low-Earth orbit satellite networks under time-delay constraints described in the preferred embodiment of the present invention, such as... Figure 1 and Figure 2 As shown, the local routing update method for low-Earth orbit satellite networks under time delay constraints includes the following steps: Step S10: Obtain the orbital parameters of the low-orbit satellite, and generate the current snapshot and future snapshot based on the orbital parameters.
[0025] The system of this invention includes a topology snapshot generation module, a baseline path calculation module, a link risk calculation module, a local alternative path generation module, a delay filtering module, and a route update module. Each module is configured according to... Figure 2 Work in the order shown.
[0026] like Figure 2 As shown, the overall processing flow of this invention is as follows: first, obtain the current and future network connection status; then, find the high-risk road segment in the path with the least latency; only find alternative paths for the local road segment; and finally, decide whether to update based on latency and risk.
[0027] The specific processing order is as follows: 1. Generate current and future topology snapshots using STK and MATLAB. 2. Calculate the minimum latency baseline path in the current snapshot. 3. Calculate the contention occupancy and future continuous availability time of each link on the baseline path. 4. Identify continuous high-risk road segments and generate local alternative paths. 5. Delete candidate paths that do not meet connectivity or latency requirements. 6. Compare the evaluation values of the new and old paths; if the update conditions are met, issue the new path; otherwise, maintain the original path.
[0028] Understandably, the specific process for generating network model and topology snapshots is as follows: like Figure 3As shown in 'a', the network model consists of ground stations, LEO satellite nodes, satellite-to-ground links, and inter-satellite links. Figure 3 As shown in b, the topology data used in this invention is obtained jointly by STK and MATLAB. STK is responsible for establishing the satellite constellation and simulating satellite motion, while MATLAB is responsible for reading the data exported by STK and forming the topology snapshot required by the routing algorithm.
[0029] Specifically, the orbital parameters of the low-Earth orbit (LEO) satellite are set in STK, including orbital altitude, orbital inclination, number of orbital planes, number of satellites per orbital plane, simulation start and end times, sampling interval, and ground station location. Based on these orbital parameters, the position of the LEO satellite at each sampling time is calculated. Visibility analysis is performed on the orbital parameters to obtain the communication times for inter-satellite links and satellite-to-ground links. The satellite ID, position coordinates, two endpoints of the communicable link, and link distance of the LEO satellite are generated. Based on the position of the LEO satellite at each sampling time, the communication times for the inter-satellite and satellite-to-ground links, the satellite ID, position coordinates, two endpoints of the communicable link, and link distance of the LEO satellite, the link propagation delay and link capacity are calculated. Current snapshots and future snapshots are generated based on the link propagation delay and link capacity corresponding to different times.
[0030] Specifically, the following steps are first performed in STK: setting the orbital altitude, orbital inclination, number of orbital planes, number of satellites per orbital plane, simulation start and end times, sampling interval, and ground station location. STK then calculates the position of each satellite at each sampling time based on these parameters and uses visibility analysis to determine which inter-satellite links and satellite-to-ground links are available for communication at that moment. Subsequently, data such as satellite number, position coordinates, the two endpoints of the communicable links, and link distances are exported.
[0031] MATLAB reads the above data line by line according to the sampling time. At a certain moment, the satellite and ground station are treated as network nodes, and the inter-satellite links and satellite-to-ground links that can communicate at that moment are treated as network edges; the link propagation delay is obtained by dividing the link distance by the electromagnetic wave propagation speed, and the link capacity can be the link bandwidth set in the simulation. This forms a topology snapshot G(t) at that moment. By processing the times t+Δt, t+2Δt, etc. in the same way, a set of current and future topology snapshots can be obtained.
[0032] In this context, a topology snapshot is not a network image, but rather a node table and a link table at a specific sampling point. The node table records node numbers and locations, while the link table records the nodes at both ends of a link, their availability, link distance, propagation delay, and capacity. The current snapshot is used to calculate the minimum delay path at that moment, while future snapshots are used to determine whether a link can be used continuously in the next few time intervals.
[0033] Because low-Earth orbit constellations are periodic, a topology snapshot for a repeating period can be pre-generated and saved chronologically. When running the routing algorithm, the corresponding snapshot is read based on the current moment, and then the current service load and temporary link failures are overlaid. This utilizes the predictability of satellite motion while retaining the ability to process real-time network conditions.
[0034] Step S20: Calculate the minimum latency reference path based on the current snapshot, and calculate the link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot.
[0035] Specifically, the available links corresponding to the current snapshot are determined, and the source node and destination node of the available links are obtained; the propagation delay between the source node and the destination node is calculated, the target node corresponding to the minimum propagation delay is retained, and a minimum delay reference path is generated based on the target node.
[0036] The calculation process for the minimum delay reference path is as follows: For a target service from a source node to a destination node, the system only searches for a path on the available links in the current topology snapshot G(t). The formula for calculating the baseline path with the minimum total propagation delay is: ; in, D ( P , t ) represents a path P The sum of propagation delays across all links in the process. P 0( t () represents the baseline path with the minimum total propagation delay. express t At any given time, the set of all feasible paths between the source node and the destination node. t Indicates time, e Indicates a link. Indicates link e The propagation delay.
[0037] The path (i.e. the minimum latency baseline path) can be obtained using Dijkstra's algorithm: starting from the source node, the propagation delay of each link is gradually accumulated, and the node with the minimum accumulated delay is retained each time, until the destination node is reached, and then the entire path is restored according to the previous node recorded.
[0038] Obtain the target service rate, other service rates, and link capacity on the minimum latency reference path, and calculate the initial link contention level based on the target service rate, other service rates, and link capacity; normalize the initial link contention level to obtain the link contention level.
[0039] The specific process for calculating the link contention occupancy level under the candidate path is as follows: Path in the formula P It is a specific candidate path being compared in this round, such as the baseline path or a local alternative path, not all possible paths in the network.
[0040] The calculation of link contention occupancy can be understood as follows: first, assume that the target service is moved from the original path, and then place the service on the path currently being evaluated. P Up. For the path P For each link in the calculation, the sum of the rates of other services on that link and the rate of the target service is divided by the link capacity; for links that do not pass through the target service, only the rates of other services are calculated, as shown in the following formula: ; in, Indicates the initial level of link contention. Indicates business f At any moment t Whether it passes through the link e , express t The set of all service flows in the time-to-time network. Indicates the current business. Indicates the service rate. Indicates the current service rate. Indicates link capacity; indicator function on the link e Belongs to path P If the value is 1, then 0 is used; otherwise, 1 is used. To avoid excessive memory usage affecting the comparison, normalization is performed according to a set upper limit, expressed as: ; in, Indicates the level of contention on the link. This indicates that an upper limit has been set.
[0041] The continuous available length of the minimum latency reference path is calculated based on the future snapshot, and the continuous available length is subjected to instability switching processing to obtain the future continuous available time.
[0042] For future link continuity availability The calculation process is as follows: Let's say a total of [number] views H A future snapshot, Indicates link e In the k A future snapshot is available, and 0 indicates that it is not available. m This is the number of consecutively available snapshots starting from the first future snapshot. For example, when the future state is [1,1,0,1]...m The value equals 2 because the link was continuously available in the first two snapshots, but was interrupted in the third snapshot. The length of continuous availability is calculated using the following formula: ; Then convert the continuous available length into switching instability. (That is, the future continuous availability time in this invention), the expression is: ; in, The larger the value, the earlier the link is interrupted, and the greater the likelihood of the route switching again.
[0043] Step S30: Calculate the continuous high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the continuous high-risk links.
[0044] Specifically, the link contention level and the future continuous availability time are weighted to obtain the link risk; if the link risk reaches the risk threshold, the links in the minimum latency reference path that reach the risk threshold are marked as high-risk links; if multiple high-risk links are connected and there are no low-risk links, the multiple high-risk links are merged to obtain continuous high-risk links.
[0045] The calculation process for link risk and high-risk road segment location is as follows: Link risk The path risk is obtained by weighting the normalized contention occupancy (i.e., the link contention level in this invention) and the switching instability (i.e., the future continuous availability time in this invention), and the path risk is the maximum value of the link risk on that path. The expression is: ; ; in, This indicates the parameter adjustment knob.
[0046] The merging of high-risk road segments is straightforward: each link on the baseline path is checked sequentially from the source node to the destination node, and links with risks reaching the threshold are marked as high-risk. If two or more high-risk links are consecutive without any low-risk links in between, they are merged into a single continuous road segment. Subsequent steps only replace this continuous road segment.
[0047] Select a stable node before and after the continuous high-risk link as a replacement node, and find a sub-path that does not form a loop between the replacement nodes; connect the first half of the continuous high-risk link, the sub-path, and the second half of the continuous high-risk link to obtain a complete candidate path.
[0048] Furthermore, the specific process for generating local replacement endpoints and candidate subpaths is as follows: For each high-risk continuous road segment, select a stable node before and after it as a replacement endpoint. i and j These are the positions of the two endpoints in the baseline path. n It is the position number of the last node on the baseline path.
[0049] like Figure 4 As shown, during the calculation, high-risk links that need to be replaced are first excluded (i.e., Figure 4 (BC in the original text), then find a sub-path between the two endpoints that does not form a loop. Then take the first half of the original path. The sub-path and the latter half of the original path Connect them to form a complete candidate path P c (Right now Figure 4 (BEC in the middle, other sections remain unchanged): .
[0050] Step S40: Calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets the preset difference, then determine the optimal candidate path based on the complete candidate path.
[0051] Specifically, connectivity and acyclicity checks are performed on the complete candidate path. If the checks pass, the total propagation delay of the complete candidate path is calculated. The delay difference between the total propagation delay of the complete candidate path and the total propagation delay of the minimum delay reference path is calculated. The delay difference is compared with a preset difference. If the delay difference is less than or equal to the preset difference, the complete candidate path is retained, resulting in multiple qualified candidate paths. If the delay difference is greater than the preset difference, the complete candidate path is eliminated.
[0052] The process for selecting based on hard latency constraints is as follows: It is the total propagation delay of the candidate complete path. It is the total propagation delay of the reference path. This is the maximum allowed increase in latency. Candidate paths must meet the following conditions: ; Understandably, the system first checks the connectivity and acyclicity of candidate paths, then calculates their total propagation delay; exceeding... Candidate paths are directly eliminated. Maximum hop count or relative latency ratio constraints can also be set simultaneously.
[0053] The time delay difference is evaluated using a candidate evaluation function to obtain a target evaluation value; the path with the smallest target evaluation value among multiple qualified candidate paths is selected to obtain the optimal candidate path.
[0054] The process for candidate evaluation and hysteresis update determination is as follows: Evaluation value The smaller the value, the more suitable the path. In the formula... Used to adjust the impact of time delay factors To avoid frequent path changes when there is no obvious benefit: add an option when the candidate path differs from the current path. When two paths are identical, this term is 0, and the expression for the candidate evaluation function is: ; in, express t The path corresponding to the given time.
[0055] The path with the smallest evaluation value among all qualified candidate paths is expressed as: ; J ( P prev ( t ), t ) is the evaluation value of the current path. J ( P ( t ), t ) is the evaluation value of the optimal candidate path, and the difference between the two indicates how much improvement can be brought about by changing the route. This indicates the minimum improvement amount allowed to trigger an update. Only when the improvement amount reaches this level... The new path was only issued at that time: ; If the current path has failed or will fail before the next snapshot, the improvement threshold is bypassed and a feasible path that meets the constraints is selected immediately; if there is no feasible path in the local candidate set, the entire path is recalculated.
[0056] Furthermore, the process for handling boundary cases is as follows: 1. Unavailable links are not included in path calculation. 2. When a current path is about to fail, it can be switched to a qualified path directly without waiting for the improvement amount to reach the threshold. 3. If there is no qualified local alternative path, the full path calculation is re-executed.
[0057] An example of parametric calculation is as follows: Assuming the baseline path is SABCD, with each link having a propagation delay of 4 ms, the baseline path delay is 16 ms. The high-risk link is BC, and the candidate local sub-path is BEC, where BE and EC each have a propagation delay of 6 ms. The total delay of the concatenated candidate path is 24 ms. When the allowed delay increment is 10 ms, the candidate path increases by 8 ms, satisfying the delay constraint.
[0058] Assume each link has an effective capacity of 100 Mbit / s, and the target service demand rate is 20 Mbit / s. In addition to the target service, there is already 80 Mbit / s of service on the BC, and 20 Mbit / s of service each on the BE and EC. When evaluating the two paths separately, the BC occupancy rate in the baseline path is 1.00, while the BE and EC occupancy rates in the candidate paths are both 0.40.
[0059] Suppose the observation window contains 5 future snapshots. The future available sequence for BC is [1,1,0,0,0], then the continuous available length is 2 and the instability is 0.60; the future available sequences for BE and EC are both [1,1,1,1,1], then the continuous available length is 5 and the instability is 0. This example is only for illustrating the calculation process and is not intended as a simulation or performance verification result.
[0060] The key points and protected aspects of this invention include: generating current and future topology snapshots from ephemeris and link visibility relationships; using the minimum latency path as a local update benchmark; calculating link contention occupancy based on the service distribution after the candidate path changes; calculating link continuity maintenance time and handover instability from future topology snapshots; combining contention risk and handover stability to form link risk and locating high-risk continuous road segments; generating acyclic local alternative paths between stable endpoints; using hard latency constraints to filter candidate paths; performing hysteresis updates through path change penalties, improvement thresholds, and failure handover rules; and a system module combination to implement the above processes.
[0061] Compared with existing full-path multi-constraint routing technologies, the present invention has the following advantages: 1. Using the path with the minimum delay as a benchmark and limiting the delay increment of candidate paths, the propagation delay deviation is kept under control; 2. Replace only high-risk local road sections to narrow down the candidate search range; 3. Recalculate the contention level of the target service after migration based on the candidate paths to avoid evaluating new paths solely based on the current routing status; 4. Using future continuous availability time to characterize link switching stability can reduce the need for rerouting again in the short term; 5. It suppresses frequent updates caused by slight fluctuations in state by using a hysteresis threshold, and supports fast switching when the current path is about to fail.
[0062] Alternatives to the present invention include: 1. Link contention occupancy can be replaced or supplemented by queue occupancy rate, link utilization rate, service priority, packet loss rate, or congestion labeling ratio; 2. Link stability can be represented by the proportion of future available snapshots, remaining visible time, first failure time, number of future handovers, or probability of interruption; 3. Path risk can be assessed using maximum value, average value, weighted cumulative value, or segmented risk. 4. Local candidate paths can be generated by K-shortest path search, restricted Dijkstra's search, exclusion of high-risk links, or pre-calculated alternative road segments; 5. Delay constraints can be implemented using absolute increments or relative proportions; hysteresis parameters can be adaptively adjusted according to service type and control plane load.
[0063] Furthermore, such as Figure 5 As shown, based on the above-mentioned method for local routing updates in low-Earth orbit (LEO) satellite networks under time-delay constraints, this invention also provides a system for local routing updates in LEO satellite networks under time-delay constraints, wherein the system includes: The snapshot generation module 51 is used to acquire the orbital parameters of the low-Earth orbit satellite and generate current snapshots and future snapshots based on the orbital parameters. The minimum latency calculation module 52 is used to calculate the minimum latency reference path based on the current snapshot, and to calculate the link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot; The high-risk link calculation module 53 is used to calculate consecutive high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the consecutive high-risk links; The optimal candidate path determination module 54 is used to calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets the preset difference, the optimal candidate path is determined based on the complete candidate path.
[0064] Furthermore, such as Figure 6 As shown, based on the above-mentioned method and system for local routing updates of low-Earth orbit satellite networks under time delay constraints, the present invention also provides a terminal, which includes a processor 10, a memory 20 and a display 30. Figure 6 Only some of the terminal components are shown; however, it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.
[0065] In some embodiments, the memory 20 may be an internal storage unit of the terminal, such as a hard disk or memory. In other embodiments, the memory 20 may be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital card (SD), flash card, etc. Further, the memory 20 may include both internal and external storage devices. The memory 20 is used to store application software and various types of data installed on the terminal, such as the program code installed on the terminal. The memory 20 can also be used to temporarily store data that has been output or will be output. In one embodiment, the memory 20 stores a low-Earth orbit (LEO) satellite network local routing update program 40 under time constraints, which can be executed by the processor 10 to implement the LEO satellite network local routing update method under time constraints in this application.
[0066] In some embodiments, the processor 10 may be a central processing unit (CPU), a microprocessor, or other data processing chip, used to run program code stored in the memory 20 or process data, such as executing the local routing update method for low-Earth orbit satellite networks under time constraints.
[0067] In some embodiments, the display 30 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, or an OLED (Organic Light-Emitting Diode) touchscreen. The display 30 is used to display information on the terminal and to display a visual user interface.
[0068] In one embodiment, when the processor 10 executes the delay-constrained local routing update program 40 for the low-Earth orbit satellite network in the memory 20, it implements the steps of the delay-constrained local routing update method for the low-Earth orbit satellite network as described above.
[0069] The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a local routing update program for a low-Earth orbit satellite network under time constraints, and the local routing update program for a low-Earth orbit satellite network under time constraints, when executed by a processor, implements the steps of the local routing update method for a low-Earth orbit satellite network under time constraints as described above.
[0070] In summary, this invention provides a method, system, terminal, and storage medium for local route updates in low-Earth orbit (LEO) satellite networks under latency constraints. The method includes: acquiring the orbital parameters of the LEO satellite and generating a current snapshot and a future snapshot based on the orbital parameters; calculating a minimum latency reference path based on the current snapshot, and calculating link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot; calculating consecutive high-risk links based on the link contention level and the future continuous availability time, and generating complete candidate paths for the consecutive high-risk links; calculating the latency difference between the complete candidate paths and the minimum latency reference path; and determining the optimal candidate path based on the complete candidate paths if the latency difference meets a preset difference. This invention uses the minimum latency reference path as a basis to evaluate the link contention level and future continuous availability time after the candidate path is changed, thereby replacing only high-risk links in the minimum latency reference path, effectively improving the controllability and stability of route updates.
[0071] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal 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 terminal. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal that includes that element.
[0072] Of course, those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware (such as a processor, controller, etc.). The program can be stored in a computer-readable storage medium, and when executed, it can include the processes described in the above method embodiments. The computer-readable storage medium can be a memory, magnetic disk, optical disk, etc.
[0073] It should be understood that the application of the present invention is not limited to the examples above. Those skilled in the art can make improvements or modifications based on the above description, and all such improvements and modifications should fall within the protection scope of the appended claims.
Claims
1. A method for local route update in low-Earth orbit satellite networks under time-delay constraints, characterized in that, The local routing update method for low-Earth orbit satellite networks under time delay constraints includes: Obtain the orbital parameters of the low-Earth orbit satellite, and generate current and future snapshots based on the orbital parameters; The minimum latency baseline path is calculated based on the current snapshot, and the link contention level and future continuous availability time are calculated based on the minimum latency baseline path and the future snapshot; Calculate consecutive high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the consecutive high-risk links; Calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets a preset difference, then determine the optimal candidate path based on the complete candidate path.
2. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The process of acquiring the orbital parameters of low-Earth orbit satellites and generating current and future snapshots based on these parameters specifically includes: In STK, set the orbital parameters of the low-Earth orbit satellites, including orbital altitude, orbital inclination, number of orbital planes, number of satellites per orbital plane, simulation start and end time, sampling interval, and ground station location. The position of the low-Earth orbit satellite at each sampling time is calculated based on the orbit parameters. Visibility analysis is performed on the orbit parameters to obtain the communication times of the inter-satellite link and the satellite-to-ground link. The satellite number, position coordinates, two endpoints of the communicable link, and link distance of the low-Earth orbit satellite are generated. Based on the position of the low-orbit satellite at each sampling time, the communication time of the inter-satellite link and the satellite-to-ground link, the satellite number, position coordinates, the two endpoints of the communicable link, and the link distance of the low-orbit satellite, the link propagation delay and link capacity are calculated, and the current snapshot and future snapshot are generated according to the link propagation delay and link capacity corresponding to different times.
3. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The step of calculating the minimum latency baseline path based on the current snapshot specifically includes: Determine the available links corresponding to the current snapshot, and obtain the source node and destination node of the available links; Calculate the propagation delay between the source node and the destination node, retain the target node corresponding to the minimum propagation delay, and generate a minimum delay baseline path based on the target node.
4. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The step of calculating the link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot specifically includes: Obtain the target service rate, other service rates, and link capacity on the minimum latency reference path, and calculate the initial link contention level based on the target service rate, the other service rates, and the link capacity; The initial link contention level is normalized to obtain the link contention level. The continuous available length of the minimum latency reference path is calculated based on the future snapshot, and the continuous available length is subjected to instability switching processing to obtain the future continuous available time.
5. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The calculation of consecutive high-risk links based on the link contention level and the future continuous availability time specifically includes: The link risk is obtained by weighting the link contention level and the future continuous availability time. If the link risk reaches the risk threshold, then the link in the minimum latency reference path that reaches the risk threshold is marked as a high-risk link; If multiple high-risk links are connected and there are no low-risk links, then the multiple high-risk links are merged to obtain continuous high-risk links.
6. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The generation of complete candidate paths for the continuous high-risk links specifically includes: Select a stable node before and after the continuous high-risk link as a replacement node, and find a sub-path between the replacement nodes that does not form a loop; Connect the first half of the continuous high-risk link, the sub-path, and the second half of the continuous high-risk link to obtain a complete candidate path.
7. The method for local route update of low-Earth orbit satellite networks under time-delay constraints according to claim 1, characterized in that, The step of calculating the delay difference between the complete candidate path and the minimum delay reference path, and determining the optimal candidate path based on the complete candidate path if the delay difference meets a preset value, specifically includes: The complete candidate path is subjected to connectivity and acyclicity checks. If the checks pass, the total propagation delay of the complete candidate path is calculated. Calculate the delay difference between the total propagation delay of the complete candidate path and the total propagation delay of the minimum delay reference path; The delay difference is compared with a preset difference. If the delay difference is less than or equal to the preset difference, the complete candidate path is retained to obtain multiple qualified candidate paths. If the delay difference is greater than the preset difference, the complete candidate path will be eliminated. The time delay difference is evaluated using a candidate evaluation function to obtain the target evaluation value. The optimal candidate path is obtained by selecting the path with the smallest target evaluation value among multiple qualified candidate paths.
8. A local routing update system for low-Earth orbit satellite networks under time-delay constraints, characterized in that, The low-Earth orbit satellite network local routing update system under time delay constraints includes: The snapshot generation module is used to acquire the orbital parameters of low-Earth orbit satellites and generate current and future snapshots based on the orbital parameters. The minimum latency calculation module is used to calculate the minimum latency reference path based on the current snapshot, and to calculate the link contention level and future continuous availability time based on the minimum latency reference path and the future snapshot; A high-risk link calculation module is used to calculate consecutive high-risk links based on the link contention level and the future continuous availability time, and generate complete candidate paths for the consecutive high-risk links; The optimal candidate path determination module is used to calculate the delay difference between the complete candidate path and the minimum delay reference path. If the delay difference meets a preset difference, the optimal candidate path is determined based on the complete candidate path.
9. A terminal, characterized in that, The terminal includes: a memory, a processor, and a latency-constrained local routing update program for low-Earth orbit satellite networks stored in the memory and executable on the processor. When the latency-constrained local routing update program for low-Earth orbit satellite networks is executed by the processor, it implements the steps of the latency-constrained local routing update method for low-Earth orbit satellite networks as described in any one of claims 1-7.
10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a local routing update program for a low-Earth orbit satellite network under time constraints. When the local routing update program for a low-Earth orbit satellite network under time constraints is executed by a processor, it implements the steps of the local routing update method for a low-Earth orbit satellite network under time constraints as described in any one of claims 1-7.
