A path-dependent three-stage time-aware gate scheduling control method for low-orbit satellite networks

Abstract

The present application relates to the technical field of satellite communication, and more particularly to a path-related three-stage time-aware gating scheduling control method for low-orbit satellite networks, comprising: obtaining multi-source data such as service path state, link switching state and queue backlog state, and forming a running period gating observation sequence after time alignment; generating a candidate sending gate set according to the current service path, calculating bottleneck scores based on queue backlog characteristics, gating blocking characteristics and link operation characteristics to identify key bottleneck gates; performing attribution of guard band blocking and gate closing blocking on the key bottleneck gates, and dividing the three stages of steady state, pressure and recovery in combination with blocking persistence and recovery conditions; and applying a differentiated gating profile to the key bottleneck gates according to the running stage selection. The present application guarantees the deterministic transmission of key services under the conditions of dynamic topology and frequent link switching through path-related bottleneck identification and three-stage gating switching, and improves the utilization efficiency of link resources.

Description

Technical Field

[0001] This invention relates to the field of satellite communication technology, and in particular to a path-dependent three-stage time-aware gating scheduling control method for low-Earth orbit satellite networks. Background Technology

[0002] With the rapid development of low-Earth orbit (LEO) satellite constellation technology, satellite networks are increasingly being used in global communication coverage, emergency communication, and IoT access. Against this backdrop, to ensure the deterministic transmission performance of critical services, the Time-Aware Shaper (TAS) mechanism from Time-Sensitive Networking (TSN) is being gradually introduced into LEO satellite networks. By implementing gating scheduling for different service queues, it ensures that scheduled traffic (ST) is transmitted within a predetermined time window.

[0003] Traditional TAS (Transmission Access System) solutions are mostly designed for terrestrial network environments with stable topologies and minimal changes in propagation delay. The gating control objects are typically fixed, and the gating profile remains unchanged over a long period. However, in low-Earth orbit (LEO) satellite networks, the high-speed motion of satellites causes continuous changes in service paths. The propagation delays of inter-satellite and satellite-to-ground links fluctuate continuously due to orbital geometry, leading to frequent link switching. This presents several challenges for directly migrating terrestrial TAS solutions: First, the gating control objects migrate with the service path. Transmission gates that were not bottlenecks before may become less important under new path conditions, while the real bottleneck gates may shift. If multiple gates are uniformly controlled without differentiation, the system becomes overly sensitive to noise. Second, if gating switching is triggered solely based on link switching events without identifying whether actual congestion has occurred, premature, late, or excessive switching can easily occur. Furthermore, existing solutions often struggle to distinguish between gate closure congestion and guard band congestion, resulting in a lack of targeted parameter adjustments and amplified delay spikes and jitter within the link switching window.

[0004] In real-world low-Earth orbit (LEO) satellite network environments, the requirements for gating scheduling strategies vary significantly across different stages. During steady-state operation, a balance must be struck between resource utilization and critical service protection; before and after link switching, enhanced transmission protection capabilities are needed to suppress increased latency jitter; and after switching, a smooth transition from a high-protection state is required to avoid control oscillations and throughput losses. However, existing TAS (Transmission Assignment System) solutions lack the ability to switch gating profiles in stages based on system operating conditions, employing a uniform gating strategy across all scenarios. This forces the system to be configured with gating based on the highest protection requirements of the worst-case scenario, resulting in decreased link resource utilization and significant deficiencies in flexibility and adaptability. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of existing technologies and provide a path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks, comprising the following steps: S1: Obtain the current service path status, link switching status, propagation delay change information, candidate planned traffic service sending gate status, planned traffic service queue backlog status, and link operation status, and perform time alignment to form a runtime gating observation sequence; S2: Generate a set of candidate planned traffic service sending gates related to the current service path and its currently associated planned traffic service sending gates, and calculate the candidate gate bottleneck score based on the queue backlog characteristics, gate blocking characteristics and link operation characteristics of each candidate planned traffic service sending gate within a preset observation window, and identify the key bottleneck gate based on the candidate gate bottleneck score; S3: Perform blocking attribution on the critical bottleneck gate. When the critical bottleneck gate is in the protection zone, it is attributed to the protection zone blocking. When the critical bottleneck gate is not in the protection zone and the actual gate state is closed, it is attributed to the gate closing blocking. Combined with the link switching state, blocking persistence and recovery conditions, the system operation phase is divided into steady state phase, stress phase and recovery phase. S4: Select the corresponding gating profile from the preset gating profile set according to the current operating stage, and apply it to the critical bottleneck gate. The gating profile of the stress stage is relative to the effective transmission window of the enhanced planned traffic service in the steady state stage, and the gating profile of the recovery stage is used to transition between the stress stage and the steady state stage.

[0006] Preferably, in step S1, the operational gated observation sequence is formed, including: S11: The link controller obtains the current service path identifier, whether the current service path is available, whether it has entered the link switching preparatory window, whether a link switching has occurred, and the propagation delay change information of each link in the current service path; S12: Establish a multi-queue scheduling structure in the forwarding nodes on the current service path, including a best-effort service queue, an audio / video bridging service queue, a planned traffic service queue, and a control and auxiliary service queue, and collect service queue information including the queue length, queue occupancy rate, queue occupancy growth rate, and packet loss indication of the planned traffic service queue. S13: Collect the planned gate status, actual gate status, guard band status, link bandwidth utilization, and link availability status of the planned traffic service transmission gate according to a unified sampling period, and align them with the data obtained from the propagation delay change information and the service queue information based on the sampling timestamp; S14: Using the current service path identifier and sampling timestamp as indexes, write the aligned data into the runtime gated observation sequence so that the gated observation data corresponding to different service paths can be distinguished from each other.

[0007] Preferably, in step S2, generating a set of path-related candidate planned traffic service sending gates includes: S211: Based on the current service path, determine the ingress port, egress port and next-hop link of each forwarding node in sequence, and map the sending gate in each forwarding node used to send the planned traffic service to the next-hop link as a sending gate within the path; S212: Add the sending gates within the path to the initial candidate gate set, and add the sending gates that share a sending link or a shared planned traffic service queue with the exit hop of the current service path as exit-related sending gates to the initial candidate gate set; S213: Based on the link availability status, the send gate configurability status, and the validity of the current service path, delete the send gates whose corresponding links are unavailable, whose send gates are not configurable, or whose current service paths have been removed from the initial candidate gate set, to obtain the path-related candidate planned traffic service send gate set; S214: When it is detected that the current service path identifier has changed, the next hop in the current service path has changed, or the current critical bottleneck gate is unavailable, re-execute steps S211 to S213 to update the candidate planned traffic service sending gate set as the service path changes.

[0008] Preferably, in step S2, identifying the key bottleneck gate based on the candidate gate bottleneck score includes: S221: For each candidate planned traffic service transmission gate in the path-related candidate planned traffic service transmission gate set, calculate the candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, comprehensive blocking ratio, and gate open still backlog ratio based on a preset observation window. S222: Obtain the bandwidth utilization of the link corresponding to each candidate planned traffic service transmission gate, determine the topology position weight according to the hop position of the corresponding candidate planned traffic service transmission gate in the current service path, and determine the service priority weight according to the latency constraint or priority of the corresponding planned traffic service. S223: Perform a weighted calculation on at least three of the following: candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, overall blocking ratio, gate open but still backlog ratio, link bandwidth utilization, topology location weight, and service priority weight, to obtain the candidate gate bottleneck score for each candidate planned traffic service transmission gate. S224: Sort the candidate planned traffic service transmission gates according to the candidate gate bottleneck score, and determine the candidate planned traffic service transmission gate with the highest candidate gate bottleneck score that exceeds the preset bottleneck judgment threshold as the key bottleneck gate; when there is no candidate planned traffic service transmission gate that exceeds the preset bottleneck judgment threshold, keep the current key bottleneck gate or extend the observation window and re-score.

[0009] Preferably, in step S3, performing a blockage attribution on the critical bottleneck gate includes: S311: Compare the backlog of the planned traffic service queue corresponding to the key bottleneck gate with the blockage-aware backlog threshold. When the backlog reaches the blockage-aware backlog threshold, generate a blockage sample to be attributed. S312: For the blockage sample to be attributed, first determine whether the critical bottleneck gate is in the protection zone. When the critical bottleneck gate is in the protection zone, mark the blockage sample to be attributed as a protection zone blockage sample. S313: When the critical bottleneck door is not in the protection zone, determine the actual door status of the critical bottleneck door. When the actual door status is closed, mark the blockage sample to be attributed as a door closed blockage sample. S314: When a critical bottleneck gate is not in the protection zone and the actual gate status is open, but the corresponding planned traffic service queue is still backlogged, the blocked sample to be attributed is marked as a backlogged sample with the gate open, and the review of the link bandwidth utilization, the mismatch between the planned gate status and the actual gate status, and the critical bottleneck gate selection results is triggered based on the backlogged sample with the gate open. S315: Count the number of blocked samples in the protection zone, the number of blocked samples when the door is closed, and the number of samples that are still backlogged when the door is open in the preset observation window, respectively, generate the blockage attribution result of the key bottleneck door, and construct the blockage state sequence of the key bottleneck door based on the blockage attribution result obtained by continuous sampling.

[0010] Preferably, in step S3, the system operation phase is divided into a steady-state phase, a stress phase, and a recovery phase based on the blocking attribution result, link switching status, and preset phase transition conditions, including: S321: Set the initial operation phase of the system to the steady state phase, and set the pressure phase entry threshold, pressure phase exit threshold, recovery phase exit threshold, pressure holding window, and recovery holding window respectively; S322: Calculate the number of consecutive blocking samples recursively based on the key bottleneck gate blocking state sequence, and switch from the steady state stage to the pressure stage when a link switching event is detected or the number of consecutive blocking samples reaches the pressure stage entry threshold. S323: Accumulate the duration of the pressure phase during the pressure phase and recursively calculate the number of consecutively cleared samples. When the duration of the pressure phase reaches the pressure holding window and the number of consecutively cleared samples reaches the pressure phase exit threshold, switch from the pressure phase to the recovery phase. S324: During the recovery phase, the duration of the recovery phase is accumulated, and the number of recovery cleared samples is recursively calculated according to the recovery backlog threshold which is lower than the blockage perception backlog threshold. When the duration of the recovery phase reaches the recovery holding window and the number of recovery cleared samples reaches the recovery phase exit threshold, the recovery phase is switched to the steady state phase. S325: When the system is in the stress phase and blocked samples reappear, maintain the stress phase and recalculate the number of consecutively cleared samples. When the system is in the recovery phase and the number of consecutively blocked samples reaches the stress phase entry threshold again, return from the recovery phase to the stress phase.

[0011] Preferably, the three-stage state transition further includes: Calculate the queue occupancy growth rate of the planned traffic service queue corresponding to the critical bottleneck gate between adjacent sampling times, and obtain the bandwidth utilization and packet loss indication of the corresponding link; Based on the blocking attribution results, when there is gate closing blocking or guard band blocking, the current sampling time is determined to be in a blocking state; or, when the link bandwidth utilization reaches the utilization threshold, and the queue occupancy growth rate reaches the growth rate threshold or the packet loss indication reaches the packet loss threshold, the current sampling time is determined to be in an auxiliary blocking state. When a link switching lead window is detected, the weight of the auxiliary blocking state in the stress phase entry determination is increased, so that the system enters the stress phase or performs preloading of the corresponding gating profile before the link switching occurs. Minimum holding times are set for the steady-state phase, stress phase, and recovery phase. If the corresponding minimum holding time is not reached, the transition to the operation phase with a lower level of protection is prohibited, so as to suppress repeated phase switching caused by instantaneous pressure changes.

[0012] Preferably, step S4 includes: S41: Configure a first gating profile for the steady-state phase. The first gating profile sets a planned traffic service transmission window to meet the basic delay constraints of the planned traffic service, and reserves transmission resources for audio and video bridging services and best-effort services outside the transmission window. S42: Configure a second gating profile for the stress phase. The second gating profile improves the effective opening ratio of planned traffic services at the critical bottleneck gate by extending the opening duration of the planned traffic service transmission gate, advancing the phase of the planned traffic service transmission window, or shortening the continuous transmission time of unplanned traffic services. S43: Configure a third gating profile for the recovery phase. The planned traffic service transmission gate opening duration and phase offset of the third gating profile are set between the corresponding parameters of the first gating profile and the second gating profile, so that the gating resources gradually recover from the high protection state of the stress phase to the steady state phase. S44: At the end of the current gating cycle or at the preset gating switch time, apply the gating profile corresponding to the current operation phase to the critical bottleneck gate, and keep the non-critical bottleneck gates in the path-related candidate planned traffic service sending gate set executing the original gating profile, so as to reduce the impact on the throughput capacity of non-bottleneck links. S45: After the gate control profile is executed, collect the actual opening and closing times of the key bottleneck doors, and compare them with the planned opening and closing times specified in the selected gate control profile to generate the gate control profile execution result.

[0013] Preferably, it also includes generating feedback indicators and adjusting parameters: The number of sampling points in the preset feedback window where the planned gate state is inconsistent with the actual gate state is counted, and the proportion of the number of inconsistent sampling points to the number of valid sampling points in the feedback window is calculated to obtain the gate mismatch rate. The effective opening ratio is obtained by calculating the duration during which the critical bottleneck door is actually open and not occupied by the protective strip within the preset feedback window, and by calculating the proportion of the time during which the critical bottleneck door is planned to be opened to the total planned opening time of the critical bottleneck door. The recovery time is calculated by taking the moment when the system enters the stress phase or when a link switch occurs as the starting point of the recovery time and the moment when the system meets the exit conditions of the recovery phase and returns to the steady state phase as the ending point of the recovery time. When the gate mismatch rate exceeds the preset mismatch threshold, adjust the phase offset of the corresponding gate profile; when the effective window opening ratio is lower than the preset window opening threshold, adjust the opening duration of the planned traffic service sending gate or the length of the guard band; when the recovery time exceeds the preset recovery time threshold, adjust the pressure holding window, recovery holding window, pressure phase exit threshold or recovery phase exit threshold. The adjusted parameters are used in the next control cycle, and the gating mismatch rate, effective window opening ratio, and recovery time before and after parameter adjustment are compared to retain the parameter adjustment results that improve at least one feedback indicator without invalidating the planned traffic service delay constraints.

[0014] Preferably, it also includes a gated closed-loop re-evaluation after path changes: When the current service path is detected to be unavailable, the current service path identifier has changed, the next hop link has changed, or the proportion of the critical bottleneck gate still backlogged in multiple consecutive feedback windows exceeds a preset proportion threshold, a critical bottleneck gate reassessment instruction is generated. In response to the critical bottleneck gate reassessment instruction, the blocking attribution results and gating feedback indicators corresponding to the current feedback window are frozen, and the path-related candidate planned traffic service sending gate set is regenerated based on the updated current service path. Based on the updated path-related candidate plan traffic service sending gate set, the candidate gate bottleneck score is recalculated. When the newly determined key bottleneck gate is different from the original key bottleneck gate, the gating profile corresponding to the current operation stage is transferred to the newly determined key bottleneck gate, and the original key bottleneck gate is restored to execute the original gating profile that matches its link. Within the preset verification window after the gating profile transfer, the blocking attribution results, gating mismatch rate, and effective window opening ratio are recalculated. If the newly determined critical bottleneck gate still does not meet the preset feedback conditions, the observation window is expanded or the candidate planned traffic service transmission gate with the second highest bottleneck score is selected for verification, thereby completing the dynamic migration of critical bottleneck gates and closed-loop control of gating under path change conditions.

[0015] Compared with the prior art, the beneficial effects of the present invention are: (1) This invention obtains multi-source data such as service path status, link switching status, propagation delay change information and queue backlog status and performs time alignment to form a unified observation sequence, providing a consistent data basis for bottleneck identification and stage determination, and ensuring the accuracy of gating decisions.

[0016] (2) The present invention generates a candidate gate set based on the current service path and calculates the bottleneck score based on queue backlog characteristics, gate blocking characteristics and link operation characteristics to identify key bottleneck gates, so that the control scope is focused on path-related key gates, avoiding redundant control of non-bottleneck gates and reducing scheduling complexity.

[0017] (3) This invention distinguishes between the protection zone blockage and the gate closure blockage of the key bottleneck gate, and divides the blockage into three stages: steady state, pressure and recovery, based on the duration of the blockage and the recovery conditions, so as to achieve accurate attribution of the blockage cause and perception of the system state, and make the gate control adjustment based on evidence.

[0018] (4) The present invention enhances the critical service transmission window during the pressure phase to suppress latency jitter during link switching through three-stage differentiated gating profile switching, achieves a smooth transition to steady state during the recovery phase, and takes into account resource utilization during the steady state phase, thereby improving link efficiency while ensuring deterministic transmission. Attached Figure Description

[0019] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the invention.

[0020] Figure 1 This is a flowchart of a path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to the present invention. Figure 2 This is another flowchart of a path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to the present invention. Figure 3 This is a schematic diagram illustrating the generation of path-related candidate gate sets and the identification of key bottleneck gates in this invention. Figure 4 This is a schematic diagram illustrating the attribution and three-stage switching relationship between gate close and guard band blockage in this invention. Figure 5 This is a schematic diagram illustrating the three-stage gating profile switching and feedback closed loop of the present invention. Detailed Implementation

[0021] To make the objectives, technical solutions, and advantages of this invention clearer, 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. Obviously, the described embodiments are only some, not all, of the embodiments described in this application. All other embodiments obtained by those skilled in the art based on the embodiments in this application without creative effort are within the scope of protection of this application.

[0022] Those skilled in the art will understand that, unless otherwise stated, the singular forms “a” and “an” used herein, and “the”, may also include the plural forms. It should be further understood that the term “comprising” as used in this specification means the presence of the stated features, integers, steps, operations, elements, and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0023] First embodiment: Please see Figure 1 and Figure 2As shown, this embodiment provides a path-dependent three-stage time-aware gating scheduling control method for low-Earth orbit (LEO) satellite networks. It acquires multi-source data, including service path status, link switching status, propagation delay variation information, and queue backlog status, and forms a unified observation sequence. Based on the current service path, it generates a candidate gate set and identifies key bottleneck gates based on multi-dimensional feature scoring. It performs precise attribution of protection band blocking and gate-closing blocking on key bottleneck gates, and divides the process into three stages—steady-state, stress, and recovery—based on blocking persistence and recovery conditions. Differentiated gating profiles are applied to key bottleneck gates according to the operational stage, thereby achieving deterministic transmission assurance for critical services under the dynamic topology and frequent link switching conditions of LEO satellite networks. The method includes the following steps: S1: Obtain the current service path status, link switching status, propagation delay change information, candidate planned traffic service sending gate status, planned traffic service queue backlog status, and link operation status, and perform time alignment to form a runtime gating observation sequence.

[0024] Preferably, in step S1, the operational gated observation sequence is formed, including: S11: The link controller obtains the current service path identifier, whether the current service path is available, whether it has entered the link switching preparatory window, whether a link switching has occurred, and the propagation delay change information of each link in the current service path; S12: Establish a multi-queue scheduling structure in the forwarding nodes on the current service path, including a best-effort service queue, an audio / video bridging service queue, a planned traffic service queue, and a control and auxiliary service queue, and collect service queue information including the queue length, queue occupancy rate, queue occupancy growth rate, and packet loss indication of the planned traffic service queue. S13: Collect the planned gate status, actual gate status, guard band status, link bandwidth utilization, and link availability status of the planned traffic service transmission gate according to a unified sampling period, and align them with the data obtained from the propagation delay change information and the service queue information based on the sampling timestamp; S14: Using the current service path identifier and sampling timestamp as indexes, write the aligned data into the runtime gated observation sequence so that the gated observation data corresponding to different service paths can be distinguished from each other.

[0025] In the aforementioned four-queue scheduling structure, the planned traffic service queue carries planned traffic with deterministic latency and jitter requirements, and its transmission timing is controlled by a time-aware shaping gating list; the audio / video bridging service queue carries streaming media services requiring bandwidth guarantees; the best-effort service queue carries ordinary data services; and the control and auxiliary service queue carries network control signaling and auxiliary management data. This four-queue structure allows for differentiated gating scheduling of different types of services on the same forwarding node.

[0026] S2: Generate a set of candidate planned traffic service sending gates related to the current service path and its currently associated planned traffic service sending gates, and calculate the candidate gate bottleneck score based on the queue backlog characteristics, gating blocking characteristics and link operation characteristics of each candidate planned traffic service sending gate within a preset observation window, and identify the key bottleneck gate based on the candidate gate bottleneck score.

[0027] Please see Figure 3 As shown, in step S2, a set of path-related candidate planned traffic service sending gates is generated, including: S211: Based on the current service path, determine the ingress port, egress port and next-hop link of each forwarding node in sequence, and map the sending gate in each forwarding node used to send planned traffic services to the next-hop link as a path-internal sending gate.

[0028] S212: Add the sending gates within the path to the initial candidate gate set, and add the sending gates that share the sending link or the planned traffic service queue with the exit hop of the current service path as exit-related sending gates to the initial candidate gate set.

[0029] S213: Based on the link availability status, the send gate configurability status, and the validity of the current service path, delete the send gates whose corresponding links are unavailable, whose send gates are unconfigurable, or whose send gates have left the current service path from the initial candidate gate set, and obtain the path-related candidate planned traffic service send gate set.

[0030] S214: When it is detected that the current service path identifier has changed, the next hop in the current service path has changed, or the current critical bottleneck gate is unavailable, re-execute steps S211 to S213 to update the candidate planned traffic service sending gate set as the service path changes.

[0031] For example, suppose the current service path is ,in Indicates the first [item] on the current service path There are several forwarding nodes. For each forwarding node, the next-hop link is determined based on its outgoing port, and the planned traffic service sending gate for the corresponding next-hop link on that node is included in the path sending gate. Simultaneously, it will be connected to the outgoing node... Adjacent transmission gates sharing a transmission link are included as egress-related transmission gates. After validity screening, a set of path-related candidate planned traffic service transmission gates is obtained. .

[0032] Preferably, in step S2, identifying the key bottleneck gate based on the candidate gate bottleneck score includes: S221: For each candidate planned traffic service transmission gate in the path-related candidate planned traffic service transmission gate set, calculate the candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, comprehensive blocking ratio, and gate open still backlog ratio based on a preset observation window. S222: Obtain the bandwidth utilization of the link corresponding to each candidate planned traffic service transmission gate, determine the topology position weight according to the hop position of the corresponding candidate planned traffic service transmission gate in the current service path, and determine the service priority weight according to the latency constraint or priority of the corresponding planned traffic service. S223: Perform a weighted calculation on at least three of the following: candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, overall blocking ratio, gate open but still backlog ratio, link bandwidth utilization, topology location weight, and service priority weight, to obtain the candidate gate bottleneck score for each candidate planned traffic service transmission gate. S224: Sort the candidate planned traffic service transmission gates according to the candidate gate bottleneck score, and determine the candidate planned traffic service transmission gate with the highest candidate gate bottleneck score that exceeds the preset bottleneck judgment threshold as the key bottleneck gate; when there is no candidate planned traffic service transmission gate that exceeds the preset bottleneck judgment threshold, keep the current key bottleneck gate or extend the observation window and re-score.

[0033] The candidate gate set is Let the candidate gate be at sampling time t. The corresponding ST queue backlog of packets is The sum of the backlog of all candidate gates is: , Candidate gate The proportion of activity at time t is defined as: , when When, define .

[0034] Furthermore, define the door closing blocking indicator. , Protection belt blockage indicator Comprehensive blockage indicator And the indicator volume is still backlogged when the door is opened. .when When the blockage sensing backlog threshold is greater than or equal to the threshold and the gate is closed and not in the protection zone, ,otherwise ;when When the threshold is greater than or equal to the blockage sensing backlog threshold and the gate is in the protection zone. ,otherwise Comprehensive blockage indicator ;when Greater than or equal to the blockage-aware backlog threshold and At that time, the indicator quantity is still backlogged when the door is open. ,otherwise .

[0035] Suppose there are M sampling points in the observation window W, then the candidate gate average activity ratio The proportion of backlog Door closing blockage ratio , Protection belt blockage ratio Overall blockage ratio And the proportion of people still backed up after opening They are defined as follows:

[0036]

[0037]

[0038]

[0039]

[0040] , in This is an indicator function that takes the value 1 if the condition within the parentheses is true, and 0 otherwise.

[0041] To address the issue of misjudgment that can easily occur when scoring solely based on backlog and blockage ratios, candidate gate topology position weights are further introduced into the scoring model. Business priority weight and link bandwidth utilization metrics The candidate gate bottleneck score Si can be defined as: , in, This is the topological position weight, used to reflect the criticality of the candidate gate in the current service path; This is a business priority weight, used to reflect the priority requirements of key business operations; This corresponds to the link bandwidth utilization rate; , , , , , , These represent the weight coefficients for each scoring item. The candidate gate with the highest score is ultimately selected as the path-related critical bottleneck gate. .

[0042] Through the above scoring mechanism, the identification of key bottleneck gates no longer relies solely on the backlog or blockage ratio in a single dimension, but comprehensively considers multiple dimensions such as path location, business priority, and link utilization status, thereby reducing the probability of misjudgment and narrowing the gate control object from the global gates to the actual bottleneck gates related to the path.

[0043] S3: Perform blocking attribution on the critical bottleneck gate. When the critical bottleneck gate is in the protection zone, it is attributed to the protection zone blocking. When the critical bottleneck gate is not in the protection zone and the actual gate state is closed, it is attributed to the gate closing blocking. Combined with the link switching state, blocking persistence and recovery conditions, the system operation phase is divided into steady state phase, stress phase and recovery phase.

[0044] Please see Figure 4 As shown, in step S3, the blocking attribution is performed on the critical bottleneck gate, including: S311: Compare the backlog of the planned traffic service queue corresponding to the key bottleneck gate with the blockage-aware backlog threshold. When the backlog reaches the blockage-aware backlog threshold, generate a blockage sample to be attributed. S312: For the blockage sample to be attributed, first determine whether the critical bottleneck gate is in the protection zone. When the critical bottleneck gate is in the protection zone, mark the blockage sample to be attributed as a protection zone blockage sample. S313: When the critical bottleneck door is not in the protection zone, determine the actual door status of the critical bottleneck door. When the actual door status is closed, mark the blockage sample to be attributed as a door closed blockage sample. S314: When a critical bottleneck gate is not in the protection zone and the actual gate status is open, but the corresponding planned traffic service queue is still backlogged, the blocked sample to be attributed is marked as a backlogged sample with the gate open, and the review of the link bandwidth utilization, the mismatch between the planned gate status and the actual gate status, and the critical bottleneck gate selection results is triggered based on the backlogged sample with the gate open. S315: Count the number of blocked samples in the protection zone, the number of blocked samples when the door is closed, and the number of samples that are still backlogged when the door is open in the preset observation window, respectively, generate the blockage attribution result of the key bottleneck door, and construct the blockage state sequence of the key bottleneck door based on the blockage attribution result obtained by continuous sampling.

[0045] In the process of attributing congestion, the primary reason for attributing congestion to guard band blocking is that even if there is queue backlog and the gate is closed during the guard band period, the root cause is that the guard band mechanism consumes transmission time, rather than a design flaw in the gating list itself. Distinguishing between the two types of congestion allows for more targeted parameter adjustments—gate closure congestion may require adjusting the gating list's opening time allocation, while guard band congestion may require optimizing the guard band length or adjusting the relative position of the transmission window and the guard band.

[0046] Preferably, in step S3, the system operation phase is divided into a steady-state phase, a stress phase, and a recovery phase based on the blocking attribution result, link switching status, and preset phase transition conditions, including: S321: Set the initial operation phase of the system to the steady state phase, and set the pressure phase entry threshold, pressure phase exit threshold, recovery phase exit threshold, pressure holding window, and recovery holding window respectively; S322: Calculate the number of consecutive blocking samples recursively based on the key bottleneck gate blocking state sequence, and switch from the steady state stage to the pressure stage when a link switching event is detected or the number of consecutive blocking samples reaches the pressure stage entry threshold. S323: Accumulate the duration of the pressure phase during the pressure phase and recursively calculate the number of consecutively cleared samples. When the duration of the pressure phase reaches the pressure holding window and the number of consecutively cleared samples reaches the pressure phase exit threshold, switch from the pressure phase to the recovery phase. S324: During the recovery phase, the duration of the recovery phase is accumulated, and the number of recovery cleared samples is recursively calculated according to the recovery backlog threshold which is lower than the blockage perception backlog threshold. When the duration of the recovery phase reaches the recovery holding window and the number of recovery cleared samples reaches the recovery phase exit threshold, the recovery phase is switched to the steady state phase. S325: When the system is in the stress phase and blocked samples reappear, maintain the stress phase and recalculate the number of consecutively cleared samples. When the system is in the recovery phase and the number of consecutively blocked samples reaches the stress phase entry threshold again, return from the recovery phase to the stress phase.

[0047] To further enhance the robustness of stage-based decision-making and avoid false triggering due to reliance solely on backlog thresholds, the backlog status of critical bottleneck gates, gate closure blocking, guard band blocking, link bandwidth utilization, and packet loss indication are all incorporated into the blocking decision-making framework. Let B*(t) be the number of backlogged packets in the ST queue corresponding to the path-related critical bottleneck gate at sampling time t, ρ*(t) be the link bandwidth utilization, and L(t) be the packet loss indication. The blocking condition is defined as: when B*(t) is greater than or equal to the blocking-aware backlog threshold and gate closure blocking or guard band blocking exists, Alternatively, when the link bandwidth utilization ρ*(t) exceeds the utilization threshold and the packet loss indicator L(t) exceeds the packet loss threshold, it will also... Set to 1; otherwise Continuous blocking sample count in accordance with Recursively, the sample count is continuously cleared. in accordance with The reverse state is obtained by recursion, and the count of the cleared samples Nrec(t) is obtained by recursion based on the recovery backlog threshold.

[0048] Preferably, the three-stage state transition further includes: Calculate the queue occupancy growth rate of the planned traffic service queue corresponding to the critical bottleneck gate between adjacent sampling times, and obtain the bandwidth utilization and packet loss indication of the corresponding link; Based on the blocking attribution results, when there is gate closing blocking or guard band blocking, the current sampling time is determined to be in a blocking state; or, when the link bandwidth utilization reaches the utilization threshold, and the queue occupancy growth rate reaches the growth rate threshold or the packet loss indication reaches the packet loss threshold, the current sampling time is determined to be in an auxiliary blocking state. When a link switching lead window is detected, the weight of the auxiliary blocking state in the stress phase entry determination is increased, so that the system enters the stress phase or performs preloading of the corresponding gating profile before the link switching occurs. Minimum holding times are set for the steady-state, stress, and recovery phases. Switching to a lower-protection phase is prohibited before the corresponding minimum holding time is reached to suppress repeated phase switching caused by transient load changes. For abnormal scenarios with repeated switching or persistent blocking, phase jitter is suppressed by combining the minimum holding window with continuous sample counting: if the system is in the stress phase and blocking recurs, the stress phase remains unchanged; if the system is in the recovery phase but blocking recurs, the system switches back to the stress phase.

[0049] For example, in a typical operational scenario, the system initially operates in a steady-state phase. When satellite motion causes the link switching pre-window to open, propagation delays begin to fluctuate, and critical bottlenecks may experience brief blockages. At this time, the number of consecutive blockage samples gradually accumulates, and when it reaches the pressure phase entry threshold, the system switches to the pressure phase. During the pressure phase, even if the blockage is temporarily relieved, continuous observation is required within the pressure maintenance window, and the system can only enter the recovery phase after the continuous clearing conditions are met. The recovery phase uses a more stringent recovery backlog threshold than the blockage-aware backlog threshold to determine the clearing status, ensuring that the queue is fully emptied and the system tends to stabilize before returning to the steady-state phase. This progressive phase transition mechanism avoids frequent phase switching caused by instantaneous backlog changes.

[0050] S4: Select the corresponding gating profile from the preset gating profile set according to the current operating stage, and apply it to the critical bottleneck gate. The gating profile of the stress stage is relative to the effective transmission window of the enhanced planned traffic service in the steady state stage, and the gating profile of the recovery stage is used to transition between the stress stage and the steady state stage.

[0051] Please see Figure 5 As shown, step S4 includes: S41: Configure a first gating profile Pstable for the steady-state phase. The first gating profile sets a planned traffic service transmission window to meet the basic delay constraints of the planned traffic service, and reserves transmission resources for audio and video bridging services and best-effort services outside the transmission window.

[0052] S42: Configure a second gating profile Pstress for the stress phase. The second gating profile increases the effective opening ratio of planned traffic services at the critical bottleneck gate by extending the opening duration of the planned traffic service transmission gate, advancing the phase of the planned traffic service transmission window, or shortening the continuous transmission time of unplanned traffic services.

[0053] S43: Configure a third gating profile Precovery for the recovery phase. The planned traffic service transmission gate opening duration and phase offset of the third gating profile are set between the corresponding parameters of the first gating profile and the second gating profile, so that the gating resources gradually recover from the high protection state of the stress phase to the steady state phase.

[0054] S44: At the end of the current gating cycle or at the preset gating switch time, apply the gating profile corresponding to the current operating phase to the critical bottleneck gate, and keep the non-critical bottleneck gates in the path-related candidate planned traffic service sending gate set executing the original gating profile, so as to reduce the impact on the throughput capacity of non-bottleneck links.

[0055] S45: After the gate control profile is executed, collect the actual opening and closing times of the key bottleneck doors, and compare them with the planned opening and closing times specified in the selected gate control profile to generate the gate control profile execution result.

[0056] Among them, the gated profile P is defined as a triple. , This indicates the initial open / closed state of the door. Represents the gating duration vector, This represents the phase offset of the gated profile. For example, consider a set of parameters:

[0057]

[0058] , In this context, the first term of the gate profile triplet represents the initial opening and closing state of the gate, with true indicating that it is initially open; the second term is the gate duration vector, representing the duration of each time period within a gate cycle; and the third term is the profile phase offset, representing the phase offset of the gate profile relative to the reference clock.

[0059] In the above example, the steady-state phase profile is mainly used to balance throughput efficiency and basic protection of critical services in stable scenarios; the second gating profile in the stress phase provides a wider effective transmission window for planned traffic services by adjusting the duration allocation and phase shift, which helps to reduce gating mismatch, latency spikes and jitter amplification in the link switching window; the parameters of the third gating profile in the recovery phase are between the first gating profile and the second gating profile, realizing a smooth transition from the high protection state to the steady state, reducing oscillation, window misalignment and throughput loss when falling back from the high protection state.

[0060] Preferably, it also includes generating feedback indicators and adjusting parameters: The number of sampling points in the preset feedback window where the planned gate state is inconsistent with the actual gate state is counted, and the proportion of the number of inconsistent sampling points to the number of valid sampling points in the feedback window is calculated to obtain the gate mismatch rate. The effective opening ratio is obtained by calculating the duration during which the critical bottleneck door is actually open and not occupied by the protective strip within the preset feedback window, and by calculating the proportion of the time during which the critical bottleneck door is planned to be opened to the total planned opening time of the critical bottleneck door. The recovery time is calculated by taking the moment when the system enters the stress phase or when a link switch occurs as the starting point of the recovery time and the moment when the system meets the exit conditions of the recovery phase and returns to the steady state phase as the ending point of the recovery time. When the gate mismatch rate exceeds the preset mismatch threshold, adjust the phase offset of the corresponding gate profile; when the effective window opening ratio is lower than the preset window opening threshold, adjust the opening duration of the planned traffic service sending gate or the length of the guard band; when the recovery time exceeds the preset recovery time threshold, adjust the pressure holding window, recovery holding window, pressure phase exit threshold or recovery phase exit threshold. The adjusted parameters are used in the next control cycle, and the gating mismatch rate, effective window opening ratio, and recovery time before and after the parameter adjustment are compared to retain the parameter adjustment results that improve at least one feedback indicator without invalidating the planned traffic service latency constraints. Through the above feedback mechanism, the current operating stage, congestion attribution results, gating mismatch rate, effective window opening ratio, and recovery time are combined into a feedback loop for subsequent parameter correction and candidate gate re-evaluation.

[0061] Preferably, it also includes a gated closed-loop re-evaluation after path changes: When the current service path is detected to be unavailable, the current service path identifier has changed, the next hop link has changed, or the proportion of the critical bottleneck gate still backlogged in multiple consecutive feedback windows exceeds a preset proportion threshold, a critical bottleneck gate reassessment instruction is generated. In response to the critical bottleneck gate reassessment instruction, the blocking attribution results and gating feedback indicators corresponding to the current feedback window are frozen, and the path-related candidate planned traffic service sending gate set is regenerated based on the updated current service path. Based on the updated path-related candidate plan traffic service sending gate set, the candidate gate bottleneck score is recalculated. When the newly determined key bottleneck gate is different from the original key bottleneck gate, the gating profile corresponding to the current operation stage is transferred to the newly determined key bottleneck gate, and the original key bottleneck gate is restored to execute the original gating profile that matches its link. Within the preset verification window after the gating profile transfer, the blocking attribution results, gating mismatch rate, and effective window opening ratio are recalculated. If the newly determined critical bottleneck gate still does not meet the preset feedback conditions, the observation window is expanded or the candidate planned traffic service transmission gate with the second highest bottleneck score is selected for verification, thereby completing the dynamic migration of critical bottleneck gates and closed-loop control of gating under path change conditions.

[0062] Second Embodiment Based on the same concept, this embodiment also provides a computer device, including a memory and a processor. The memory stores computer-readable instructions, which, when executed by the processor, cause the processor to perform the steps of a path-dependent three-stage time-aware gating scheduling control method for low-Earth orbit satellite networks as described in the embodiment.

[0063] Based on the same concept, the present invention also provides a storage medium storing computer-readable instructions, which, when executed by one or more processors, cause the one or more processors to perform the steps of a path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks as described in any of the embodiments.

[0064] It is understood that, for the aforementioned path-dependent three-stage time-aware gating scheduling control method for low-Earth orbit satellite networks, if all components are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer server or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of this invention. The aforementioned storage medium includes: USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, optical disks, and other media capable of storing program code.

[0065] Computer-readable storage media may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable storage medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transfer a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0066] The above description is merely a preferred embodiment of the present invention. The scope of protection of the present invention is not limited to the above embodiments. All technical solutions falling within the scope of the present invention's concept are within the scope of protection of the present invention. It should be noted that for those skilled in the art, any improvements and modifications made without departing from the principles of the present invention should also be considered within the scope of protection of the present invention.

Claims

1. A path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks, characterized in that, Includes the following steps: S1: Obtain the current service path status, link switching status, propagation delay change information, candidate planned traffic service sending gate status, planned traffic service queue backlog status, and link operation status, and perform time alignment to form a runtime gating observation sequence; S2: Generate a set of candidate planned traffic service sending gates related to the current service path and its currently associated planned traffic service sending gates, and calculate the candidate gate bottleneck score based on the queue backlog characteristics, gate blocking characteristics and link operation characteristics of each candidate planned traffic service sending gate within a preset observation window, and identify the key bottleneck gate based on the candidate gate bottleneck score; S3: Perform blocking attribution on the critical bottleneck gate. When the critical bottleneck gate is in the protection zone, it is attributed to the protection zone blocking. When the critical bottleneck gate is not in the protection zone and the actual gate state is closed, it is attributed to the gate closing blocking. Combined with the link switching state, blocking persistence and recovery conditions, the system operation phase is divided into steady state phase, stress phase and recovery phase. S4: Select the corresponding gating profile from the preset gating profile set according to the current operating stage, and apply it to the critical bottleneck gate. The gating profile of the stress stage is relative to the effective transmission window of the enhanced planned traffic service in the steady state stage, and the gating profile of the recovery stage is used to transition between the stress stage and the steady state stage.

2. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 1, characterized in that, In step S1, a runtime gated observation sequence is formed, including: S11: The link controller obtains the current service path identifier, whether the current service path is available, whether it has entered the link switching preparatory window, whether a link switching has occurred, and the propagation delay change information of each link in the current service path; S12: Establish a multi-queue scheduling structure in the forwarding nodes on the current service path, including a best-effort service queue, an audio / video bridging service queue, a planned traffic service queue, and a control and auxiliary service queue, and collect service queue information including the queue length, queue occupancy rate, queue occupancy growth rate, and packet loss indication of the planned traffic service queue. S13: Collect the planned gate status, actual gate status, guard band status, link bandwidth utilization, and link availability status of the planned traffic service transmission gate according to a unified sampling period, and align them with the data obtained from the propagation delay change information and the service queue information based on the sampling timestamp; S14: Using the current service path identifier and sampling timestamp as indexes, write the aligned data into the runtime gated observation sequence so that the gated observation data corresponding to different service paths can be distinguished from each other.

3. The path-dependent three-stage time-aware gated scheduling and control method for low-Earth orbit satellite networks according to claim 1, characterized in that, In step S2, a set of path-related candidate planned traffic service sending gates is generated, including: S211: Based on the current service path, determine the ingress port, egress port and next-hop link of each forwarding node in sequence, and map the sending gate in each forwarding node used to send the planned traffic service to the next-hop link as a sending gate within the path; S212: Add the sending gates within the path to the initial candidate gate set, and add the sending gates that share a sending link or a shared planned traffic service queue with the exit hop of the current service path as exit-related sending gates to the initial candidate gate set; S213: Based on the link availability status, the send gate configurability status, and the validity of the current service path, delete the send gates whose corresponding links are unavailable, whose send gates are not configurable, or whose current service paths have been removed from the initial candidate gate set, to obtain the path-related candidate planned traffic service send gate set; S214: When it is detected that the current service path identifier has changed, the next hop in the current service path has changed, or the current critical bottleneck gate is unavailable, re-execute steps S211 to S213 to update the candidate planned traffic service sending gate set as the service path changes.

4. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 3, characterized in that, In step S2, key bottleneck gates are identified based on the candidate gate bottleneck scores, including: S221: For each candidate planned traffic service transmission gate in the path-related candidate planned traffic service transmission gate set, calculate the candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, comprehensive blocking ratio, and gate open still backlog ratio based on a preset observation window. S222: Obtain the bandwidth utilization of the link corresponding to each candidate planned traffic service transmission gate, determine the topology position weight according to the hop position of the corresponding candidate planned traffic service transmission gate in the current service path, and determine the service priority weight according to the latency constraint or priority of the corresponding planned traffic service. S223: Perform a weighted calculation on at least three of the following: candidate gate activity ratio, backlog occurrence ratio, gate closure blocking ratio, guard band blocking ratio, overall blocking ratio, gate open but still backlog ratio, link bandwidth utilization, topology location weight, and service priority weight, to obtain the candidate gate bottleneck score for each candidate planned traffic service transmission gate. S224: Sort the candidate planned traffic service transmission gates according to the candidate gate bottleneck score, and determine the candidate planned traffic service transmission gate with the highest candidate gate bottleneck score that exceeds the preset bottleneck judgment threshold as the key bottleneck gate; when there is no candidate planned traffic service transmission gate that exceeds the preset bottleneck judgment threshold, keep the current key bottleneck gate or extend the observation window and re-score.

5. The path-dependent three-stage time-aware gated scheduling and control method for low-Earth orbit satellite networks according to claim 1, characterized in that, In step S3, a blocking attribution is performed on the critical bottleneck gate, including: S311: Compare the backlog of the planned traffic service queue corresponding to the key bottleneck gate with the blockage-aware backlog threshold. When the backlog reaches the blockage-aware backlog threshold, generate a blockage sample to be attributed. S312: For the blockage sample to be attributed, first determine whether the critical bottleneck gate is in the protection zone. When the critical bottleneck gate is in the protection zone, mark the blockage sample to be attributed as a protection zone blockage sample. S313: When the critical bottleneck door is not in the protection zone, determine the actual door status of the critical bottleneck door. When the actual door status is closed, mark the blockage sample to be attributed as a door closed blockage sample. S314: When a critical bottleneck gate is not in the protection zone and the actual gate status is open, but the corresponding planned traffic service queue is still backlogged, the blocked sample to be attributed is marked as a backlogged sample with the gate open, and the review of the link bandwidth utilization, the mismatch between the planned gate status and the actual gate status, and the critical bottleneck gate selection results is triggered based on the backlogged sample with the gate open. S315: Count the number of blocked samples in the protection zone, the number of blocked samples when the door is closed, and the number of samples that are still backlogged when the door is open in the preset observation window, respectively, generate the blockage attribution result of the key bottleneck door, and construct the blockage state sequence of the key bottleneck door based on the blockage attribution result obtained by continuous sampling.

6. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 5, characterized in that, In step S3, the system operation phase is divided into a steady-state phase, a stress phase, and a recovery phase based on the blocking attribution results, link switching status, and preset phase transition conditions, including: S321: Set the initial operation phase of the system to the steady state phase, and set the pressure phase entry threshold, pressure phase exit threshold, recovery phase exit threshold, pressure holding window, and recovery holding window respectively; S322: Calculate the number of consecutive blocking samples recursively based on the key bottleneck gate blocking state sequence, and switch from the steady state stage to the pressure stage when a link switching event is detected or the number of consecutive blocking samples reaches the pressure stage entry threshold. S323: Accumulate the duration of the pressure phase during the pressure phase and recursively calculate the number of consecutively cleared samples. When the duration of the pressure phase reaches the pressure holding window and the number of consecutively cleared samples reaches the pressure phase exit threshold, switch from the pressure phase to the recovery phase. S324: During the recovery phase, the duration of the recovery phase is accumulated, and the number of recovery cleared samples is recursively calculated according to the recovery backlog threshold which is lower than the blockage perception backlog threshold. When the duration of the recovery phase reaches the recovery holding window and the number of recovery cleared samples reaches the recovery phase exit threshold, the recovery phase is switched to the steady state phase. S325: When the system is in the stress phase and blocked samples reappear, maintain the stress phase and recalculate the number of consecutively cleared samples. When the system is in the recovery phase and the number of consecutively blocked samples reaches the stress phase entry threshold again, return from the recovery phase to the stress phase.

7. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 6, characterized in that, The three-stage state transition also includes: Calculate the queue occupancy growth rate of the planned traffic service queue corresponding to the critical bottleneck gate between adjacent sampling times, and obtain the bandwidth utilization and packet loss indication of the corresponding link; Based on the blocking attribution results, when there is gate closing blocking or guard band blocking, the current sampling time is determined to be in a blocking state; or, when the link bandwidth utilization reaches the utilization threshold, and the queue occupancy growth rate reaches the growth rate threshold or the packet loss indication reaches the packet loss threshold, the current sampling time is determined to be in an auxiliary blocking state. When a link switching lead window is detected, the weight of the auxiliary blocking state in the stress phase entry determination is increased, so that the system enters the stress phase or performs preloading of the corresponding gating profile before the link switching occurs. Minimum holding times are set for the steady-state phase, stress phase, and recovery phase. If the corresponding minimum holding time is not reached, the transition to the operation phase with a lower level of protection is prohibited, so as to suppress repeated phase switching caused by instantaneous pressure changes.

8. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 1, characterized in that, Step S4 includes: S41: Configure a first gating profile for the steady-state phase. The first gating profile sets a planned traffic service transmission window to meet the basic delay constraints of the planned traffic service, and reserves transmission resources for audio and video bridging services and best-effort services outside the transmission window. S42: Configure a second gating profile for the stress phase. The second gating profile improves the effective opening ratio of planned traffic services at the critical bottleneck gate by extending the opening duration of the planned traffic service transmission gate, advancing the phase of the planned traffic service transmission window, or shortening the continuous transmission time of unplanned traffic services. S43: Configure a third gating profile for the recovery phase. The planned traffic service transmission gate opening duration and phase offset of the third gating profile are set between the corresponding parameters of the first gating profile and the second gating profile, so that the gating resources gradually recover from the high protection state of the stress phase to the steady state phase. S44: At the end of the current gating cycle or at the preset gating switch time, apply the gating profile corresponding to the current operation phase to the critical bottleneck gate, and keep the non-critical bottleneck gates in the path-related candidate planned traffic service sending gate set executing the original gating profile, so as to reduce the impact on the throughput capacity of non-bottleneck links. S45: After the gate control profile is executed, collect the actual opening and closing times of the key bottleneck doors, and compare them with the planned opening and closing times specified in the selected gate control profile to generate the gate control profile execution result.

9. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 1, characterized in that, This also includes generating feedback metrics and adjusting parameters: The number of sampling points in the preset feedback window where the planned gate state is inconsistent with the actual gate state is counted, and the proportion of the number of inconsistent sampling points to the number of valid sampling points in the feedback window is calculated to obtain the gate mismatch rate. The effective opening ratio is obtained by calculating the duration during which the critical bottleneck door is actually open and not occupied by the protective strip within the preset feedback window, and by calculating the proportion of the time during which the critical bottleneck door is planned to be opened to the total planned opening time of the critical bottleneck door. The recovery time is calculated by taking the moment when the system enters the stress phase or when a link switch occurs as the starting point of the recovery time and the moment when the system meets the exit conditions of the recovery phase and returns to the steady state phase as the ending point of the recovery time. When the gate mismatch rate exceeds the preset mismatch threshold, adjust the phase offset of the corresponding gate profile; when the effective window opening ratio is lower than the preset window opening threshold, adjust the opening duration of the planned traffic service sending gate or the length of the guard band; when the recovery time exceeds the preset recovery time threshold, adjust the pressure holding window, recovery holding window, pressure phase exit threshold or recovery phase exit threshold. The adjusted parameters are used in the next control cycle, and the gating mismatch rate, effective window opening ratio, and recovery time before and after parameter adjustment are compared to retain the parameter adjustment results that improve at least one feedback indicator without invalidating the planned traffic service delay constraints.

10. The path-dependent three-stage time-aware gated scheduling control method for low-Earth orbit satellite networks according to claim 9, characterized in that, This also includes re-evaluation of the gated closed loop after path changes: When the current service path is detected to be unavailable, the current service path identifier has changed, the next hop link has changed, or the proportion of the critical bottleneck gate still backlogged in multiple consecutive feedback windows exceeds a preset proportion threshold, a critical bottleneck gate reassessment instruction is generated. In response to the critical bottleneck gate reassessment instruction, the blocking attribution results and gating feedback indicators corresponding to the current feedback window are frozen, and the path-related candidate planned traffic service sending gate set is regenerated based on the updated current service path. Based on the updated path-related candidate plan traffic service sending gate set, the candidate gate bottleneck score is recalculated. When the newly determined key bottleneck gate is different from the original key bottleneck gate, the gating profile corresponding to the current operation stage is transferred to the newly determined key bottleneck gate, and the original key bottleneck gate is restored to execute the original gating profile that matches its link. Within the preset verification window after the gating profile transfer, the blocking attribution results, gating mismatch rate, and effective window opening ratio are recalculated. If the newly determined critical bottleneck gate still does not meet the preset feedback conditions, the observation window is expanded or the candidate planned traffic service transmission gate with the second highest bottleneck score is selected for verification, thereby completing the dynamic migration of critical bottleneck gates and closed-loop control of gating under path change conditions.

Images