Port task processing method of satellite test operation control system

Abstract

The invention relates to the technical field of satellite telemetering and remote control, and discloses a port task processing method for a satellite measurement, operation and control system, which comprises the following steps of: 1, detecting all available network interfaces through a port scanner, and establishing a multi-path communication channel comprising a public network, a private network and a satellite link; step 2, acquiring packet loss rate, delay, 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; and step 3, generating a comprehensive score of each path according to the packet loss rate, the delay, the bandwidth and the jitter parameters. According to the method and the device, the technical scheme of dynamic scoring and switching of the multi-path communication channel is adopted, and the technical effect of automatically selecting the optimal path according to the real-time network performance is achieved; the problems of high transmission delay, large packet loss rate and incapability of adaptive adjustment caused by network fluctuation are solved.

Description

Technical Field

[0001] The present invention relates to the technical field of satellite telemetry and remote control, and specifically to a method for processing port tasks of a satellite measurement, operation and control system. Background Art

[0002] With the surge in the demand for real-time data transmission in satellite measurement, operation and control systems, the existing port task processing methods are facing severe challenges. The existing technologies represented by the patent CN114696888B (Method, Device, Equipment and Medium for Processing Port Tasks of Satellite Measurement, Operation and Control System) propose a multi-path communication mechanism, but the core solution relies on fixed path selection and traditional protocols, resulting in obvious bottlenecks in practical applications. A method for processing port tasks of a satellite measurement, operation and control system according to the present invention targets and solves the defects of the existing technologies through multi-path dynamic scoring, seamless migration of the QUIC protocol, and adaptive weight adjustment. The following is an analysis in combination with specific problems:

[0003] CN114696888B adopts a pre-configured path priority strategy and lacks the ability to perceive real-time network status. Satellite links are vulnerable to weather and occlusion interference, and fixed paths cannot be quickly switched in case of sudden packet loss or a sharp increase in delay, resulting in the backlog or even loss of critical task data.

[0004] Traditional solutions rely on the TCP protocol to rebuild connections for path switching, which requires three-way handshakes and congestion window reset. Actual measurements show that this process takes an average of more than 500 ms, which cannot meet the high real-time service requirements for remote sensing image transmission. In addition, the reset of TCP sequence numbers causes the receiving end to reorder, further exacerbating the service interruption duration.

[0005] Existing methods calculate path scores using fixed weights and cannot adapt to dynamic scenarios such as bandwidth jitter and bursty traffic. For example, when the satellite link bandwidth drops suddenly, the system still allocates traffic according to the initial weights, exacerbating transmission delays. At the same time, the full retransmission mechanism re-sends the already acknowledged data packets after switching, resulting in an additional 20% - 35% bandwidth waste.

[0006] Therefore, the present invention proposes a method for processing port tasks of a satellite measurement, operation and control system to solve the above-mentioned problems. Summary of the Invention

[0007] Aiming at the deficiencies of the existing technologies, the present invention provides a method for processing port tasks of a satellite measurement, operation and control system to solve the problems raised in the above background art.

[0008] To achieve the above objectives, the present invention is realized through the following technical solutions: A method for processing port tasks of a satellite measurement, operation and control system, comprising:

[0009] Step 1: Detect all available network interfaces through a port scanner and establish a multipath communication channel including public networks, private networks, and satellite links;

[0010] Step 2: Real-time collect the packet loss rate, latency, bandwidth, and jitter parameters of each path in the multipath communication channel, and update the parameters based on a preset period;

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

[0012] Step 4: When the comprehensive score of the current path is lower than a preset threshold or the difference between the highest value and the current value in the comprehensive scores exceeds a set threshold, trigger a path switching instruction;

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

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

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

[0016] Preferably, in Step 1, detecting all available network interfaces through a port scanner and establishing a multipath communication channel further includes:

[0017] Sub-step 1.1: Send a detection packet of a preset size to all network interfaces and record the sending timestamp T send and the receiving timestamp T ack , calculate the initial round-trip time RTT initial , where:

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

[0019] where, T send is the sending moment of the detection packet, T ack is the confirmation receiving moment of the corresponding detection packet, and RTT initial is the initial round-trip time;

[0020] Sub-step 1.2: According to the initial round-trip time RTT initial , perform port binding and authentication on each network interface, and generate a session key K session for each path:

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

[0022] where P priv is the local elliptic curve private key, P pub is the remote elliptic curve public key, and K session is the shared key

[0023] Sub-step 1.3: Based on the session key K session and the network interface parameters, assign a unique connection identifier CID to each path and establish a multi-path communication channel. The CID generation rule is as follows:

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

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

[0026] Preferably, in step 2, the packet loss rate, delay, bandwidth, and jitter parameters of each path are collected in real time, and the packet loss rate and jitter variance are statistically calculated based on the sliding window algorithm. Further, it includes:

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

[0028]

[0029] where N is the number of probe packets sent within a single detection period, and T send is the sequence of probe packet transmission times;

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

[0031]

[0032] where M is the number of actually received acknowledgment packets, and L current is the real-time packet loss rate of the current path;

[0033] Sub-step 2.3: According to the transmission time Tsend At the confirmation moment T ack calculate the average round-trip delay RTT avg and the instantaneous bandwidth B current :

[0034]

[0035] wherein, RTT avg is the average round-trip delay of the current path, B current is the instantaneous bandwidth of the current path, S pkt is the probe packet size;

[0036] Sub-step 2.4, based on the RTT size values of the last W avg stored in the sliding window, calculate the jitter variance Jitter:

[0037]

[0038] wherein, W size is the size of the sliding window, RTT i is the RTT value at the i-th position in the window, is the average value of RTT in the window.

[0039] Preferably, in the step 3, according to the packet loss rate, delay, bandwidth and jitter parameters, calculating the comprehensive score of each path further includes:

[0040] Sub-step 3.1, perform normalization processing on the bandwidth B current to calculate the bandwidth ratio B ratio :

[0041]

[0042] wherein, B current is the instantaneous bandwidth of the current path, B max is the maximum bandwidth among all paths;

[0043] Sub-step 3.2, perform normalization processing on the delay RTT avg and the jitter variance Jitter to calculate the delay ratio D ratio and the jitter ratio J ratio :

[0044]

[0045] wherein, RTT avg is the average round-trip delay of the current path, D max is the preset maximum allowable delay, Jitter is the jitter variance of the current path, J max is the preset maximum allowable jitter;

[0046] Sub-step 3.3: Calculate the comprehensive score Score based on the bandwidth ratio B_ratio, delay ratio D_ratio, current packet loss rate L_current, and jitter ratio J_ratio:

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

[0048] where α, β, γ, and λ are preset weight coefficients, and L current is the real-time packet loss rate of the current path;

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

[0050] Preferably, in step 4, when the comprehensive score of the current path is lower than the preset threshold or the difference between the current path score and the optimal path score exceeds the set threshold, a path switching instruction is triggered, which further includes:

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

[0052] where Scores current is the comprehensive score of the current path, and Scores is the set of scores of all paths;

[0053] Sub-step 4.2: Extract the maximum value Scores best from the set of comprehensive scores Scores, and calculate the score difference Δ score of the current path:

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

[0055] where Score best is the highest comprehensive score among all paths, and Δ score is the score difference between the current path and the optimal path;

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

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

[0058] where T low is the preset low threshold for comprehensive score, and T margin is the preset threshold for score difference advantage.

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

[0060] Sub-step 5.1, sending a path update instruction frame to the original path, where the instruction frame contains the connection identifier CID new of the optimal path and the session key K session , and the instruction frame type is Frame update :

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

[0062] where CID new is the unique connection identifier of the optimal path, and K session is the TLS session key of the original path;

[0063] Sub-step 5.2, starting transmission on the optimal path from the sequence number Last Acked of the last confirmed data packet, and the starting sequence number Seq new of the new path satisfies:

[0064] Seq new = Last Acked + 1,

[0065] where Last Acked is the sequence number of the last confirmed packet on the original path, and Seq new is the starting packet sequence number of the new path transmission;

[0066] Sub-step 5.3, after the optimal path receives the acknowledgment response ACK new for Seq new , close the communication connection of the original path, and the closing condition is:

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

[0068] where Tnow is the current system timestamp, T update is the timestamp of the sent Frame update frame, RTT original is the average round-trip delay of the original path.

[0069] Preferably, in step 6, after the switch, continuously monitor the performance of each path and dynamically adjust the weight coefficient of the comprehensive score, which further includes:

[0070] Sub-step 6.1, periodically collect the updated packet loss rate L new , delay RTT new , bandwidth B new and jitter Jitter new on the optimal path, and generate a performance parameter set P new :

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

[0072] where L new is the real-time packet loss rate of the optimal path after the switch, RTT new is the average round-trip delay of the optimal path after the switch, B new is the bandwidth of the optimal path after the switch, and Jitter new is the jitter variance of the optimal path after the switch;

[0073] Sub-step 6.2, calculate the weight adjustment amount according to the performance parameter set P new and the historical transmission data, and update the weight coefficient:

[0074]

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

[0076]

[0077] where η is the preset learning rate, B max is the maximum bandwidth among all paths, D max is the preset maximum allowable delay, J max is the preset maximum allowable jitter, and α old , β old , γ old , λ old are the current weight coefficients, and α new , β new, γ new , λ new are the updated weight coefficients;

[0078] Sub-step 6.3, perform normalization constraint on the updated weight coefficients:

[0079]

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

[0081] where α final , β final , γ final , λ final are the normalized weight coefficients, and α new , β new , γ new , λ new are the updated weight coefficients.

[0082] Preferably, in step 7, during the path switching process, pause the task queue and record the breakpoint, and after the switching is completed, resume the transmission based on the selective confirmation mechanism, which further includes:

[0083] Sub-step 7.1, when the path switching instruction is triggered, immediately pause the current task queue and record the breakpoint position Break Point , and the breakpoint position is the sequence number of the last sent but unacknowledged data packet Seq_last:

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

[0085] where Seq sent is the set of sequence numbers of data packets sent on the current path, and Seq acked is the set of sequence numbers of data packets acknowledged by the receiver;

[0086] Sub-step 7.2, after the optimal path is established, generate a retransmission request list Retrans Point according to the breakpoint position Break 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 receive the set of missing data packet sequence numbers Missing based on the selective acknowledgment option seq :

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

[0091] where SACK Blocks is the range of continuously received data blocks returned by the receiver;

[0092] Sub-step 7.4, retransmit the data in the set of missing data packet sequence numbers Missing seq , and update the task queue as:

[0093] Queue new = Queue old \Missing seq ,

[0094] where Queue old is the task queue to be transmitted before switching, and Queue new is the updated task queue after switching.

[0095] A terminal device includes a processor and a memory. The memory stores a computer program. When the processor executes the computer program, it implements the port task processing method of the satellite measurement, operation, and control system.

[0096] A storage medium stores a computer program. When the computer program is executed by a processor, it implements the port task processing method of the satellite measurement, operation, and control system.

[0097] The present invention provides a port task processing method for a satellite measurement, operation, and control system. It has the following beneficial effects:

[0098] 1. The present invention adopts a multi-path communication channel dynamic scoring and switching technical solution, achieving the technical effect of automatically selecting the optimal path according to the real-time network performance. Compared with the existing solutions that rely on fixed paths or manually configured switching thresholds, it solves the problems of high transmission delay, large packet loss rate, and inability to adaptively adjust caused by network fluctuations.

[0099] 2. The present invention adopts a seamless connection migration technical solution based on the QUIC protocol, achieving the technical effect of zero interruption in data transmission during the path switching process. Compared with the prior art solution where the TCP protocol needs to reconstruct the connection, resulting in a long service interruption time, it solves the key defect that high-real-time tasks in the satellite measurement, operation, and control scenario fail due to switching delay.

[0100] 3. The present invention adopts a dynamic weight adjustment and selective acknowledgment retransmission technical solution, achieving the technical effects of maximizing the utilization rate of transmission resources and data integrity. Compared with the prior art fixed weight scoring and full retransmission mechanism, it solves the problems of path selection deviation caused by rigid weights and bandwidth waste caused by redundant retransmissions in the existing methods. BRIEF DESCRIPTION OF THE DRAWINGS

[0101] Figure 1 is a flowchart of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

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

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

[0104] Embodiment:

[0105] Please refer to the appended Figure 1 , the embodiment of the present invention provides a port task processing method for a satellite measurement, operation, and control system, including:

[0106] Step 1, detecting all available network interfaces through a port scanner and establishing a multi-path communication channel including a public network, a private network, and a satellite link;

[0107] Sub-step 1.1, sending a detection packet of a preset size to all network interfaces and recording the sending timestamp T send and the receiving timestamp T ack , calculating the initial round-trip delay RTT initial , where:

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

[0109] where, T send is the sending moment of the detection packet, T ack is the confirmed receiving moment of the corresponding detection packet, RTTinitial is the initial round-trip delay;

[0110] Sub-step 1.2: According to the initial round-trip delay RTT initial , perform port binding and authentication on each network interface to generate the session key K for each path session :

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

[0112] where P priv is the local elliptic curve private key, P pub is the remote elliptic curve public key, and K session is the shared key

[0113] Sub-step 1.3: Based on the session key K session and network interface parameters, assign a unique connection identifier CID to each path and establish a multi-path communication channel. The CID generation rule is:

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

[0115] where IP local is the local IP address, Port local is the local port number, IP remote is the remote IP address, and Port remote is the remote port number. Hash() is the SHA-256 hash function;

[0116] Step 2: Real-time collect the packet loss rate, delay, bandwidth, and jitter parameters of each path in the multi-path communication channel 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 transmission times:

[0118]

[0119] where N is the number of probe packets sent within a single probe period, and T send is the sequence of probe packet transmission times;

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

[0121]

[0122] Among them, M is the actual number of received acknowledgment packets, and L current is the real-time packet loss rate of the current path;

[0123] Sub-step 2.3: Calculate the average round-trip time RTT send and the acknowledgment time T ack according to the sending time T avg and the instantaneous bandwidth B current :

[0124]

[0125] Among them, RTT avg is the average round-trip time of the current path, B current is the instantaneous bandwidth of the current path, and S pkt is the probe packet size;

[0126] Sub-step 2.4: Calculate the jitter variance Jitter based on the RTT size values of the last W avg stored in the sliding window:

[0127]

[0128] Among them, W size is the size of the sliding window, RTT i is the RTT value at the i-th position in the window, and is the average RTT in the window;

[0129] Step 3: Generate a comprehensive score for each path according to the packet loss rate, delay, bandwidth, and jitter parameters;

[0130] Sub-step 3.1: Normalize the bandwidth B current and calculate the bandwidth ratio B ratio :

[0131]

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

[0133] Sub-step 3.2: Normalize the delay RTT avg and the jitter variance Jitter, and calculate the delay ratio D ratio and the jitter ratio J ratio :

[0134]

[0135] Among them, RTT avg is the average round-trip delay of the current path, D max is the preset maximum allowable delay, Jitter is the jitter variance of the current path, J max is the preset maximum allowable jitter;

[0136] Sub-step 3.3: Calculate the comprehensive score Score based on the bandwidth ratio B_ratio, delay ratio D_ratio, current 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 weight coefficients, and L current is the real-time packet loss rate of the current path;

[0139] Sub-step 3.4: Compare the comprehensive score Score with the preset threshold T score and the optimal path score Score best to generate a path switching decision signal;

[0140] Step 4: When the comprehensive score of the current path is lower than the preset threshold or the difference between the highest value and the current value in the comprehensive score exceeds the set threshold, trigger a path switching instruction;

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

[0142] where Scores current is the comprehensive score of the current path, and Scores is the set of scores of all paths;

[0143] Sub-step 4.2: Extract the maximum value Scores in the set of comprehensive scores Scores best , and calculate the difference Δ score in the score of the current path:

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

[0145] where Score best is the highest comprehensive score among all paths, and Δscore The scoring difference between the current path and the optimal path;

[0146] Sub-step 4.3, determine whether the switching condition is met, and generate a path switching instruction if any of the following conditions is met:

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

[0148] where T low is the preset low comprehensive scoring threshold, and T margin is the preset scoring difference advantage threshold;

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

[0150] Sub-step 5.1, send a path update instruction frame to the original path, and the instruction frame includes the connection identifier CID of the optimal path new and the session key K session , where the instruction frame type is Frame update :

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

[0152] where CID new is the unique connection identifier of the optimal path, and K session is the TLS session key of the original path;

[0153] Sub-step 5.2, start transmitting from the sequence number of the last confirmed packet Last Acked on the optimal path, and the starting sequence number Seq of the new path new satisfies:

[0154] Seq new = Last Acked + 1,

[0155] where Last Acked is the sequence number of the last confirmed packet received by the receiver on the original path, and Seq new is the starting packet sequence number of the new path transmission;

[0156] Sub-step 5.3, after the optimal path receives the acknowledgment response ACK new for Seq new , close the communication connection of the original path, and the closing condition is:

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

[0158] wherein, T now is the current system timestamp, T update is the timestamp for sending the Frame update frame, and RTT original is the average round-trip delay of the original path;

[0159] Step 6, continuously monitor the performance parameters of the multi-path communication channel during the communication process on 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 new , delay RTT new , bandwidth B new and jitter Jitter new on the optimal path to generate a performance parameter set P new :

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

[0162] wherein, L new is the real-time packet loss rate of the optimal path after switching, RTT new is the average round-trip delay of the optimal path after switching, B new is the bandwidth of the optimal path after switching, and Jitter new is the jitter variance of the optimal path after switching;

[0163] Sub-step 6.2, calculate the weight adjustment amount according to the performance parameter set P new and the historical transmission data, and update the weight coefficient:

[0164]

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

[0166]

[0167] wherein, η is the preset learning rate, B max is the maximum bandwidth among all paths, D max is the preset maximum allowable delay, J maxis the preset maximum allowable jitter, α old , β old , γ old , λ old are the current weight coefficients, α new , β new , γ new , λ new are the updated weight coefficients;

[0168] Sub-step 6.3, perform normalization constraint on the updated weight coefficients:

[0169]

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

[0171] where α final , β final , γ final , λ final are the normalized weight coefficients, and α new , β new , γ new , λ new are the updated weight coefficients;

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

[0173] Sub-step 7.1, when the path switching instruction is triggered, immediately pause the current task queue and record the breakpoint position Break Point , and the breakpoint position is the sequence number of the last sent but unacknowledged packet Seq_last:

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

[0175] where Seq sent is the set of sequence numbers of the packets sent on the current path, and Seq acked is the set of sequence numbers of the packets acknowledged by the receiver;

[0176] Sub-step 7.2, after the optimal path is established, generate a retransmission request list Retrans Point based on the breakpoint position Break 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 receive the set of missing data packet sequence numbers Missing based on the selective acknowledgment option seq :

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

[0181] where SACK Blocks is the range of continuously received data blocks returned by the receiver;

[0182] Sub-step 7.4, retransmit the data in the set of missing data packet sequence numbers Missing seq , and update the task queue as:

[0183] Queue new = Queue old \ Missing seq ,

[0184] where Queue old is the task queue to be transmitted before switching, and Queue new is the updated task queue after switching.

[0185] Step 1: Through port scanning and key negotiation, dynamically detect and bind to public networks, private networks, and satellite links, and construct an encrypted and reliable multi-path communication channel. Use elliptic curve key exchange to generate a session key to ensure independent authentication and data isolation for different paths; generate a unique connection identifier based on the hash of network interface parameters to avoid path confusion. Achieve unified management of multi-interface resources, provide underlying channel guarantee for subsequent dynamic switching, and improve the security of satellite measurement, operation, and control data transmission through encryption and uniqueness identification.

[0186] Step 2: Based on the sliding window algorithm, statistically calculate the packet loss rate, latency, bandwidth, and jitter variance, and periodically detect path performance. By sending N probe packets and calculating the packet loss rate, accurately reflect the reliability of the current path; combine the average round-trip delay and instantaneous bandwidth to quantify the transmission efficiency; use the sliding window to calculate the jitter variance to identify path stability. Provide real-time data support for dynamic path selection to ensure the system's fast perception ability of network fluctuations.

[0187] Step 3 normalizes bandwidth, latency, packet loss rate, and jitter to construct a multi-dimensional scoring model. Dynamically adjust the scoring focus through preset weight coefficients. For example, in high-bandwidth scenarios, the α value is preferentially increased. Convert complex network parameters into a unified score to solve the path selection bias caused by traditional methods relying on a single indicator and achieve scientific decision-making.

[0188] Step 4 triggers the handover instruction through dual conditions, taking into account both absolute performance degradation and relative advantage gap. For example, if the satellite link score drops suddenly or the private network link score is significantly leading, the migration is immediately initiated. This step avoids frequent and ineffective handovers and prevents misjudgment caused by small fluctuations in the score, improving the robustness of the handover decision.

[0189] Step 5 uses the connection migration function of the QUIC protocol to transfer the CID and key to maintain session continuity; the new path starts transmitting from Last_Acked + 1 to ensure continuous packet sequence numbers; the original path is closed through timeout to release redundant resources. Compared with the delay of more than 500ms for TCP protocol to rebuild the connection, millisecond-level handover is achieved, meeting the zero-interruption requirements of high-real-time services such as remote sensing instructions.

[0190] Step 6 updates the weight coefficient according to the performance of the path after handover. For example, it increases when the bandwidth improves, and the sum of weights is kept at 1 through normalization constraints. Make the scoring model adapt to network changes, solve the rigidity problem of fixed weights in burst traffic scenarios, and improve the accuracy of long-term path selection.

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

[0192] A terminal device includes a processor and a memory. The memory stores a computer program, and when the processor executes the computer program, it implements the port task processing method of the satellite measurement, operation, and control system.

[0193] A storage medium stores a computer program, and when the computer program is executed by a processor, it implements the port task processing method of the satellite measurement, operation, and control system.

[0194] The terminal device solidifies the multi-path dynamic scoring, QUIC seamless migration, and closed-loop weight optimization algorithms to the hardware layer to achieve low-latency and high-reliable transmission of satellite measurement, operation, and control tasks, while significantly reducing system resource consumption.

[0195] The storage medium encapsulates the core algorithm through a standardized program to achieve the rapid implementation and flexible iteration of the satellite measurement, operation, and control port task processing method, while ensuring data reliability in extreme scenarios through software layer redundancy control.

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

Claims

1. A method for processing port tasks of a satellite measurement, operation and control system, characterized in that, Including: Step 1: Detect all available network interfaces through a port scanner and establish a multi-path communication channel including public network, private network, and satellite link; Step 2: Real-time collect the packet loss rate, latency, bandwidth, and jitter parameters of each path in the multi-path communication channel, and update the parameters based on a preset period; Step 3: Generate a comprehensive score for each path according to the packet loss rate, latency, bandwidth, and jitter parameters; Step 4: When the comprehensive score of the current path is lower than a preset threshold or the difference between the highest value and the current value in the comprehensive scores exceeds a set threshold, trigger a path switching instruction; Step 5: Migrate the communication task of the current path to the optimal path with the highest comprehensive score through the connection migration function in the QUIC protocol; 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; Step 7: Pause the task queue during the path switching process and record the transmission breakpoint position. After the switching is completed, confirm the mechanism to resume data transmission based on the transmission breakpoint position.

2. The port task processing method of a satellite measurement, operation and control system according to claim 1, characterized in that In Step 1, detecting all available network interfaces through a port scanner and establishing a multi-path communication channel further includes: Sub-step 1.1: Send probe packets of a preset size to all network interfaces and record the transmission timestamp T send and the reception timestamp T ack , and calculate the initial round-trip time RTT initial , where: RTT initial = (T ack - T send ) × 1000, Among them, T send is the sending time of the probe packet, and T ack is the corresponding receiving confirmation time of the probe packet. RTT initial is the initial round-trip delay; Sub-step 1.2, according to the initial round-trip time RTT initial , perform port binding and authentication on each network interface to generate the session key K for each path session : K session = ECDH(P priv , P pub ), Among them, P priv is the local elliptic curve private key, and P pub is the remote elliptic curve public key. K session is the shared key Sub-step 1.3, based on the session key K session and the network interface parameters, assign a unique connection identifier CID to each path and establish a multi-path communication channel, where the CID generation rule is: CID = Hash(K session || IP local || Port local || IP remote || Port remote ) Among them, IP local is the local IP address, Port local is the local port number, IP remote is the remote IP address, Port remote is the remote port number, and Hash() is the SHA-256 hash function.

3. The port task processing method of a satellite measurement, operation and control system according to claim 1, characterized in that In Step 2, real-time collecting the packet loss rate, latency, bandwidth, and jitter parameters of each path, and statistically calculating the packet loss rate and jitter variance based on the sliding window algorithm further includes: Sub-step 2.1: Send N probe packets of a preset size to the current path and record the set of sending times: where N is the number of probe packets sent within a single detection period, and T send is the sequence of probe packet sending times; Sub-step 2.2, receive the acknowledgement response of the probe packet, and record the set of acknowledgement times Calculate the packet loss rate L current : Among them, M is the actual number of received acknowledgment packets, and L current is the real-time packet loss rate of the current path; Sub-step 2.3, according to the sending time T send and the confirmation time T ack , calculate the average round-trip delay RTT avg and the instantaneous bandwidth B current : Among them, RTT avg is the average round-trip delay of the current path, B current is the instantaneous bandwidth of the current path, S pkt is the size of the probe packet; Sub-step 2.4, based on the RTT of the last W size stored in the sliding window avg values, calculate the jitter variance Jitter: Among them, W size is the sliding window size, and RTT i is the RTT value of the i-th bit within the window, and is the average RTT within the window.

4. A method for processing port tasks of a satellite measurement, operation and control system according to claim 1, characterized in that, In Step 3, calculating the comprehensive score of each path according to the packet loss rate, latency, bandwidth, and jitter parameters further includes: Sub-step 3.1, perform normalization on the bandwidth B current and calculate the bandwidth ratio B ratio : Among them, B current is the instantaneous bandwidth of the current path, and B max is the maximum bandwidth among all paths; Sub-step 3.2, normalize the delay RTT avg and the jitter variance Jitter, and calculate the delay ratio D ratio and the jitter ratio J ratio : Among them, RTT avg is the average round-trip delay of the current path, D max is the preset maximum allowable delay, Jitter is the jitter variance of the current path, J max is the preset maximum allowable jitter; Sub-step 3.3: Calculate the comprehensive score Score based on the bandwidth ratio B_ratio, latency ratio D_ratio, current packet loss rate L_current, and jitter ratio J_ratio; Score=α·B ratio -β·D ratio -γ·L current -λ·J ratio , where α, β, γ, and λ are preset weight coefficients, and L current is the real-time packet loss rate of the current path; Sub-step 3.4, compare the comprehensive score Score with the preset threshold T score and the optimal path score Score best to generate a path switching decision signal.

5. A method for processing port tasks of a satellite measurement, operation, and control system according to claim 1, characterized in that, In Step 4, when the comprehensive score of the current path is lower than a preset threshold or the difference between the optimal path score exceeds a set threshold, triggering a path switching instruction further includes: Sub-step 4.1, obtain the comprehensive score Scores of the current path current and the set of comprehensive scores of all paths: Scores = {Scores1, Scores2,..., Scores n} Among them, Scores current is the comprehensive score of the current path, and Scores is the set of scores for all paths; Sub-step 4.2, calculate the current path score difference Δ best by taking the maximum value Scores in the extracted comprehensive score set Scores score : Δ score = Score best - Score current , Among them, Score best is the highest comprehensive score among all paths, and Δ score is the score difference between the current path and the optimal path; Sub-step 4.3: Determine whether the switching condition is met. If any of the following conditions are met, generate a path switching instruction: (Score current <T low ) OR (Δ score > T margin ), Among them, T low is the preset low threshold of the comprehensive score, and T margin is the preset threshold of the score difference advantage.

6. The port task processing method of a satellite measurement, operation and control system according to claim 1, characterized in that In Step 5, migrating the current task connection to the optimal path through the QUIC protocol further includes: Sub-step 5.1, send a path update instruction frame to the original path, and the instruction frame contains the connection identifier CID of the optimal path new and the session key K session , where the instruction frame type is Frame update : Frame update =<Type = 0x1A, CID new , K session > Among them, CID new is the unique connection identifier of the optimal path, and K session is the TLS session key of the original path; Sub-step 5.2, start transmitting on the optimal path from the last confirmed data packet sequence number Last Acked The starting sequence number Seq of the new path new satisfies: Seq new = Last Acked + 1, Among them, Last Acked is the sequence number of the last confirmed packet by the receiver on the original path, and Seq new is the starting packet sequence number for the new path transmission; Sub-step 5.3, after the optimal path receives the acknowledgment response ACK new from the receiver for Seq new , close the communication connection of the original path, and the closing condition is: T now -T update > 2 × RTT original , Among them, T now is the current system timestamp, and T update is the timestamp for sending the Frame update frame, and RTT original is the average round-trip delay of the original path.

7. A method for processing port tasks of a satellite measurement, operation and control system according to claim 1, characterized in that, In Step 6, continuously monitoring the performance of each path after switching and dynamically adjusting the weight coefficient of the comprehensive score further includes: Sub-step 6.1, periodically collect the updated packet loss rate L new , latency RTT new , bandwidth B new and jitter Jitter new , and generate a performance parameter set P new : P new = {L new , RTT new , B new , Jitter new}, Among them, L new is the real-time packet loss rate of the optimal path after handover, and RTT new is the average round-trip delay of the optimal path after handover, B new is the bandwidth of the optimal path after handover, and Jitter new is the jitter variance of the optimal path after handover; Sub-step 6.2, calculate the weight adjustment amount according to the set of performance parameters P new and the historical transmission data, and update the weight coefficient: γ new = γ old - η·L new , Among them, η is the preset learning rate, B max is the maximum bandwidth among all paths, D max is the preset maximum allowable delay, J max is the preset maximum allowable jitter, α old , β old , γ old , λ old are the current weight coefficients, α new , β new , γ new , λ new are the updated weight coefficients; Sub-step 6.3: Perform normalization constraint on the updated weight coefficient; λ final = 1 - (α final + β final + γ final ), Among them, α final , β final , γ final , λ final are normalized weight coefficients, and α new , β new , γ new , λ new are updated weight coefficients.

8. A port task processing method for a satellite measurement, operation and control system according to claim 1, characterized in that In Step 7, pausing the task queue and recording the breakpoint during the path switching process, and resuming transmission based on the selective acknowledgment mechanism after the switching is completed further includes: Sub-step 7.1, when a path switching instruction is triggered, immediately pause the current task queue and record the breakpoint position Break Point , where the breakpoint position is the sequence number of the last sent but unacknowledged data packet Seq_last: Break Point = max(Seq sent ) - max(Seq acked ), Among them, Seq sent is the set of sequence numbers of data packets sent on the current path, and Seq acked is the set of sequence numbers of data packets that have been confirmed by the receiver; Sub-step 7.2, after establishing a connection on the optimal path, generate a retransmission request list Retrans according to the breakpoint position Break Point List :​ Retrans List = {seq | seq ∈ Seq sent ∧ seq > Break Point}, Where seq is the data packet sequence number; Sub-step 7.3, send the retransmission request list Retrans through the optimal path List , and receive the set of missing packet sequence numbers Missing based on the selective acknowledgment option seq : Missing seq = SACK Blocks ∩Retrans List , Among them, SACK Blocks is the range of continuously received data blocks returned by the receiver; Sub-step 7.4, retransmit the data in the set of missing data packet sequence numbers Missing seq and update the task queue to be: Queue new = Queue old \Missing seq , Among them, Queue old The task queue to be transmitted before switching, Queue new The updated task queue after switching.

9. A terminal device, characterized in that, It includes a processor and a memory. The memory stores a computer program. When the processor executes the computer program, it implements the port task processing method of the satellite measurement, operation, and control system according to any one of claims 1 to 8.

10. A storage medium, characterized in that, The storage medium stores a computer program. When the computer program is executed by a processor, it implements the port task processing method of the satellite measurement, operation, and control system according to any one of claims 1 to 8.

Images