Satellite link acceleration system

Abstract

The invention discloses a system for accelerating a satellite link, which comprises the following steps of: optimizing the data transmission speed by deploying a TCP (Transmission Control Protocol) agent module at a satellite ground station and a terminal; the agent module dynamically adjusts the size of a TCP window according to the link state, and optimizes the data flow; the link performance is monitored in real time, and the system adjusts a TCP proxy strategy and switches the link; the edge calculation module performs data preprocessing, compression, acceleration and optimization, and adopts an optimal algorithm and a flow distribution strategy; when the link quality is deteriorated, the system is automatically switched to a redundancy forward error correction mechanism and cooperatively works with the TCP agent module; end-to-end data encryption is carried out by adopting a quantum encryption technology, so that communication security is ensured; decentralized identity verification is realized by adopting a block chain technology, and identity credibility of communication nodes is ensured; according to the satellite link acceleration system, a flexible and dynamic acceleration mode is adopted, and the data transmission efficiency and stability are improved based on the intelligent proxy technology of the TCP protocol.

Description

Technical Field

[0001] The present invention belongs to the field of satellite link acceleration, and particularly relates to a satellite link acceleration system. Background Art

[0002] A satellite link acceleration system is a technical solution for optimizing the performance of satellite communication networks. Due to the relatively high latency and bandwidth limitations in satellite communication, the purpose of satellite link acceleration is to improve communication efficiency, reduce latency, and enhance transmission speed through a series of technical means, which is particularly important in long-distance or extreme environment communications; by compressing the transmitted data, the required transmission bandwidth is reduced, thereby improving transmission efficiency; by optimizing the data transmission protocol, the data transmission on the satellite link becomes more efficient, reducing the latency impact caused by satellite communication; caching nodes are deployed in the network, and by pre-storing commonly used data, duplicate data transmission is reduced, thereby improving the response speed; by using efficient error correction techniques, the data lost or damaged during transmission can be recovered, improving the reliability of data transmission; through intelligent scheduling and load balancing to optimize the allocation of network resources, reduce congestion, and ensure the stability and efficiency of the communication link.

[0003] However, although the satellite link acceleration system can significantly improve the performance of satellite communication, there are still some defects and challenges. Although low-earth orbit satellites can reduce latency, the existing acceleration methods cannot effectively solve the bottleneck of high latency, especially in high-traffic or complex communication environments. The existing technologies fail to fully utilize the bandwidth of satellite communication links, resulting in low signal transmission efficiency. There are many problems with existing satellite links in terms of high latency and instability. Traditional satellite link acceleration technologies often rely on network layer protocol optimization, such as forward error correction and traffic scheduling, etc., but these methods are difficult to fully address the challenges of high latency and packet loss rate. Summary of the Invention

[0004] Aiming at the deficiencies in the prior art, the purpose of the present invention is to provide a satellite link acceleration system, which adopts a more flexible and dynamic acceleration method, based on the proxy technology of the TCP protocol, and improves the efficiency and stability of data transmission through intelligent proxy connections.

[0005] The technical solution adopted by the present invention to solve its technical problems is:

[0006] A satellite link acceleration system, comprising:

[0007] A TCP proxy module, used to be deployed at the satellite ground station and the terminal, optimizing the TCP connection through the proxy method. The TCP proxy module dynamically adjusts the TCP window size by controlling the data flow and link status information, and optimizes the data transmission speed;

[0008] The link performance evaluation module is used to monitor the latency, bandwidth, and packet loss rate performance metrics of the satellite link in real time, determine whether to adjust the TCP proxy policy based on these metrics, and dynamically switch the link and adjust the proxy method according to the monitoring data;

[0009] The edge computing module is deployed at the satellite ground station and the terminal, and performs data preprocessing, compression, acceleration, and optimization through edge computing. The edge computing module adopts the best compression algorithm and traffic diversion strategy according to the data type and real-time traffic requirements;

[0010] The redundancy mechanism switching module is used to automatically switch the system to the redundant forward error correction mechanism when the link quality deteriorates and the packet loss rate is too high, and work in coordination with the TCP proxy module;

[0011] The quantum encryption module is used to perform end-to-end data encryption using quantum encryption technology during data transmission and ensure the identity authentication of each communication node;

[0012] The blockchain authentication module is used to perform decentralized identity verification on communication nodes through blockchain technology to ensure the identity credibility and security during the communication process.

[0013] Preferably, it is deployed at the satellite ground station and the terminal, and optimizes the TCP connection through the proxy method. The TCP proxy module dynamically adjusts the TCP window size by controlling the data flow and link status information, and optimizes the data transmission speed as follows:

[0014] Set the following parameters:

[0015] RTT: The round-trip time of the link;

[0016] Bandwidth: The bandwidth of the link;

[0017] Window Size: The TCP window size, in bytes;

[0018] Loss Rate: The packet loss rate of the link;

[0019] The TCP window size is calculated based on the bandwidth and RTT, and its basic formula is:

[0020] Window Size(B) = Bandwidth × RTT

[0021] Among them, Bandwidth is the bandwidth of the link;

[0022] RTT is the round-trip time of the link;

[0023] To dynamically optimize TCP connections, the TCP proxy module adjusts the window size in real time according to the status information of the current link, and sets up a dynamic adjustment strategy based on the following formula:

[0024] Window Size adjunsted = Window Size × (1 + α × ΔRTT) × (1 - β × Loss Rate)

[0025] Where Window Size is the initially calculated TCP window size;

[0026] α and β are adjustment factors. α is used to adjust the impact of latency on the window, and β is used to adjust the impact of packet loss rate on the window;

[0027] ΔRTT is the difference between the current RTT and the historical RTT, which is used to reflect the latency fluctuation of the link;

[0028] Loss Rate is the packet loss rate of the link, calculated as the ratio of the number of lost packets to the total number of packets.

[0029] Preferably, the latency, bandwidth, and packet loss rate performance metrics of the satellite link are monitored in real time, and based on these metrics, it is determined whether to adjust the TCP proxy strategy, and the link is dynamically switched and the proxy method is adjusted according to the monitoring data as follows:

[0030] Continuously monitor the following three performance metrics in real time:

[0031] Latency: The round-trip time of the satellite link;

[0032] Bandwidth: The bandwidth of the link;

[0033] Packet Loss Rate: The packet loss rate of the link;

[0034] The following formula is used for real-time monitoring:

[0035]

[0036] Based on the real-time latency, bandwidth, and packet loss rate data, a decision function is set up to determine whether to adjust the TCP proxy strategy. The decision function is:

[0037] Decision = f(RTT, Bandwidth, Loss Rate)

[0038] Where f is a function based on the current link performance, and weighted average, logical judgment, or machine learning model is used to calculate whether to adjust the strategy;

[0039] Linear weighted decision model:

[0040] Decision = w1 × RTT + w2 × LossRate - w3 × Bandwidth

[0041] Where w1, w2, and w3 are the weights of each performance metric;

[0042] If Decision exceeds a certain threshold, the link performance deteriorates and the policy will be adjusted;

[0043] Specific adjustment policies:

[0044] If the delay RTT exceeds the set threshold, the TCP window size will be increased;

[0045] If the packet loss rate Loss Rate is high, the retransmission policy will be adjusted or the error correction mechanism will be added;

[0046] If the bandwidth is low, the window size will be reduced and the data transmission protocol will be optimized;

[0047] When the link performance is poor, switch to another link for optimization. This switching policy is based on the real-time monitoring data of the link and the performance of the current link. The link switching decision formula:

[0048] Switch Decision = g(RTT current ,RTT alt ,Loss Rate current ,Loss Rate alt ,Bandwidth current ,Bandwidth alt )

[0049] Where RTT current ,Loss Rate current ,Bandwidth current are the performance metrics of the current link;

[0050] RTT alt ,Loss Rate alt ,Bandwidth alt are the performance metrics of the alternate link;

[0051] By determining whether Switch Decision exceeds a predetermined threshold, decide whether to switch the link. If Switch Decision exceeds the threshold, switch the link;

[0052] Based on the above parts, the final decision is made through the following comprehensive formula:

[0053] Final Decision = h(Decision, Switch Decision)

[0054] Among them, h is a combined function used to comprehensively judge whether to adjust the proxy policy or switch the link. If the Final Decision is higher than the set threshold, policy adjustment and link switching are executed.

[0055] Preferably, in satellite ground stations and terminals, data preprocessing, compression, acceleration, and optimization are performed through edge computing. The edge computing module adopts the best compression algorithm and traffic diversion strategy according to the data type and real-time traffic requirements as follows:

[0056] The compression algorithm depends on the data type and traffic requirements. The compression algorithms include:

[0057] Lossless compression: used for text or code data;

[0058] Lossy compression: used for audio, video, and image data;

[0059] The compression ratio is calculated by the following formula:

[0060]

[0061] Traffic acceleration and optimization include two operations: traffic control and traffic scheduling. Traffic control involves managing the transmission rate and latency, while traffic scheduling optimizes the data stream by adopting different links or paths;

[0062] Traffic optimization decision formula:

[0063] Optimal Traffic Flow=min(Available Bandwidth,Latency Requirement,Packet Loss Rate)

[0064] The core of the data stream diversion strategy dynamically adopts the best links and paths according to the real-time requirements of the traffic. The diversion strategy is based on the performance of the link, data type, and real-time requirements, and adopts different network paths for parallel or serial transmission;

[0065] The traffic diversion decision is based on the following factors:

[0066] Link bandwidth: determines the transmission rate of the traffic;

[0067] Link latency: affects the response time of real-time applications;

[0068] Link packet loss rate: determines the reliability of data transmission;

[0069] Data type: different data types adopt different transmission strategies;

[0070] Real-time requirements: Real-time traffic requires lower latency and higher stability;

[0071] The dynamic traffic splitting formula is expressed as:

[0072]

[0073] Among them, f is a decision function used to select the optimal link;

[0074] Based on the real-time changes in link performance and data transmission requirements, the system uses the link for data splitting based on the following decision function:

[0075]

[0076] Among them, α, β, and γ are parameters that control the influence of delay, bandwidth, and packet loss rate on link selection;

[0077] Combining data compression and traffic splitting, the edge computing module is optimized based on the following comprehensive formula:

[0078] Optimization Decision=min(Compression Cost+Transmission Cost+FlowDistribution Cost)

[0079] Among them, Compression Cost: The computing and latency costs during the data compression process;

[0080] Transmission Cost: The bandwidth occupancy and latency generated during the data transmission process;

[0081] Flow Distribution Cost: The comprehensive cost of using the link during the traffic splitting process.

[0082] Preferably, when the link quality deteriorates and the packet loss rate is too high, the system automatically switches to the redundant forward error correction mechanism and works in coordination with the TCP proxy module as follows:

[0083] The TCP proxy module is used to optimize the transmission efficiency of the TCP protocol. The TCP proxy module optimizes the data transmission efficiency through TCP acceleration, alleviating TCP header overhead, merging small packets, and congestion control methods;

[0084] When the system detects that the packet loss rate is too high, the TCP proxy module works in coordination with the FEC mechanism to improve the robustness of data transmission through the following strategies:

[0085] FEC enabled: When the packet loss rate exceeds the threshold, the system automatically enables FEC;

[0086] TCP Collaboration with FEC: The TCP proxy module makes dynamic adjustments according to the network conditions, adopts a retransmission mechanism or reduces the number of TCP retransmissions, and at the same time adopts FEC to reduce the impact of packet loss;

[0087] The system is set to switch to FEC when the packet loss rate is high and cooperate with the TCP proxy module. The following are the relevant calculation formulas:

[0088] When the packet loss rate exceeds a certain threshold (θ loss ), the system switches to the redundant forward error correction mechanism:

[0089] If PLR>θ loss , switch to FEC mode.

[0090] Among them, θ loss is the packet loss rate threshold set by the system;

[0091] The coding rate and redundancy of FEC are measured by the coding efficiency. The redundancy (r fcc ) of Reed-Solomon coding is adopted according to the packet loss rate of the link and the required recovery ability. The calculation formula for the redundancy of FEC is:

[0092]

[0093] The task of the TCP proxy module is to adjust the TCP transmission parameters according to the link quality. When FEC is enabled, the TCP proxy optimizes the ACK and retransmission mechanisms. The relevant formulas for adjustment by the TCP proxy module are as follows:

[0094]

[0095] Among them, Max Retransmits is the maximum number of retransmissions, and θ loss is the packet loss rate threshold;

[0096] The TCP proxy module dynamically adjusts the TCP window size according to the packet loss rate and link quality:

[0097] TCP Window Size = Base Window Size × (1 - PLR)

[0098] Among them, Base Window Size is the base window size, and PLR is the packet loss rate;

[0099] When the packet loss rate exceeds the threshold, the system makes the following comprehensive optimization decisions to balance the cooperation between FEC and the TCP proxy module:

[0101]

[0102] Preferably, during data transmission, quantum encryption technology is adopted for end-to-end data encryption, and the identity authentication of each communication node is ensured as follows:

[0103] The BB84 protocol is a quantum key distribution protocol used to securely exchange keys over an insecure channel. The two communicating parties share an encryption key through the transmission of quantum bits. The following are the steps of the BB84 protocol:

[0104] Quantum bit preparation: Alice generates quantum bits and randomly selects a basis state;

[0105] Quantum bit transmission: Alice sends the quantum bits to Bob through an insecure quantum channel;

[0106] Basis state selection and measurement: After receiving the quantum bits, Bob randomly selects a measurement basis state and performs a measurement;

[0107] Public discussion and screening: Alice and Bob announce the basis states they used and retain the quantum bits with the same basis states;

[0108] In end-to-end encryption, the shared key generated by quantum key distribution is used to encrypt data through a classical symmetric encryption algorithm. The encryption and decryption formulas are as follows:

[0109] Encryption process:

[0110] C = E(K, M)

[0111] where C is the ciphertext, E(K, M) is the encryption function, K is the shared key, and M is the plaintext;

[0112] Decryption process:

[0113] M = D(K, C)

[0114] where M is the decrypted plaintext, D(K, C) is the decryption function, K is the shared key, and C is the ciphertext;

[0115] To ensure the identity authentication of each communication node, a combination of quantum encryption technology and traditional public key infrastructure is used for authentication. The identity authentication of nodes is double-protected by quantum encryption. Combining digital signature and quantum certificate mechanisms, the process of identity authentication includes the following steps:

[0116] Each communication node generates its own public key (PK node ) and private key (SK node );

[0117] The node signs using a quantum key, generates a quantum certificate, and transmits it through a quantum channel;

[0118] The receiving party ensures the identity of the sending node by verifying the validity of the quantum certificate. If the node identities match, further communication is carried out; otherwise, the connection is refused.

[0119] The sender encrypts the message using the public key of the receiving party:

[0120] C = E(PK receiver , M)

[0121] where C is the encrypted message, PK receiver is the public key of the receiving party, and M is the message;

[0122] The sender digitally signs the message using its private key:

[0123] S = Sign(SK sender , M)

[0124] where S is the signature, SK sender is the private key of the sender, and M is the message;

[0125] The receiving party verifies the validity of the signature using the public key of the sender:

[0126] Verify(PK sender , M, S)

[0127] If the verification is successful, the receiving party accepts the message; otherwise, it rejects it.

[0128] Combining quantum encryption and identity authentication, the overall communication process is represented by the following secure communication model:

[0129] Secure Communication = [QKD → E(K, M) → D(K, C)] ∩ [Sign(SK sender , M) → Verify(PK sender , M, S)]

[0130] where QKD represents the quantum key distribution process, E(K, M) is encryption, D(K, C) is decryption, Sign and Verify are the digital signature and signature verification processes respectively.

[0131] Preferably, blockchain technology is used to perform decentralized identity authentication on communication nodes to ensure the identity credibility and security during the communication process:

[0132] When each communication node joins the blockchain, a pair of public and private keys is generated. The node identity is bound to the public key through decentralized identity and registered on the blockchain;

[0133] Node identity generation:

[0134] The node generates the public key PKnode and the private key SK node ;

[0135] The decentralized identifier of a node is generated from the public key PK node and recorded on the blockchain:

[0136] DID = Hash(PK node )

[0137] where Hash is a hash function;

[0138] The node registers its public key, identity information, and other relevant data on the blockchain, ensuring decentralization and immutability through smart contracts;

[0139] The node records the public key information and identity information on the blockchain through a transaction:

[0140] Transaction = {DID, PK node , Other Info}

[0141] When sending a message, the node uses the private key SK node to digitally sign the message. The recipient verifies the identity through the public key on the blockchain. The sender uses the private key SK node to sign the message M:

[0142] S = Sign(SK node , M)

[0143] where S is the message signature;

[0144] The recipient uses the public key PK node publicly available on the blockchain to verify the validity of the signature:

[0145] Verify(PK node , M, S)

[0146] The smart contract executes the identity verification logic on the blockchain. To verify whether a certain node has a legal identity and the permission to participate in communication, the smart contract verifies the existence of the node's DID and confirms that its public key is consistent with the record on the blockchain to verify the node's identity:

[0147]

[0148] If it returns True, it means the node identity is valid and the communication continues. If it returns False, the communication is rejected.

[0149] Another technical problem to be solved by the present invention is to provide an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, a system for accelerating satellite links as described in any one of the above is implemented.

[0150] Another technical problem to be solved by the present invention is to provide a computer-readable storage medium with a computer program stored thereon. When the program is executed by a processor, a system for accelerating satellite links is implemented.

[0151] The beneficial effects of the present invention are as follows:

[0152] The TCP proxy module optimizes the transmission efficiency of the satellite link by dynamically adjusting the TCP window size and controlling the data flow. By adjusting the window size in real time, the proxy module can maximize the utilization rate of the link and improve the data transmission speed, especially when the link state changes. The link performance evaluation module monitors performance indicators such as latency, bandwidth, and packet loss rate of the link in real time and can dynamically adjust the TCP proxy strategy according to these indicators. The edge computing module is deployed at the satellite ground station and the terminal and can perform preprocessing, compression, and optimization at the data generation location or on the transmission path. The redundancy mechanism switching module ensures that the system can automatically switch to the redundant forward error correction mechanism when the link quality deteriorates, which is particularly important for satellite communication because satellite links are vulnerable to factors such as weather and environmental changes. The quantum encryption module provides end-to-end data encryption and uses quantum encryption technology to ensure the security of the transmitted data. The blockchain authentication module ensures the credibility of the identity of each communication node through a decentralized authentication mechanism. By combining multiple technical modules, this solution achieves end-to-end performance optimization and comprehensively improves in multiple aspects such as link performance, data transmission efficiency, security, link reliability, and authentication. The independence and flexible configuration of each module enable the system to be customized according to different application scenarios. Adjust the redundancy mechanism, compression algorithm, or encryption strategy according to the actual communication requirements or link conditions to improve the overall adaptability and flexibility. BRIEF DESCRIPTION OF THE DRAWINGS

[0153] Figure 1 It is a schematic diagram of the system process for accelerating satellite links of the present invention. DETAILED DESCRIPTION OF THE INVENTION

[0154] The principles and features of the present invention are described below. The examples given are only used to explain the present invention and are not intended to limit the scope of the present invention. The present invention will be described more specifically by way of example in the following paragraphs. The advantages and features of the present invention will be clearer according to the following description and the claims.

[0155] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the technical field to which this invention belongs. The terms used in the specification of this invention are for the purpose of describing specific embodiments only and are not intended to limit the invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.

[0156] Embodiment

[0157] The technical solution adopted by the present invention to solve its technical problems is as follows:

[0158] A satellite link acceleration system, comprising:

[0159] A TCP proxy module, which is used to be deployed at the satellite ground station and the terminal, optimize the TCP connection through the proxy method. The TCP proxy module dynamically adjusts the TCP window size by controlling the data flow and link status information to optimize the data transmission speed;

[0160] A link performance evaluation module, which is used to monitor the delay, bandwidth, and packet loss rate performance indicators of the satellite link in real time, judge whether to adjust the TCP proxy policy according to these indicators, and dynamically switch the link and adjust the proxy method according to the monitoring data;

[0161] An edge computing module, which is used to be deployed at the satellite ground station and the terminal, perform data preprocessing, compression, acceleration, and optimization through edge computing. The edge computing module adopts the best compression algorithm and traffic shunting strategy according to the data type and real-time traffic demand;

[0162] A redundancy mechanism switching module, which is used to automatically switch to the redundancy forward error correction mechanism when the link quality deteriorates and the packet loss rate is too high, and cooperate with the TCP proxy module;

[0163] A quantum encryption module, which is used to perform end-to-end data encryption using quantum encryption technology during the data transmission process and ensure the identity authentication of each communication node;

[0164] A blockchain authentication module, which is used to perform decentralized identity verification on communication nodes through blockchain technology to ensure the identity credibility and security during the communication process.

[0165] The TCP proxy module dynamically adjusts the TCP window size and flow control strategy by controlling the data stream and link status information, maximizing the performance of the TCP protocol in a high-latency and low-bandwidth environment such as a satellite link; the link performance evaluation module monitors key performance indicators such as latency, bandwidth, and packet loss rate of the satellite link in real time and determines whether to adjust the TCP proxy strategy based on this data; the edge computing module is deployed at the satellite ground station and the terminal to perform preprocessing, compression, and acceleration of data; the redundant mechanism switching module automatically switches to the redundant forward error correction (FEC) mechanism when the link quality deteriorates or the packet loss rate is too high to ensure that data can be successfully transmitted even in the case of packet loss or signal attenuation; the quantum encryption module encrypts data end-to-end through quantum encryption technology to ensure the confidentiality and security of data during the entire transmission process; the blockchain authentication module authenticates the communication nodes in a decentralized manner through blockchain technology to ensure the authenticity of identity and trustworthiness during the communication process; through the close cooperation and functional collaboration of each module, the system can improve the performance of the satellite link in multiple aspects.

[0166] Deployed at the satellite ground station and the terminal, the TCP proxy module optimizes TCP connections through proxy. By controlling the data stream and link status information, it dynamically adjusts the TCP window size to optimize the data transmission speed as follows:

[0167] Set the following parameters:

[0168] RTT: The round-trip time of the link;

[0169] Bandwidth: The bandwidth of the link;

[0170] Window Size: The TCP window size, in bytes;

[0171] Loss Rate: The packet loss rate of the link;

[0172] The TCP window size is calculated based on the bandwidth and RTT, and its basic formula is:

[0173] Window Size(B) = Bandwidth × RTT

[0174] where Bandwidth is the bandwidth of the link;

[0175] RTT is the round-trip time of the link;

[0176] To dynamically optimize the TCP connection, the TCP proxy module adjusts the window size in real time according to the current link status information and sets a dynamic adjustment strategy based on the following formula:

[0177] Window Size adjusted= Window Size × (1 + α × △RTT) × (1 - β × Loss Rate)

[0178] Wherein, Window Size is the initially calculated TCP window size;

[0179] α and β are adjustment factors. α is used to adjust the impact of latency on the window, and β is used to adjust the impact of packet loss rate on the window;

[0180] ΔRTT is the difference between the current RTT and the historical RTT, which is used to reflect the latency fluctuation of the link;

[0181] Loss Rate is the packet loss rate of the link, and its calculation method is the ratio of the number of lost data packets to the total number of data packets.

[0182] By dynamically adjusting according to bandwidth, latency, and packet loss rate, the TCP connection is optimized, bandwidth waste is avoided, and the data transmission speed is increased. This is particularly important in the case of high latency and instability of satellite links; satellite links often experience bandwidth fluctuations, latency changes, or packet loss rate changes. This solution can dynamically adjust the window size according to these changes to adapt to network fluctuations and avoid excessive congestion or overly long latency; by reducing packet loss, reducing retransmissions and congestion caused by packet loss, the reliability of communication can be significantly improved, and link interruptions can be reduced; by dynamically adjusting the window size, the performance degradation in high-latency situations can be alleviated, ensuring that data transmission is as efficient as possible; when the packet loss rate is high, adjusting the TCP window size helps to reduce the chance of data loss and retransmission, thereby increasing the success rate of data transmission.

[0183] Real-time monitor the latency, bandwidth, and packet loss rate performance metrics of the satellite link, and judge whether to adjust the TCP proxy strategy based on these metrics. And dynamically switch the link and adjust the proxy method according to the monitoring data as follows:

[0184] Continuously and real-time monitor the following three performance metrics:

[0185] Latency: The round-trip time of the satellite link;

[0186] Bandwidth: The bandwidth of the link;

[0187] Packet loss rate: The packet loss rate of the link;

[0188] Use the following formula for real-time monitoring:

[0189]

[0190] Based on the real-time latency, bandwidth, and packet loss rate data, establish a decision function to judge and identify whether to adjust the TCP proxy strategy. The decision function is:

[0191] Decision = f(RTT, Bandwidth, Loss Rate)

[0192] Among them, f is a function based on the current link performance, and weighted average, logical judgment, or machine learning model is used to calculate whether to adjust the strategy;

[0193] Linear weighted decision model:

[0194] Decision = w1 × RTT + w2 × Loss Rate - w3 × Bandwidth

[0195] Among them, w1, w2, and w3 are the weights of each performance index;

[0196] If Decision exceeds a certain threshold, the link performance deteriorates and the strategy will be adjusted;

[0197] Specific adjustment strategies:

[0198] If the delay RTT exceeds the set threshold, the TCP window size will be increased;

[0199] If the packet loss rate Loss Rate is high, the retransmission strategy will be adjusted or the error correction mechanism will be increased;

[0200] If the bandwidth is low, the window size will be reduced and the data transmission protocol will be optimized;

[0201] When the link performance is poor, switch to another link for optimization. This switching strategy is based on the real-time monitoring data of the link and the performance of the current link. Link switching decision formula:

[0202] Switch Decision = g(RTT current , RTT alt , Loss Rate current , Loss Rate alt , Bandwidth current , Bandwidth alt )

[0203] Among them, RTT current , Loss Rate current , Bandwidth current are the performance indicators of the current link;

[0204] RTT alt , Loss Rate alt , Bandwidth alt are the performance indicators of the alternate link;

[0205] By determining whether the Switch Decision exceeds a predetermined threshold, decide whether to switch the link. If the Switch Decision exceeds the threshold, then switch the link;

[0206] Based on the above-mentioned parts, the final decision is made through the following comprehensive formula:

[0207] Final Decision = h(Decision, Switch Decision)

[0208] where h is a combination function used to comprehensively judge and identify whether to adjust the proxy policy or switch the link. If the Final Decision is higher than the set threshold, then perform policy adjustment and link switching.

[0209] Through real-time monitoring and dynamic adjustment, it can quickly adapt to changes in link performance and avoid performance degradation in environments with high latency, low bandwidth, and high packet loss; through timely policy adjustment, especially in cases where latency and bandwidth are limited, it can maximize the data transmission rate and avoid performance bottlenecks caused by overly large windows or high packet loss rates; for cases of link packet loss or latency fluctuations, the solution improves the reliability of data transmission by adjusting the retransmission policy, introducing error correction mechanisms, etc., and reduces errors and packet loss caused by network fluctuations; by real-time evaluating the performance of the current link and the standby link, this solution can smoothly switch the link when the link quality is poor, ensure uninterrupted communication, and further improve the reliability and stability of the system; by means of increasing the TCP window, adjusting the impact of bandwidth and latency on the window, etc., it can reduce the number of TCP retransmissions in a high-latency environment, thereby reducing latency and congestion and improving the transmission efficiency of satellite communication; this solution makes decisions based on various link conditions (such as bandwidth, latency, and packet loss rate), enabling the network to maintain high elasticity in different environments, optimizing resource utilization, and improving the working efficiency of satellite links.

[0210] In the deployment of satellite ground stations and terminals, through edge computing for data preprocessing, compression, acceleration, and optimization, the edge computing module, according to the data type and real-time traffic demand, adopts the best compression algorithm and traffic diversion strategy as follows:

[0211] The compression algorithm depends on the data type and traffic demand. The compression algorithms include:

[0212] Lossless compression: used for text or code data;

[0213] Lossy compression: used for audio, video, and image data;

[0214] The compression ratio is calculated by the following formula:

[0215]

[0216] Traffic acceleration and optimization include two operations: traffic control and traffic scheduling. Traffic control involves managing the transmission rate and latency, while traffic scheduling optimizes the data flow by adopting different links or paths;

[0217] Traffic optimization decision formula:

[0218] Optimal Traffic Flow = min(Available Bandwidth, Latency Requirement, Packet Loss Rate)

[0219] The core of the data flow splitting strategy dynamically adopts the best links and paths according to the real-time requirements of the traffic. The splitting strategy is based on the performance of the links, the data type, and the real-time requirements, and uses different network paths for parallel or serial transmission;

[0220] The basis for traffic splitting decisions includes the following factors:

[0221] Link bandwidth: Determines the transmission rate of the traffic;

[0222] Link latency: Affects the response time of real-time applications;

[0223] Link packet loss rate: Determines the reliability of data transmission;

[0224] Data type: Different data types adopt different transmission strategies;

[0225] Real-time requirements: Real-time traffic requires lower latency and higher stability;

[0226] The dynamic traffic splitting formula is expressed as:

[0227]

[0228] where f is a decision function used to select the optimal link;

[0229] Based on the real-time changes in link performance and data transmission requirements, the system uses the link for data splitting according to the following decision function:

[0230]

[0231] where α, β, and γ are parameters that control the influence of latency, bandwidth, and packet loss rate on link selection;

[0232] Combined with data compression and traffic splitting, the edge computing module is optimized based on the following comprehensive formula:

[0233] Optimization Decision = min(Compression Cost + Transmission Cost + Flow Distribution Cost)

[0234] Among them, Compression Cost: The computational and latency costs during the data compression process;

[0235] Transmission Cost: The bandwidth occupancy and latency generated during the data transmission process;

[0236] Flow Distribution Cost: The comprehensive cost of the links adopted during the traffic shunting process.

[0237] Based on the rapid identification of data types and real-time traffic by the edge computing module, select the most suitable compression strategy to minimize the data volume, relieve the satellite link load, and reduce latency; comprehensively consider the link status and data characteristics, use intelligent functions for path selection, achieve optimal path transmission under limited resources, ensure the priority of real-time services, and improve the overall transmission efficiency and link utilization rate; select different links to concurrently transmit different data types through the shunting function to adapt to multi-service concurrency, relieve the pressure on a single link, and improve the disaster tolerance ability and system robustness; through the cost optimization model of the entire link, dynamically balance the compression cost, transmission efficiency, and link switching cost, achieve the optimal compromise between performance and resource consumption, and improve the overall cost performance of the system; the edge computing module independently executes compression, shunting, acceleration, and policy decision-making, reduces the dependence on the central node, and improves the response speed and autonomy of the system.

[0238] When the link quality deteriorates and the packet loss rate is too high, the system automatically switches to the redundant forward error correction mechanism and works in coordination with the TCP proxy module as follows:

[0239] The TCP proxy module is used to optimize the transmission efficiency of the TCP protocol. The TCP proxy module optimizes the data transmission efficiency through TCP acceleration, relieving TCP header overhead, merging small packets, and congestion control methods;

[0240] When the system detects that the packet loss rate is too high, the TCP proxy module works in coordination with the FEC mechanism to improve the robustness of data transmission through the following strategies:

[0241] FEC enabled: When the packet loss rate exceeds the threshold, the system automatically enables FEC;

[0242] TCP and FEC cooperation: The TCP proxy module makes dynamic adjustments according to the network conditions, adopts a retransmission mechanism or reduces the number of TCP retransmissions, and at the same time adopts FEC to reduce the impact of packet loss;

[0243] The system is set to perform FEC switching when the packet loss rate is high and cooperate with the TCP proxy module. The following are the relevant calculation formulas:

[0244] When the packet loss rate exceeds a certain threshold (θ loss ), the system switches to the redundant forward error correction mechanism:

[0245] If PLR>θ loss , switch to FEC mode.

[0246] Among them, θ loss is the packet loss rate threshold set by the system;

[0247] The coding rate and redundancy of FEC are measured by the coding efficiency. The redundancy (r fcc ) of Reed - Solomon coding is adopted according to the packet loss rate of the link and the required recovery ability. The calculation formula for the redundancy of FEC is:

[0248]

[0249] The task of the TCP proxy module is to adjust the TCP transmission parameters according to the link quality. When FEC is enabled, the TCP proxy optimizes the ACK and retransmission mechanisms. The relevant formulas adjusted by the TCP proxy module are as follows:

[0250]

[0251] Among them, Max Retransmits is the maximum number of retransmissions, and θ loss is the packet loss rate threshold;

[0252] The TCP proxy module dynamically adjusts the TCP window size according to the packet loss rate and link quality:

[0253] TCP Window Size = Base Window Size × (1 - PLR)

[0254] Among them, Base Window Size is the base window size, and PLR is the packet loss rate;

[0255] When the packet loss rate exceeds the threshold, the system makes the following comprehensive optimization decisions to balance the cooperation between FEC and the TCP proxy module:

[0256]

[0257] FEC realizes the recovery of lost data by adding redundant data, avoiding transmission interruptions caused by packet loss, ensuring data integrity, and enhancing the robustness of the system when the link quality is poor or the packet loss rate is high; the TCP proxy module accelerates the TCP protocol, reduces protocol overhead, dynamically adjusts retransmission and window strategies, avoids congestion, improves transmission speed, enhances the transmission performance of the TCP protocol in high packet loss and unstable links, and reduces latency and bandwidth occupancy; the collaborative work of FEC and the TCP proxy module achieves effective recovery of packet loss and improvement of transmission efficiency. This collaborative mechanism can dynamically balance redundancy and retransmission in different packet loss scenarios, and improve the stability and efficiency of overall data transmission through joint optimization; through real-time monitoring of the packet loss rate and link quality, the system can automatically switch to the mechanism most suitable for the current network condition, adaptively adjust according to the actual network condition, and ensure stable and efficient transmission under various link qualities; optimizing the FEC redundancy and the number of TCP retransmissions effectively reduces bandwidth occupancy and computing resource consumption. By finely controlling the transmission mechanism, unnecessary data transmission is reduced, and the overall cost performance of the system is improved.

[0258] During the data transmission process, quantum encryption technology is used for end-to-end data encryption, and the identity authentication of each communication node is ensured as:

[0259] The BB84 protocol is a quantum key distribution protocol used to securely exchange keys over an insecure channel. The two communicating parties share an encryption key through the transmission of quantum bits. The following are the steps of the BB84 protocol:

[0260] Quantum bit preparation: Alice generates quantum bits and randomly selects a basis state;

[0261] Quantum bit transmission: Alice sends the quantum bits to Bob through an insecure quantum channel;

[0262] Basis state selection and measurement: After receiving the quantum bits, Bob randomly selects a measurement basis state and performs a measurement;

[0263] Public discussion and screening: Alice and Bob announce the basis states they used and retain the quantum bits with the same basis state;

[0264] In end-to-end encryption, the shared key generated by quantum key distribution is used to encrypt data through a classical symmetric encryption algorithm. The encryption and decryption formulas are as follows:

[0265] Encryption process:

[0266] C = E(K, M)

[0267] Where C is the ciphertext, E(K, M) is the encryption function, K is the shared key, and M is the plaintext;

[0268] Decryption process:

[0269] M = D(K, C)

[0270] Where M is the decrypted plaintext, D(K, C) is the decryption function, K is the shared key, and C is the ciphertext;

[0271] Ensure the identity authentication of each communication node. Combine quantum encryption technology with traditional public key infrastructure for authentication. The node identity authentication is double-protected by quantum encryption. Combine digital signature and quantum certificate mechanism. The process of identity authentication includes the following steps:

[0272] Each communication node generates its own public key (PK node ) and private key (SK node );

[0273] The node signs using a quantum key, generates a quantum certificate, and transmits it through a quantum channel;

[0274] The receiving party ensures the identity of the sending node by verifying the validity of the quantum certificate. If the node identities match, further communication is carried out; otherwise, the connection is refused;

[0275] The sender encrypts the message using the public key of the receiving party:

[0276] C = E(PK receiver , M)

[0277] Where C is the encrypted message, PK receiver is the public key of the receiving party, and M is the message;

[0278] The sender uses its private key to digitally sign the message:

[0279] S = Sign(SK sender , M)

[0280] Where S is the signature, SK sender is the private key of the sender, and M is the message;

[0281] The receiving party verifies the validity of the signature using the public key of the sender:

[0282] Verify(PK sender , M, S)

[0283] If the verification is successful, the receiving party accepts the message; otherwise, it rejects it;

[0284] Combining quantum encryption and identity authentication, the overall communication process is represented by the following secure communication model:

[0285] Secure Communication = [QKD → E(K, M) → D(K, C)] ∩ [Sign(SK sender , M) → Verify(PK sender , M, S)]

[0286] Among them, QKD represents the quantum key distribution process, E(K, M) is encryption, D(K, C) is decryption, Sign and Verify are the digital signature and signature verification processes respectively.

[0287] Quantum key distribution ensures the security of the key through the no-cloning theorem of quantum mechanics, providing stronger security than traditional encryption methods, especially suitable for combating the potential threats brought by future quantum computing; combining quantum keys and digital signatures, a dual authentication mechanism is adopted. Quantum keys guarantee the security of key exchange, and digital signatures ensure the authenticity of the message source, providing higher security than traditional public key infrastructure, preventing man-in-the-middle attacks and identity forgery; encrypting and decrypting data with quantum keys ensures that data confidentiality can still be maintained even in an insecure channel during data transmission, ensuring that data is not interfered by any third party during the transmission process. At the same time, combining classical encryption algorithms makes the encryption and decryption processes efficient and stable. Quantum encryption uses the characteristics of quantum mechanics to achieve key exchange and resist cracking attacks by classical computers or quantum computers. In the case where future quantum computing becomes a reality, traditional encryption methods may become invalid, while quantum encryption schemes still maintain strong security; the scheme integrates quantum key distribution, symmetric encryption, digital signature and authentication, providing a complete set of secure communication mechanisms. From key exchange to message passing, and then to identity authentication, the entire process is protected by multiple layers, ensuring the integrity, confidentiality and reliability of communication.

[0288] Using blockchain technology for decentralized authentication of communication nodes to ensure the credibility and security of identities in the communication process:

[0289] When each communication node joins the blockchain, a pair of public key and private key is generated. The node identity is bound to the public key through decentralized identity and registered on the blockchain;

[0290] Node identity generation:

[0291] The node generates public key PK node and private key SK node ;

[0292] The decentralized identifier of the node is generated by public key PK node and recorded on the blockchain:

[0293] DID = Hash(PK node )

[0294] Among them, Hash is a hash function;

[0295] The node registers its public key, identity information, and other relevant data on the blockchain, ensuring decentralization and immutability through a smart contract;

[0296] The node records the public key information and identity information on the blockchain through a transaction:

[0297] Transaction = {DID, PK node , Other Info}

[0298] When sending a message, the node uses the private key SK node to digitally sign the message. The receiving party verifies the identity through the public key on the blockchain. The sending party uses the private key SK node to sign the message M:

[0299] S = Sign(SK node , M)

[0300] Among them, S is the message signature;

[0301] The receiving party uses the public key PK node publicly available on the blockchain to verify the validity of the signature:

[0302] Verify(PK node , M, S)

[0303] The smart contract executes the identity verification logic on the blockchain. If it verifies whether a certain node has a legal identity and the permission to participate in communication, the smart contract verifies the identity of the node by verifying whether the DID of the node exists and confirming that its public key is consistent with the record on the blockchain:

[0304]

[0305] If it returns True, it means the node identity is valid and the communication continues. If it returns False, the communication is rejected.

[0306] Through the decentralized feature of the blockchain, each communication node has a unique DID, which is bound to the identity through the public key. The decentralized identity authentication mechanism can effectively prevent identity forgery, fraud, and man-in-the-middle attacks, and avoid the single-point failure risk of the centralized identity authentication system. Once the public key and identity information of the node are registered on the blockchain, they are recorded as immutable information, ensuring the integrity and immutability of the identity information and increasing the credibility of identity authentication. The node uses the private key to digitally sign the message, and the recipient verifies the validity of the signature through the public key, providing an efficient and secure message transmission process to ensure the integrity and reliability of the data. The smart contract automatically executes the identity authentication logic on the blockchain to ensure the legality and authorization status of each node's identity. The smart contract completes the verification process by querying the DID and public key on the blockchain. The automated identity authentication process reduces manual intervention, ensuring accurate and efficient identity authentication during the communication process. Through the decentralized storage and smart contract verification mechanism of the blockchain, the entire communication process, from node identity to message content, is tightly protected against data tampering and malicious attacks, making the communication process more tamper-resistant and secure, especially suitable for scenarios with high security requirements, such as finance, government, and healthcare. Since the node identity is verified through the blockchain, and message signing and public key verification both ensure the authenticity of the message source, the system can effectively prevent man-in-the-middle attacks. In traditional communication protocols, man-in-the-middle attacks are a common threat, and this solution effectively avoids such attacks through the decentralized identity authentication and signature verification mechanism.

[0307] This embodiment also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, it implements a satellite link acceleration system as described above.

[0308] This embodiment also provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by the processor, it implements a satellite link acceleration system as described above.

[0309] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, storage, database, or other medium used in the embodiments provided in the present application can include non-volatile and / or volatile memories. Non-volatile memories can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memories can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and Rambus dynamic RAM (RDRAM), etc.

[0310] Those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of each functional unit and module is used as an example. In actual applications, the above functions can be allocated to different functional units and modules as needed, that is, the internal structure of the system can be divided into different functional units or modules to complete all or part of the functions described above.

[0311] The above embodiments of the present invention do not limit the protection scope of the present invention. The embodiments of the present invention are not limited to this. All such modifications, substitutions, or changes made to the above structure of the present invention in various other forms according to the above content of the present invention, in accordance with the common general knowledge and conventional means in the art, without departing from the above basic technical idea of the present invention, shall fall within the protection scope of the present invention.

Claims

1. A satellite link acceleration system, characterized in that, It includes: A TCP proxy module, which is used to be deployed at the satellite ground station and the terminal, and optimizes the TCP connection through the proxy method. The TCP proxy module dynamically adjusts the TCP window size by controlling the data flow and link state information to optimize the data transmission speed; A link performance evaluation module, which is used to monitor the performance indicators of the satellite link such as latency, bandwidth, and packet loss rate in real time, and determines whether to adjust the TCP proxy policy based on these indicators, and dynamically switches the link and adjusts the proxy method according to the monitoring data; An edge computing module, which is used to be deployed at the satellite ground station and the terminal, and performs data preprocessing, compression, acceleration, and optimization through edge computing. The edge computing module adopts the best compression algorithm and traffic shunting strategy according to the data type and real-time traffic requirements; A redundant mechanism switching module, which is used to automatically switch to the redundant forward error correction mechanism when the link quality deteriorates and the packet loss rate is too high, and works in coordination with the TCP proxy module; A quantum encryption module, which is used to perform end-to-end data encryption using quantum encryption technology during the data transmission process, and ensure the identity authentication of each communication node; A blockchain authentication module, which is used to perform decentralized identity verification on the communication nodes through blockchain technology to ensure the identity credibility and security during the communication process.

2. The satellite link acceleration system according to claim 1, wherein Deployed at the satellite ground station and the terminal, and optimizes the TCP connection through the proxy method. The TCP proxy module dynamically adjusts the TCP window size by controlling the data flow and link state information. The optimization of the data transmission speed is as follows: Set the following parameters: RTT: The round-trip time of the link; Bandwidth: The bandwidth of the link; Window Size: The TCP window size, in bytes; Loss Rate: The packet loss rate of the link; The TCP window size is calculated according to the bandwidth and RTT, and its basic formula is: Window Size(R) = Bandwidth × RTT where Bandwidth is the bandwidth of the link; RTT is the round-trip time of the link; To dynamically optimize the TCP connection, the TCP proxy module adjusts the window size in real time according to the current link state information, and sets a dynamic adjustment strategy based on the following formula: Window Size adjusted = Window Size × (1 + α × ΔRTT) × (1 - β × Loss Rate) where Window Size is the initially calculated TCP window size; α and β are adjustment factors. α is used to adjust the influence of latency on the window, and β is used to adjust the influence of packet loss rate on the window; ΔRTT is the difference between the current RTT and the historical RTT, which is used to reflect the latency fluctuation of the link; Loss Rate is the packet loss rate of the link, and the calculation method is the ratio of the number of lost packets to the total number of packets.

3. The system for satellite link acceleration according to claim 2, wherein Real-time monitoring of the performance indicators of the satellite link such as latency, bandwidth, and packet loss rate, and determining whether to adjust the TCP proxy policy based on these indicators, and dynamically switching the link and adjusting the proxy method is as follows: Continuously monitor the following three performance indicators in real time: Latency: The round-trip time of the satellite link; Bandwidth: The bandwidth of the link; Packet loss rate: The packet loss rate of the link; The following formula is used for real-time monitoring: Based on real-time data of latency, bandwidth, and packet loss rate, a decision function is established to determine whether to adjust the TCP proxy policy. The decision function is: Decision = f(RTT, Bandwidth, Loss Rate) where f is a function based on the current link performance, and weighted average, logical judgment, or machine learning model is used to calculate whether to adjust the policy; Linear weighted decision model: Decision = w1 × RTT + w2 × Loss Rate - w3 × Bandwidth where w1, w2, and w3 are the weights of each performance metric; If Decision exceeds a certain threshold, the link performance deteriorates and the policy will be adjusted; Specific adjustment policies: If the latency RTT exceeds the set threshold, the TCP window size will be increased; If the packet loss rate Loss Rate is high, the retransmission policy will be adjusted or the error correction mechanism will be increased; If the bandwidth is low, the window size will be reduced and the data transmission protocol will be optimized; When the link performance is poor, switch to another link for optimization. This switching policy is based on the real-time monitoring data of the link and the performance of the current link. The link switching decision formula: Switch Decision=g(RTT current ,RTT alt ,Loss Rate current ,Loss Rate alt ,Bandwidth current ,Bandwidth alt ) Among them, RTT current , Loss Rate current , Bandwidth current are the performance metrics of the current link; RTT alt , Loss Rate alt , Bandwidth alt are performance metrics for the backup link; By judging whether Switch Decision exceeds a predetermined threshold, decide whether to switch the link. If Switch Decision exceeds the threshold, switch the link; Based on the above content, the final decision is made through the following comprehensive formula: Final Decision = h(Decision, Switch Decision) where h is a combined function used to comprehensively judge whether to adjust the proxy policy or switch the link. If Final Decision is higher than the set threshold, perform policy adjustment and link switching.

4. The satellite link acceleration system according to claim 3, wherein In the satellite ground station and terminal deployment, data preprocessing, compression, acceleration, and optimization are performed through edge computing. The edge computing module adopts the best compression algorithm and traffic diversion strategy according to the data type and real-time traffic demand: The compression algorithm depends on the data type and traffic demand. The compression algorithms include: Lossless compression: used for text or code data; Lossy compression: used for audio, video, and image data; The compression ratio is calculated by the following formula: Traffic acceleration and optimization include two operations: traffic control and traffic scheduling. Traffic control involves managing the transmission rate and latency, while traffic scheduling optimizes the data stream by adopting different links or paths; Traffic optimization decision formula: Optimal Traffic Flow = min(Available Bandwidth, Latency Requirement, Packet Loss Rate) The core of the data stream diversion strategy dynamically adopts the best link and path according to the real-time demand of the traffic. The diversion strategy is based on the link performance, data type, and real-time demand, and uses different network paths for parallel or serial transmission; The traffic diversion decision is based on the following factors: Link bandwidth: determines the transmission rate of the traffic; Link latency: affects the response time of real-time applications; Link packet loss rate: Determines the reliability of data transmission; Data type: Different data types adopt different transmission strategies; Real-time requirement: Real-time traffic adopts lower latency and higher stability; The dynamic traffic splitting formula is expressed as: Among them, f is a decision function used to select the optimal link; The adoption of the link is based on the real-time changes of link performance and data transmission requirements. Based on the following decision function, the system uses the link for data splitting: Among them, α, β, and γ are parameters that control the influence of latency, bandwidth, and packet loss rate on link selection; Combining data compression and traffic splitting, the edge computing module is optimized based on the following comprehensive formula: Optimization Decision = min(Compression Cost + Transmission Cost + Flow Distribution Cost) Among them, Compression Cost: The computing and latency costs during data compression; Transmission Cost: The bandwidth occupancy and latency generated during data transmission; Flow Distribution Cost: The comprehensive cost of using the link during traffic splitting.

5. The satellite link acceleration system according to claim 4, wherein When the link quality deteriorates and the packet loss rate is too high, the system automatically switches to the redundant forward error correction mechanism and works in coordination with the TCP proxy module as follows: The TCP proxy module is used to optimize the transmission efficiency of the TCP protocol. The TCP proxy module optimizes the data transmission efficiency through TCP acceleration, alleviating TCP header overhead, merging small packets, and congestion control methods; When the system detects that the packet loss rate is too high, the TCP proxy module works in coordination with the FEC mechanism to improve the robustness of data transmission through the following strategies: FEC enabled: When the packet loss rate exceeds the threshold, the system automatically enables FEC; TCP and FEC cooperation: The TCP proxy module makes dynamic adjustments according to the network conditions, adopts the retransmission mechanism or reduces the number of TCP retransmissions, and at the same time adopts FEC to reduce the impact of packet loss; Set up the system to perform FEC switching when the packet loss rate is high and cooperate with the TCP proxy module. The following are the relevant operation formulas: When the packet loss rate exceeds a certain threshold (θ loss ), the system switches to the redundant forward error correction mechanism: If PLR>θ loss ,switch to FEC mode. where θ loss is the packet loss rate threshold set by the system; The coding rate and redundancy of FEC are measured by coding efficiency. The redundancy (r fec ) of Reed-Solomon coding is adopted according to the packet loss rate of the link and the required recovery ability. The calculation formula for the redundancy of FEC is as follows: The task of the TCP proxy module is to adjust the TCP transmission parameters according to the link quality. When FEC is enabled, the TCP proxy optimizes the ACK and retransmission mechanisms. The relevant formulas adjusted by the TCP proxy module are as follows: Among them, Max Retransmits is the maximum number of retransmissions, and θ loss is the packet loss rate threshold; The TCP proxy module dynamically adjusts the TCP window size according to the packet loss rate and link quality: TCP Window Size = Base Window Size × (1 - PLR) Among them, Base Window Size is the base window size and PLR is the packet loss rate; When the packet loss rate exceeds the threshold, the system balances the cooperation between FEC and the TCP proxy module through the following comprehensive optimization decision:

6. The system for satellite link acceleration according to claim 5, wherein During data transmission, quantum encryption technology is used for end-to-end data encryption and the identity authentication of each communication node is ensured as: The BB84 protocol is a quantum key distribution protocol used to securely exchange keys over an insecure channel. The two communicating parties share an encryption key through the transmission of quantum bits. The following are the steps of the BB84 protocol: Quantum bit preparation: Alice generates quantum bits and randomly selects a basis state; Quantum bit transmission: Alice sends the quantum bits to Bob through an insecure quantum channel; Basis state selection and measurement: After receiving the quantum bits, Bob randomly selects a measurement basis state and performs a measurement; Public discussion and screening: Alice and Bob announce the basis states they used and retain the quantum bits with the same basis states; In end-to-end encryption, the shared key generated by quantum key distribution is used to encrypt data through a classical symmetric encryption algorithm. The encryption and decryption formulas are as follows: Encryption process: C = E(K, M) where C is the ciphertext, E(K, M) is the encryption function, K is the shared key, and M is the plaintext; Decryption process: M = D(K, C) where M is the decrypted plaintext, D(K, C) is the decryption function, K is the shared key, and C is the ciphertext; Ensure the identity authentication of each communication node. Combine quantum encryption technology with traditional public key infrastructure for authentication. The node identity authentication is doubly protected by quantum encryption. Combine digital signature and quantum certificate mechanism. The process of identity authentication includes the following steps: Each communication node generates its own public key (PK node ) and private key (SK node ); The node signs with a quantum key, generates a quantum certificate, and transmits it through a quantum channel; The receiving party ensures the identity of the sending node by verifying the validity of the quantum certificate. If the node identity matches, further communication is carried out; otherwise, the connection is refused; The sending party encrypts the message with the public key of the receiving party: C = E(PK receiver , M) Among them, C is the encrypted message, and PK receiver is the public key of the recipient, and M is the message; The sending party digitally signs the message with its private key: S = Sign(SK sender , M) Among them, S is the signature, and SK sender is the private key of the sender, and M is the message; The receiving party verifies the validity of the signature with the public key of the sending party: Verify(PK sender , M, S) If the verification is successful, the receiving party accepts the message; otherwise, it rejects; Combining quantum encryption and identity authentication, the overall communication process is represented by the following secure communication model: Secure Communication=[QKD→E(K,M)→D(K,C)]∩[Sign(SK sender ,M)→Verify(PK sender ,M,S)] where QKD represents the quantum key distribution process, E(K, M) is encryption, D(K, C) is decryption, Sign and Verify are the digital signature and signature verification processes respectively.

7. The satellite link acceleration system according to claim 6, wherein Using blockchain technology for decentralized identity verification of communication nodes to ensure the identity credibility and security in the communication process: When each communication node joins the blockchain, it generates a pair of public and private keys. The node identity is bound to the public key through decentralized identity and registered on the blockchain; Node identity generation: The node generates a public key PK node and a private key SK node ; The decentralized identifier of the node is generated by the public key PK node and recorded on the blockchain: DID = Hash(PK node ) where Hash is the hash function; The node registers its public key, identity information, and other relevant data on the blockchain, ensuring decentralization and immutability through a smart contract; The node records the public key information and identity information on the blockchain through a transaction: Transaction = {DID, PK node , Other Info} When a node sends a message, it uses the private key SK node to digitally sign the message. The recipient verifies the identity through the public key on the blockchain. The sender uses the private key SK node to sign the message M: S = Sign(SK node , M) where S is the message signature; The recipient uses the public key PK publicly available on the blockchain node Verify the validity of the signature: Verify(PK node , M, S) The smart contract executes the identity verification logic on the blockchain. If it verifies whether a certain node is a legitimate identity and has the permission to participate in communication, the smart contract verifies the node's identity by verifying whether the DID of the node exists and confirming that its public key is consistent with the record on the blockchain: If it returns True, it means the node identity is valid and the communication continues. If it returns False, the communication is refused.

8. An electronic device, characterized in that, It includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the satellite link acceleration system as described in any one of claims 1-7.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the satellite link acceleration system as described in any one of claims 1-7.

Images