A Port Task Processing Method for a Satellite Telemetry, Tracking and Control System

Abstract

This invention relates to the field of satellite telemetry and remote control technology, and discloses a port task processing method for a satellite telemetry, tracking, and command (TT&C) system, comprising: Step 1, probing all available network interfaces using a port scanner and establishing a multi-path communication channel including public network, private network, and satellite link; Step 2, collecting packet loss rate, latency, bandwidth, and jitter parameters of each path in the multi-path communication channel in real time, and updating the parameters based on a preset period; Step 3, generating a comprehensive score for each path based on the packet loss rate, latency, bandwidth, and jitter parameters. This invention employs a dynamic scoring and switching technology scheme for multi-path communication channels, achieving the technical effect of automatically selecting the optimal path based on real-time network performance. Compared to existing technologies that rely on fixed paths or manually configured switching thresholds, this solves the problems of high transmission latency, high packet loss rate, and inability to adaptively adjust due to network fluctuations.

Description

Technical Field

[0001] This invention relates to the field of satellite telemetry and remote control technology, specifically to a port task processing method for a satellite telemetry, tracking, and command system. Background Technology

[0002] The surge in demand for real-time data transmission from satellite telemetry, tracking, command and control (TT&C) systems poses a significant challenge to existing port task processing methods. Existing technologies, exemplified by patent CN114696888B (Port Task Processing Method, Device, Equipment, and Medium for Satellite TT&C Systems), propose multi-path communication mechanisms, but their core solutions rely on fixed path selection and traditional protocols, leading to significant bottlenecks in practical applications. This invention provides a port task processing method for satellite TT&C systems that addresses the shortcomings of existing technologies through multi-path dynamic scoring, seamless migration to the QUIC protocol, and adaptive weight adjustment. The following analysis focuses on specific problems:

[0003] CN114696888B employs a pre-configured path priority strategy and lacks real-time network status awareness. Satellite links are susceptible to interference from weather and obstructions, and fixed paths cannot quickly switch during sudden packet loss or latency spikes, leading to data backlog or even loss for critical missions.

[0004] Traditional solutions rely on TCP protocol to rebuild connections for path switching, requiring a three-way handshake and congestion window reset. Real-world testing shows that this process takes an average of over 500ms, which cannot meet the high real-time requirements of remote sensing image backhaul. Furthermore, resetting TCP sequence numbers necessitates reordering at the receiving end, further exacerbating service interruption duration.

[0005] Existing methods use fixed weights to calculate path scores, which cannot adapt to dynamic scenarios such as bandwidth jitter and sudden traffic spikes. For example, when satellite link bandwidth suddenly drops, the system still allocates traffic according to the initial weights, exacerbating transmission latency. At the same time, the full retransmission mechanism repeatedly sends confirmed data packets after handover, resulting in an additional 20% to 35% bandwidth waste.

[0006] To address these issues, this invention proposes a port task processing method for a satellite telemetry, tracking, and command (TT&C) system. Summary of the Invention

[0007] To address the shortcomings of existing technologies, this invention provides a port task processing method for a satellite telemetry, tracking, and command (TT&C) system, thereby resolving the problems mentioned in the background section.

[0008] To achieve the above objectives, the present invention provides the following technical solution: a port task processing method for a satellite telemetry, tracking, and command (TT&C) system, comprising:

[0009] Step 1: Use a port scanner to detect all available network interfaces and establish a multi-path communication channel that includes public network, private network and satellite link;

[0010] Step 2: Collect packet loss rate, latency, bandwidth and jitter parameters of each path in the multi-path communication channel in real time, and update the parameters based on a preset period.

[0011] Step 3: Generate a comprehensive score for each path based on packet loss rate, latency, bandwidth, and jitter parameters;

[0012] Step 4: When the overall score of the current path is lower than the preset threshold or the difference between the highest overall score and the current score exceeds the set threshold, a path switching command is triggered.

[0013] Step 5: Use the connection migration function in the QUIC protocol to migrate the communication task on the current path to the optimal path with the highest comprehensive score;

[0014] Step 6: Continuously monitor the performance parameters of the multi-path communication channel during the communication process of the optimal path, and adjust the weight coefficient of the comprehensive score according to the monitoring results;

[0015] Step 7: Pause the task queue and record the transmission breakpoint position during the path switching process. After the switching is completed, resume data transmission based on the transmission breakpoint position and confirmation mechanism.

[0016] Preferably, step 1, which involves detecting all available network interfaces and establishing a multipath communication channel using a port scanner, further includes:

[0017] Sub-step 1.1: Send probe packets of a preset size to all network interfaces and record the sending timestamp T. send With the received timestamp T ack Calculate the initial round-trip time (RTT). initial ,in:

[0018] RTT initial =(T ack -T send )×1000,

[0019] Among them, T send T is the time when the probe packet is sent. ack RTT is used to confirm the reception time of the corresponding probe packet. initial This is the initial round-trip time delay;

[0020] Sub-step 1.2, based on the initial round-trip time (RTT) initial Perform port binding and authentication on each network interface, and generate session keys K for each path. session :

[0021] K session=ECDH(P priv ,P pub ),

[0022] Among them, P priv For the local elliptic curve private key, P pub For remote elliptic curve public keys, K session For shared keys

[0023] Sub-step 1.3, based on the session key K session In conjunction with network interface parameters, a unique connection identifier (CID) is assigned to each path to establish a multi-path communication channel. The CID generation rules are as follows:

[0024] CID = Hash(K) session ||IP local ||Port local ||IP remote ||Port remote ),

[0025] Among them, IP local For local IP address, Port local For local port number, IP address remote For remote IP address, Port remote The port number is the remote port number, and Hash() is the SHA-256 hash function.

[0026] Preferably, in step 2, the packet loss rate, latency, bandwidth, and jitter parameters of each path are collected in real time, and the packet loss rate and jitter variance are calculated based on the sliding window algorithm, further including:

[0027] Sub-step 2.1: Send N probe packets of a preset size to the current path and record the set of sending times:

[0028]

[0029] Where N is the number of probe packets sent in a single probe cycle, and T send Send a time sequence for the probe packet;

[0030] Sub-step 2.2: Receive the confirmation response from the probe packet and record the set of confirmation times. Calculate packet loss rate L current :

[0031]

[0032] Where M is the actual number of acknowledgment packets received, and L current This represents the real-time packet loss rate for the current path.

[0033] Sub-step 2.3, based on the transmission time Tsend With confirmation time T ack Calculate the average round-trip time (RTT). avg and instantaneous bandwidth B current :

[0034]

[0035] Among them, RTT avg B is the average round-trip time for the current path. current S represents the instantaneous bandwidth of the current path. pkt To detect packet size;

[0036] Sub-step 2.4, based on the most recent W stored within the sliding window size RTT avg Value, calculate jitter variance:

[0037]

[0038] Among them, W size For sliding window size, RTT i The value of the i-th RTT within the window. This represents the average RTT within the window.

[0039] Preferably, in step 3, calculating the comprehensive score for each path based on the packet loss rate, latency, bandwidth, and jitter parameters further includes:

[0040] Sub-step 3.1, for the bandwidth B current Perform normalization processing and calculate the bandwidth ratio B. ratio :

[0041]

[0042] Among them, B current B is the instantaneous bandwidth of the current path. max The maximum bandwidth among all paths;

[0043] Sub-step 3.2, regarding the delay RTT avg The jitter variance was normalized, and the latency percentage D was calculated. ratio and the percentage of jitter J ratio :

[0044]

[0045] Among them, RTT avg D represents the average round-trip time of the current path. max The maximum allowable delay is preset, and Jitter is the jitter variance of the current path. max Set the maximum allowable jitter;

[0046] Sub-step 3.3: Based on the bandwidth ratio B_ratio, latency ratio D_ratio, packet loss rate L_current, and jitter ratio J_ratio, calculate the comprehensive score:

[0047] Score = α·B ratio -β·D ratio -γ·L current -λ·J ratio ,

[0048] Where α, β, γ, and λ are preset weighting coefficients, and L current This represents the real-time packet loss rate for the current path.

[0049] Sub-step 3.4: Compare the comprehensive score (Score) with a preset threshold (T). score and the optimal path score best The comparison is performed to generate a path switching decision signal.

[0050] Preferably, in step 4, triggering a path switching command when the overall score of the current path is lower than a preset threshold or the difference between the scores of the optimal path and the preset threshold further includes:

[0051] Sub-step 4.1: Obtain the overall score (Scores) for the current path. current and the comprehensive score set of all paths: Scores = {Scores1,Scores2,...,Scores} n},

[0052] Among them, Scores current This is the overall score for the current path; Scores is the set of scores for all paths.

[0053] Sub-step 4.2 involves extracting the maximum value (Scores) from the comprehensive score set Scores. best Calculate the current path score difference Δ score :

[0054] Δ score =Score best -Score current ,

[0055] Among them, Score best The highest overall score among all paths, Δ score This represents the score difference between the current path and the optimal path.

[0056] Sub-step 4.3: Determine if the switching conditions are met. If any of the following conditions are met, generate a path switching instruction:

[0057] (Score current <T low OR(Δ) score >T margin ),

[0058] Among them, T low T is the preset low threshold for the comprehensive score. margin This is the preset threshold for the advantage of the score difference.

[0059] Preferably, step 5, migrating the current task connection to the optimal path via the QUIC protocol, further includes:

[0060] Sub-step 5.1: Send a path update command frame to the original path, the command frame containing the connection identifier (CID) of the optimal path. new and session key K session The instruction frame type is Frame update :

[0061] Frame update = <Type=0x1A,CID new ,K session >,

[0062] Among them, CID new K is the unique connection identifier for the optimal path. session The TLS session key for the original path;

[0063] Sub-step 5.2, on the optimal path, the last confirmed data packet sequence number Last... Acked Transmission begins, new path starting sequence number Seq new satisfy:

[0064] Seq new =Last Acked +1,

[0065] Among them, Last Acked Seq is the sequence number of the last packet confirmed by the receiver on the original path. new The sequence number of the first packet transmitted along the new path;

[0066] Sub-step 5.3, the optimal path receives the receiver's Seq new ACK response new Then, close the communication connection along the original path. The closing condition is:

[0067] T now -T update >2×RTT original ,

[0068] Among them, Tnow T is the current system timestamp. update To send a Frame update Frame timestamp, RTT original This represents the average round-trip time of the original path.

[0069] Preferably, step 6, which involves continuously monitoring the performance of each path and dynamically adjusting the weighting coefficients of the overall score after switching, further includes:

[0070] Sub-step 6.1: Periodically collect the updated packet loss rate L along the optimal path. new Delayed RTT new Bandwidth B new and jitter new Generate a set of performance parameters P new :

[0071] P new ={L new RTT new B new Jitter new},

[0072] Among them, L new RTT is the real-time packet loss rate of the optimal path after the switch. new B represents the average round-trip time of the optimal path after the handover. new Jitter is the bandwidth of the optimal path after the switch. new The jitter variance of the optimal path after the switch;

[0073] Sub-step 6.2, based on the performance parameter set P new Calculate the weight adjustment amount based on historical transmission data and update the weight coefficients:

[0074]

[0075] γ new =γ old -η·L new ,

[0076]

[0077] Where η is the preset learning rate, and B max D represents the maximum bandwidth among all paths. max To preset the maximum allowable delay, J max α is the preset maximum allowable jitter. old β old γ old , λ old α is the current weighting coefficient. new β newγ new , λ new These are the updated weighting coefficients;

[0078] Sub-step 6.3 applies a normalization constraint to the updated weight coefficients:

[0079]

[0080] λ final =1-(α) final +β final +γ final ),

[0081] Where, α final β final γ final , λ final The normalized weighting coefficients, α new β new γ new , λ new These are the updated weighting coefficients.

[0082] Preferably, in step 7, pausing the task queue and recording breakpoints during path switching, and resuming transmission based on a selective confirmation mechanism after the switching is completed, further includes:

[0083] Sub-step 7.1: When the path switching command is triggered, immediately pause the current task queue and record the breakpoint location. Point The breakpoint is located at the sequence number Seq_last of the last sent but unacknowledged data packet:

[0084] Break Point =max(Seq sent )-max(Seq acked ),

[0085] Among them, Seq sent Seq is the set of sequence numbers of data packets sent along the current path. acked This is the set of sequence numbers of data packets that have been acknowledged by the receiver.

[0086] Sub-step 7.2: After establishing a connection along the optimal path, break according to the breakpoint position. Point Generate retransmission request list Retrans List :

[0087] Retrans List ={seq|seq∈Seq sent ∧seq>Break Point},

[0088] Where seq is the data packet sequence number;

[0089] Sub-step 7.3: Send the retransmission request list Retrans through the optimal path. List And based on the selective confirmation option, it receives the set of missing data packet sequence numbers. seq :

[0090] Missing seq =SACK Blocks ∩Retrans List ,

[0091] Among them, SACK Blocks This refers to the range of consecutively received data blocks returned by the receiver.

[0092] Sub-step 7.4: Retransmit the set of missing data packet sequence numbers. seq The data in the queue is updated as follows:

[0093] Queue new =Queue old Missing seq ,

[0094] Queue old Before switching, the queue of tasks to be transferred is called Queue. new The updated task queue after switching.

[0095] A terminal device includes a processor and a memory, the memory storing a computer program, and the processor executing the computer program to implement the port task processing method of the satellite telemetry, tracking and command system.

[0096] A storage medium storing a computer program, which, when executed by a processor, implements the port task processing method of the satellite telemetry, tracking, and command system.

[0097] This invention provides a port task processing method for a satellite telemetry, tracking, command and control system. It has the following beneficial effects:

[0098] 1. This invention adopts a multi-path communication channel dynamic scoring and switching technology solution to achieve the technical effect of automatically selecting the optimal path based on real-time network performance. Compared with the existing technology that relies on fixed paths or manual configuration of switching thresholds, it solves the problems of high transmission delay, high packet loss rate and inability to adaptively adjust due to network fluctuations.

[0099] 2. This invention adopts a seamless connection migration technology solution based on the QUIC protocol, achieving zero data transmission interruption during path switching. Compared with the existing TCP protocol solution that requires connection reconstruction, resulting in long service interruption time, this invention solves the key defect of high real-time tasks in satellite telemetry, tracking, and command scenarios failing due to switching delays.

[0100] 3. The present invention adopts a dynamic weight adjustment and selective confirmation retransmission technology to maximize the utilization of transmission resources and ensure data integrity. Compared with the fixed weight scoring and full retransmission mechanism in the existing technology, it solves the problems of path selection deviation caused by rigid weight and bandwidth waste caused by redundant retransmission in the existing methods. Attached Figure Description

[0101] Figure 1 This is a flowchart of the present invention. Detailed Implementation

[0102] To enable those skilled in the art to understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort should fall within the scope of protection of the present invention.

[0103] The present invention will now be described in detail with reference to the accompanying drawings:

[0104] Example:

[0105] Please see the appendix Figure 1 This invention provides a port task processing method for a satellite telemetry, tracking, command and control system, comprising:

[0106] Step 1: Use a port scanner to detect all available network interfaces and establish a multi-path communication channel that includes public network, private network and satellite link;

[0107] Sub-step 1.1: Send probe packets of a preset size to all network interfaces and record the sending timestamp T. send With the received timestamp T ack Calculate the initial round-trip time (RTT). initial ,in:

[0108] RTT initial =(T ack -T send )×1000,

[0109] Among them, T send T is the time when the probe packet is sent. ack RTT is used to confirm the reception time of the corresponding probe packet.initial This is the initial round-trip time delay;

[0110] Sub-step 1.2, based on the initial round-trip time (RTT) initial Perform port binding and authentication on each network interface, and generate session keys K for each path. session :

[0111] K session =ECDH(P priv ,P pub ),

[0112] Among them, P priv For the local elliptic curve private key, P pub For remote elliptic curve public keys, K session For shared keys

[0113] Sub-step 1.3, based on session key K session In conjunction with network interface parameters, a unique connection identifier (CID) is assigned to each path to establish a multi-path communication channel. The CID generation rules are as follows:

[0114] CID = Hash(K) session ||IP local ||Port local ||IP remote ||Port remote ),

[0115] Among them, IP local For local IP address, Port local For local port number, IP address remote For remote IP address, Port remote The port number is the remote port number, and Hash() uses the SHA-256 hash function.

[0116] Step 2: Collect packet loss rate, latency, bandwidth and jitter parameters of each path in the multi-path communication channel in real time, and update the parameters based on a preset period.

[0117] Sub-step 2.1: Send N probe packets of a preset size to the current path and record the set of sending times:

[0118]

[0119] Where N is the number of probe packets sent in a single probe cycle, and T send Send a time sequence for the probe packet;

[0120] Sub-step 2.2: Receive the acknowledgment response from the probe packet and record the set of acknowledgment times. Calculate packet loss rate L current :

[0121]

[0122] Where M is the actual number of acknowledgment packets received, and L current This represents the real-time packet loss rate for the current path.

[0123] Sub-step 2.3, based on the sending time T send With confirmation time T ack Calculate the average round-trip time (RTT). avg and instantaneous bandwidth B current :

[0124]

[0125] Among them, RTT avg B is the average round-trip time for the current path. current S represents the instantaneous bandwidth of the current path. pkt To detect packet size;

[0126] Sub-step 2.4, based on the most recent W stored within the sliding window size RTT avg Value, calculate jitter variance:

[0127]

[0128] Among them, W size For sliding window size, RTT i The value of the i-th RTT within the window. This represents the average RTT within the window.

[0129] Step 3: Generate a comprehensive score for each path based on packet loss rate, latency, bandwidth, and jitter parameters;

[0130] Sub-step 3.1, for bandwidth B current Perform normalization processing and calculate the bandwidth ratio B. ratio :

[0131]

[0132] Among them, B current B is the instantaneous bandwidth of the current path. max The maximum bandwidth among all paths;

[0133] Sub-step 3.2, regarding the delayed RTT avg The jitter variance was normalized, and the latency percentage D was calculated. ratio and the percentage of jitter J ratio :

[0134]

[0135] Among them, RTT avg D represents the average round-trip time of the current path. max The maximum allowable delay is preset, and Jitter is the jitter variance of the current path. max Set the maximum allowable jitter;

[0136] Sub-step 3.3 calculates the comprehensive score based on bandwidth ratio B_ratio, latency ratio D_ratio, packet loss rate L_current, and jitter ratio J_ratio:

[0137] Score = α·B ratio -β·D ratio -γ·L current -λ·J ratio ,

[0138] Where α, β, γ, and λ are preset weighting coefficients, and L current This represents the real-time packet loss rate for the current path.

[0139] Sub-step 3.4: Compare the overall score (Score) with the preset threshold (T). score and the optimal path score best Comparison is performed to generate path switching decision signals;

[0140] Step 4: When the overall score of the current path is lower than the preset threshold or the difference between the highest overall score and the current score exceeds the set threshold, a path switching command is triggered.

[0141] Sub-step 4.1: Obtain the overall score (Scores) for the current path. current and the comprehensive score set of all paths: Scores = {Scores1,Scores2,...,Scores} n},

[0142] Among them, Scores current This is the overall score for the current path; Scores is the set of scores for all paths.

[0143] Sub-step 4.2 involves extracting the maximum value (Scores) from the comprehensive score set Scores. best Calculate the current path score difference Δ score :

[0144] Δ score =Score best -Score current ,

[0145] Among them, Score best The highest overall score among all paths, Δscore This represents the score difference between the current path and the optimal path.

[0146] Sub-step 4.3: Determine if the switching conditions are met. If any of the following conditions are met, generate a path switching instruction:

[0147] (Score current <T low OR(Δ) score >T margin ),

[0148] Among them, T low T is the preset low threshold for the comprehensive score. margin The preset threshold for the advantage of the score difference;

[0149] Step 5: Use the connection migration function in the QUIC protocol to migrate the communication task on the current path to the optimal path with the highest comprehensive score;

[0150] Sub-step 5.1: Send a path update command frame to the original path. The command frame contains the connection identifier (CID) of the optimal path. new and session key K session The instruction frame type is Frame update :

[0151] Frame update = <Type=0x1A,CID new ,K session >,

[0152] Among them, CID new K is the unique connection identifier for the optimal path. session The TLS session key for the original path;

[0153] Sub-step 5.2, on the optimal path, uses the sequence number of the last confirmed data packet (Last) Acked Transmission begins, new path starting sequence number Seq new satisfy:

[0154] Seq new =Last Acked +1,

[0155] Among them, Last Acked Seq is the sequence number of the last packet confirmed by the receiver on the original path. new The sequence number of the first packet transmitted along the new path;

[0156] Sub-step 5.3: The optimal path receives the receiver's Seq pair. new ACK response new Then, close the communication connection along the original path. The closing condition is:

[0157] T now -T update >2×RTT original ,

[0158] Among them, T now T is the current system timestamp. update To send a Frame update Frame timestamp, RTT original This represents the average round-trip time of the original path;

[0159] Step 6: Continuously monitor the performance parameters of the multi-path communication channel during the communication process of the optimal path, and adjust the weight coefficient of the comprehensive score according to the monitoring results;

[0160] Sub-step 6.1: Periodically collect the updated packet loss rate L along the optimal path. new Delayed RTT new Bandwidth B new and jitter new Generate a set of performance parameters P new :

[0161] P new ={L new RTT new B new Jitter new},

[0162] Among them, L new RTT is the real-time packet loss rate of the optimal path after the switch. new B represents the average round-trip time of the optimal path after the handover. new Jitter is the bandwidth of the optimal path after the switch. new The jitter variance of the optimal path after the switch;

[0163] Sub-step 6.2, based on the performance parameter set P new Calculate the weight adjustment amount based on historical transmission data and update the weight coefficients:

[0164]

[0165] γ new =γ old -η·L new ,

[0166]

[0167] Where η is the preset learning rate, and B max D represents the maximum bandwidth among all paths. max To preset the maximum allowable delay, J maxα is the preset maximum allowable jitter. old β old γ old , λ old α is the current weighting coefficient. new β new γ new , λ new These are the updated weighting coefficients;

[0168] Sub-step 6.3 applies a normalization constraint to the updated weight coefficients:

[0169]

[0170] λ final =1-(α) final +β final +γ final ),

[0171] Where, α final β final γ final , λ final The normalized weighting coefficients, α new β new γ new , λ new These are the updated weighting coefficients;

[0172] Step 7: Pause the task queue and record the transmission breakpoint position during the path switching process. After the switching is completed, resume data transmission based on the transmission breakpoint position and confirmation mechanism.

[0173] Sub-step 7.1: When the path switching command is triggered, immediately pause the current task queue and record the breakpoint location. Point The breakpoint is located at the sequence number Seq_last of the last sent but unacknowledged data packet:

[0174] Break Point =max(Seq sent )-max(Seq acked ),

[0175] Among them, Seq sent Seq is the set of sequence numbers of data packets sent along the current path. acked This is the set of sequence numbers of data packets that have been acknowledged by the receiver.

[0176] Sub-step 7.2: After establishing a connection along the optimal path, break according to the breakpoint position. Point Generate retransmission request list Retrans List :

[0177] RetransList ={seq|seq∈Seq sent ∧seq>Break Point},

[0178] Where seq is the data packet sequence number;

[0179] Sub-step 7.3: Send the retransmission request list Retrans through the optimal path. List And based on the selective confirmation option, it receives the set of missing data packet sequence numbers. seq :

[0180] Missing seq =SACK Blocks ∩Retrans List ,

[0181] Among them, SACK Blocks This refers to the range of consecutively received data blocks returned by the receiver.

[0182] Sub-step 7.4, retransmit the set of missing data packet sequence numbers. seq The data in the queue is updated as follows:

[0183] Queue new =Queue old Missing seq ,

[0184] Queue old Before switching, the queue of tasks to be transferred is called Queue. new The updated task queue after switching.

[0185] Step 1 uses port scanning and key negotiation to dynamically detect and bind public networks, private networks, and satellite links, constructing a secure and encrypted multi-path communication channel. Elliptic curve key exchange is used to generate session keys, ensuring independent authentication and data isolation for different paths; a unique connection identifier is generated based on network interface parameter hashing to avoid path confusion. This achieves unified management of multiple interface resources, providing underlying channel protection for subsequent dynamic switching, while enhancing the security of satellite telemetry, tracking, and command (TT&C) data transmission through encryption and unique identification.

[0186] Step 2 uses a sliding window algorithm to statistically analyze packet loss rate, latency, bandwidth, and jitter variance, periodically probing path performance. By sending N probe packets and calculating the packet loss rate, the reliability of the current path is accurately reflected; transmission efficiency is quantified by combining average round-trip time and instantaneous bandwidth; and jitter variance is calculated using a sliding window to identify path stability. This provides real-time data support for dynamic path selection, ensuring the system's ability to quickly detect network fluctuations.

[0187] Step 3 normalizes bandwidth, latency, packet loss rate, and jitter to construct a multi-dimensional scoring model. The scoring focus is dynamically adjusted by preset weight coefficients; for example, in high-bandwidth scenarios, the α value is prioritized. This transforms complex network parameters into a unified score, addressing the path selection bias caused by traditional methods relying on a single indicator and enabling scientific decision-making.

[0188] Step 4 triggers the handover command under two conditions, balancing absolute performance degradation with relative advantage differences. For example, if the satellite link score drops sharply or the private network link score is significantly higher, migration is initiated immediately. This step avoids frequent invalid handovers and prevents misjudgments caused by minor fluctuations in scores, thus improving the robustness of handover decisions.

[0189] Step 5 utilizes the QUIC protocol's connection migration function to transfer the CID and key, maintaining session continuity; the new path starts transmission from Last_Acked+1, ensuring continuous packet sequence numbers; the original path is closed via timeout to release redundant resources. Compared to the 500ms or more delay of TCP connection reconstruction, millisecond-level switching is achieved, meeting the zero-interruption requirements of high real-time services such as remote sensing commands.

[0190] Step 6 updates the weight coefficients based on the performance of the switched path, for example, by increasing them when bandwidth increases, and maintains the total weight sum at 1 through normalization constraints. This allows the scoring model to adapt to network changes, solving the rigidity problem of fixed weights in sudden traffic scenarios and improving the accuracy of long-term path selection.

[0191] Step 7 generates a list of data packets that need to be retransmitted by recording the breakpoint locations, and then retransmits only the missing data using the SACK option. Compared to the full retransmission mechanism, this step reduces redundant data transmission by 20% to 35%, significantly reducing bandwidth consumption while ensuring data integrity.

[0192] A terminal device includes a processor and a memory, the memory storing a computer program, and the processor executing the computer program to implement a port task processing method for a satellite telemetry, tracking, and command system.

[0193] A storage medium storing a computer program, which, when executed by a processor, implements a port task processing method for a satellite telemetry, tracking, and command (TT&C) system.

[0194] The terminal equipment integrates multi-path dynamic scoring, QUIC seamless migration, and closed-loop weight optimization algorithms into the hardware layer, enabling low-latency and high-reliability transmission for satellite telemetry, tracking, and command (TT&C) missions, while significantly reducing system resource consumption.

[0195] The storage medium encapsulates the core algorithms through standardized programs, enabling the rapid implementation and flexible iteration of satellite telemetry, tracking, and command (TT&C) port task processing methods. At the same time, it ensures data reliability in extreme scenarios through software-layer redundancy control.

[0196] Although embodiments of the invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims and their equivalents.

Claims

1. A method for processing port tasks of a satellite TT&C system, characterized in that, The method comprises the following steps: Step All available network interfaces are probed by the port scanner and multi-path communication channels are established including public, private and satellite links. Step The packet loss rate, delay, bandwidth and jitter parameters of each path in the multi-path communication channel are collected in real time, and the parameters are updated based on a preset period. Steps , based on bandwidth proportion , delay proportion , packet loss rate and jitter proportion , to calculate the comprehensive score Score: ， wherein, , , , is a preset weight coefficient, is a real-time packet loss rate of the current path; Step triggering the path switching instruction when the comprehensive score of the current path is lower than a preset threshold or a difference between the highest value in the comprehensive score and the current value exceeds a set threshold. Step , by the connection migration function in the protocol migrates the communication task of the current path to the optimal path with the highest comprehensive score; Sub-step sending a path update instruction frame to the original path, the instruction frame containing the connection identifier of the optimal path and the session key where the instruction frame type is : ， wherein, a unique connection identifier for the optimal path, a a session key; Sub-step On the optimal path, the last confirmed data packet sequence number Start transmission, new path start sequence number Satisfies: ， wherein, is the last acknowledged packet sequence number by the receiver on the original path, is the starting packet sequence number for transmission on the new path; Sub-step The optimal path receives the receiver's... Confirmation response Then, close the communication connection along the original path. The closing condition is: ， wherein, is the current system timestamp, is the timestamp of the sending frame, is the average round-trip delay of the original path; Step The performance parameters of the multi-path communication channel are continuously monitored during the communication process of the optimal path, and the weight coefficients of the comprehensive scores are adjusted according to the monitoring results. Step During the path switching process, the task queue is suspended and the transmission breakpoint position is recorded. After the switching is completed, the mechanism resumes the data transmission based on the transmission breakpoint position.

2. The method of claim 1, wherein the method further comprises: In the step 1, all available network interfaces are detected by a port scanner and a multi-path communication channel is established, and the method further comprises the steps of: Sub-step sending a probe packet of a preset size to all network interfaces and recording a sending timestamp and a receiving timestamp calculating an initial round-trip delay wherein: ， wherein, is a detection packet sending time, is a corresponding detection packet acknowledgement receiving time, is an initial round-trip delay; Sub-step , based on the initial round-trip latency , performing port binding and authentication for each network interface, generating a session key for each path : ， wherein, is a local elliptic curve private key, is a remote elliptic curve public key, is a shared key sub-step based on the session key assigning a unique connection identifier to each path establishing a multi-path communication channel, wherein the generation rule is ， wherein, is a local address, is a local port number, is a remote address, is a remote port number, is a hash function.

3. The method of claim 1, wherein the method further comprises: determining whether the port task is a port task of a satellite control system; and if the port task is a port task of a satellite control system, then determining whether the port task is a port task of a satellite measurement and control system. The steps In the method, the packet loss rate, delay, bandwidth and jitter parameters of each path are collected in real time, the packet loss rate and jitter variance are calculated based on a sliding window algorithm, and the method further comprises the following steps: sub-step , sending a probe packet of a second preset size to the current path and recording a set of sending time points ， wherein, is the number of probe packets transmitted within a single probing period, is the sequence of probe packet transmission times; Sub-step , receiving an acknowledgement response of the probe packet, recording a set of acknowledgement time points , calculating a packet loss rate : ， wherein, is the number of actually received acknowledgement packets, is the real-time packet loss rate of the current path; Sub-step , according to the sending time and the acknowledgement time , calculate the average round-trip delay and the instantaneous bandwidth : ， ， wherein, is the current path average round-trip time, is the current path instantaneous bandwidth, is the probe packet size; Sub-step , based on the most recent values stored within the sliding window , compute the jitter variance : ， wherein, is the size of the sliding window, is the value of the bit value, is the average value of the average value.

4. The method of claim 1, wherein the method further comprises: The step In some embodiments, the computing the comprehensive score of each path according to the packet loss rate, delay, bandwidth and jitter parameters further comprises: Sub-step normalizing the bandwidth to calculate the bandwidth proportion : ， wherein, is the current path instantaneous bandwidth, is the maximum bandwidth among all paths; Sub-step , the delay , and the jitter variance are normalized, and the delay proportion and the jitter proportion are calculated: ， ， wherein, is an average round-trip delay of the current path, is a preset maximum allowed delay, is a jitter variance of the current path, is a preset maximum allowed jitter; Sub-step , based on the bandwidth proportion , delay proportion , packet loss rate and jitter proportion , to calculate a comprehensive score Score; sub-step comparing the comprehensive score with a preset threshold and the optimal path score to generate a path switching decision signal.

5. The method of claim 1, wherein the method further comprises: The step In some embodiments, the path switching instruction is triggered when the comprehensive score of the current path is lower than a preset threshold or a score difference between the optimal path and the current path exceeds a set threshold. sub-step , obtaining a comprehensive score of the current path and a comprehensive score set of all paths wherein, is the comprehensive score of the current path, is the score set of all paths; sub-step from the set of extracted aggregate scores maximum value , calculate the current path score difference : ， wherein, is the highest overall score among all paths, is the score difference between the current path and the optimal path; Sub-step , determines whether or not a switching condition is satisfied, and generates a path switching instruction if any of the following conditions is satisfied: ， wherein, is a pre-set overall score low threshold value, is a pre-set score difference advantage threshold value.

6. The method of claim 1, wherein the method further comprises: The step In the method, the monitoring and dynamically adjusting the weight coefficients of the comprehensive scores after the switching further comprises: sub-step collecting periodically updated packet loss rates on the optimal path , delays , bandwidths and jitters , generating a set of performance parameters : ={ , , , }， wherein, is the real-time packet loss rate of the post-switch optimal path, is the average round-trip delay of the post-switch optimal path, is the bandwidth of the post-switch optimal path, is the jitter variance of the post-switch optimal path; Sub-step , according to the performance parameter set Calculate weight adjustment amount with historical transmission data, update weight coefficient: ， ， ， ， wherein, a preset learning rate, a maximum bandwidth in all paths, a preset maximum allowed delay, a preset maximum allowed jitter, , , , a current weight coefficient, , , , an updated weight coefficient; Sub-step Normalization constraint on the updated weight coefficients: ， ， ， ， wherein, , , , is the normalized weight coefficient, , , , is the updated weight coefficient.

7. The method of claim 1, wherein the method further comprises: determining whether the port task is a satellite control task; and if the port task is a satellite control task, then determining whether the port task is a satellite control task for a satellite control system. The steps In one embodiment, the method further comprises pausing the task queue and recording a breakpoint during the path switch process, and resuming the transmission based on a selective acknowledgement mechanism after the switch is completed. Sub-step Upon triggering the path switch instruction, the current task queue is immediately suspended and the breakpoint position is recorded The breakpoint position is the sequence number of the last sent but unacknowledged data packet : ， wherein, is a set of sequence numbers of data packets that have been sent by the current path, is a set of sequence numbers of data packets that have been acknowledged by the receiver; Sub-step after the connection is established over the optimal path, the retransmission request list is generated based on the breakpoint position :​ ， wherein, is a data packet sequence number; Sub-step sending the retransmission request list over the optimal path and receiving the set of missing data packet sequence numbers based on the selective acknowledgement option : ， wherein, a range of consecutively received data blocks returned for the receiver; sub-step retransmitting the missing data packet sequence number set and updating the task queue to: ， wherein, a task queue to be transmitted before the handover, an updated task queue after the handover.

8. A terminal device, comprising: The satellite measurement control system comprises a processor and a memory, and the memory stores a computer program.

9. A storage medium, characterized by The memory stores a computer program, and the computer program is executed by the processor to realize the port task processing method of the satellite measurement control system according to any one of claims 1 to 7.

Images