Multi-path tunnel redundant message processing method, device, equipment and storage medium

By parsing the sequence number and buffer set of redundant transmission messages at intermediate nodes in the tunnel, and dynamically determining the timing of processing window advancement, the problem of sequence state management in redundant transmission of multi-path tunnels is solved, achieving efficient message processing and mode compatibility.

CN123123071APending Publication Date: 2026-11-17SHANGHAI COGENT TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611242839.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-17
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

In multi-path tunnel redundant transmission, existing technologies struggle to achieve sequence state management without relying on end-to-end feedback mechanisms, leading to erroneous processing window advancements or low packet processing efficiency, and also resulting in redundant design issues under different service processing modes.

Method used

By parsing the sequence numbers of redundant transmission messages at intermediate nodes in the tunnel and combining them with the global baseline sequence number and sequence number cache set, the timing of the processing window advancement is dynamically determined, and the message processing flow of different modes is uniformly managed to avoid erroneous advancement caused by the reception progress of a single path being ahead of schedule.

Benefits of technology

It achieves efficient processing of multi-path redundant transmission messages without the need for an end-to-end feedback mechanism, improves the adaptability and reusability of the processing flow, and reduces the system implementation complexity and cache usage.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123123071A_ABST
    Figure CN123123071A_ABST
Patent Text Reader

Abstract

This invention discloses an audio / video encoder bitrate adjustment method, device, electronic device, and storage medium. It relies on only two types of core data (network indicators of the transmission link and encoder bitrate), which is simple to monitor and has low system overhead. It achieves dynamic matching of bitrate and network from the source of encoding, reduces transport layer remedial operations, and improves transmission efficiency. It has low modification cost, is easy to implement in engineering, can adapt to network changes, ensures service stability and picture quality, and is suitable for various real-time audio and video transmission scenarios.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of network communication technology, and in particular relates to a method, apparatus, device and storage medium for processing redundant messages in multi-path tunnels. Background Technology

[0002] With the development of network communication technology, multipath tunneling technology has been gradually applied to communication scenarios with high requirements for data transmission continuity and stability. In the process of multipath tunneling, the sending end usually assigns monotonically increasing sequence numbers to the original service packets according to the generation order, and copies the same original service packet to generate multiple redundant transmission packets. The multiple redundant transmission packets are transmitted to the packet forwarding node through different tunnel paths, so as to achieve redundant transmission by utilizing multiple tunnel paths.

[0003] In multi-path tunnel redundant transmission, due to differences in network conditions across different tunnel paths, each path may have varying transmission delays, link loads, and queuing situations, resulting in differences in packet reception progress across different tunnel paths. For example, one path may have already received a packet with a higher sequence number, while another path is still in the reception stage for a packet with a lower sequence number. In this situation, packet forwarding nodes cannot accurately determine the overall multi-path transmission status based solely on the current reception progress of a single path, nor can they determine whether the current packet processing window can continue to advance.

[0004] For the aforementioned multipath transmission scenarios, existing reliable transmission solutions typically employ a feedback mechanism between the sender and receiver. This could involve confirming message reception status via bidirectional ARQ retransmission signaling and retransmitting unsuccessfully received messages based on the confirmation result. However, such mechanisms usually require protocol interaction between the communicating parties and rely on an end-to-end feedback process. Intermediate forwarding nodes in the tunnel cannot directly deploy corresponding retransmission control logic, making them unsuitable for application scenarios where only intermediate tunnel nodes process existing redundant transmission messages.

[0005] Besides the methods mentioned above, some existing technologies address the sequence state management problem in multi-path redundant transmission by maintaining the maximum sequence number received by each tunnel path and determining whether the packet processing window needs to be advanced based on the maximum sequence number across the entire network. However, in multi-path redundant transmission scenarios, the reception progress of each path may differ. When a path reaches a larger received sequence number earlier due to better transmission status, the maximum received sequence number for that path will exceed the actual reception progress of other paths. If the processing window is advanced directly based on the maximum sequence number across the entire network, it may ignore sequence number packets in other paths that are still in normal transmission, causing the processing window to advance prematurely and preventing subsequent legitimate packets from participating in processing.

[0006] Furthermore, existing technologies typically employ a fixed waiting time when handling sequence number intervals. This means that when an interval is detected between the currently received sequence number and the continuously processed sequence, a preset time is waited before advancing the message processing window. However, path delays in multipath tunnel transmission are dynamically variable, making a fixed waiting time unsuitable for different transmission states. When the waiting time is set too long, in processing scenarios requiring sequence continuity, subsequent sequence number messages that have already arrived need to wait continuously, leading to increased buffer usage and reduced message processing efficiency. Conversely, when the waiting time is set too short, messages still in other path transmission processes may not be sufficiently waited for, affecting message processing accuracy.

[0007] Furthermore, existing technologies typically design ordered caching processing mode and host out-of-order processing mode separately to address different business processing needs. In ordered caching processing mode, it is necessary to maintain a packet buffer window and determine whether to release buffered packets based on sequence continuity. In host out-of-order processing mode, out-of-order packets are usually forwarded directly, with the subsequent host handling the out-of-order processing. Since the two modes usually employ independent processing flows, for the same functions such as sequence number parsing, sequence state maintenance, and processing window advancement, corresponding processing logic needs to be designed separately. This leads to the duplication of implementation of the same functional modules, reducing the reusability of processing logic, increasing system implementation complexity, and consuming significant hardware resources.

[0008] Therefore, in multi-path tunnel redundant transmission scenarios, the following technical problems urgently need to be solved: how to enable intermediate forwarding nodes in the tunnel to complete sequence state management based on existing redundant transmission packets without relying on end-to-end retransmission mechanisms; how to integrate the reception status of multiple tunnel paths to avoid the processing window being incorrectly advanced due to the reception progress of a single path being ahead of schedule; and how to be compatible with different packet processing modes based on a unified sequence state management mechanism, while dynamically determining the timing of processing window advancement. Summary of the Invention

[0009] Based on this, and in response to the aforementioned technical problems, a method, apparatus, device, and storage medium for processing redundant messages in multi-path tunnels are provided.

[0010] The technical solution adopted in this invention is as follows: As a first aspect of the present invention, a method for processing redundant packets in a multi-path tunnel is provided, applied to a packet forwarding node, comprising: Each time a redundant transmission packet is received from a tunnel path, the sequence number seq corresponding to the redundant transmission packet and the tunnel path number k to which the redundant transmission packet belongs are parsed. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, PathMax[k] is updated to the sequence number seq, and the minimum value is calculated based on PathMax[k] corresponding to all tunnel paths. The minimum value is used as the network-wide path progress value AllMin. Based on the sequence number seq and the global reference sequence number Gseq, the redundant transmission message is processed as follows, wherein the global reference sequence number Gseq represents the maximum sequence number that the message forwarding node has currently forwarded in a continuous and orderly manner, the sequence number seq is a monotonically increasing sequence number assigned by the sender to the original service message, its initial value is x, and the initial value of Gseq is x-1: When seq is less than or equal to Gseq, the redundant transmission message is discarded; When seq equals Gseq+1: a. Forward the redundant transmission message and update Gseq to seq; b. When the serial number Gseq+1 exists in the serial number cache set WinSet, delete the corresponding serial number, forward the corresponding cached message, update Gseq to Gseq+1, and update the number of serial numbers SurplusCnt in the serial number cache set WinSet to SurplusCnt-1. When seq is greater than Gseq+1, determine whether the sequence number seq exists in the sequence number cache set WinSet. If it does, discard the redundant transmission packet; otherwise, add seq to the sequence number cache set WinSet, update the sequence number count SurplusCnt to SurplusCnt+1, and process it according to the preset mode. When the preset mode is the tunnel cache ordered mode, the redundant transmission packets are cached; When the preset mode is host out-of-order mode, the redundant transmission packets are forwarded directly. During the above processing of the redundant transmission messages, when the number of sequence numbers SurplusCnt reaches the first preset threshold, or the difference between AllMin and Gseq reaches the second preset threshold, Gseq is updated to Gseq+1, and step b is executed.

[0011] As a second aspect of the present invention, a multi-path tunnel redundant packet processing apparatus is provided, applied to a packet forwarding node, characterized in that it comprises: The first module is used to parse the sequence number seq corresponding to the redundant transmission message and the tunnel path number k to which the redundant transmission message belongs each time a redundant transmission message is received from the tunnel path. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, the PathMax[k] is updated to the sequence number seq, and the minimum value is calculated based on the PathMax[k] corresponding to all tunnel paths. The minimum value is used as the network-wide path progress value AllMin. The second module is used to perform the following processing on the redundant transmission message based on the sequence number seq and the global reference sequence number Gseq, wherein the global reference sequence number Gseq is used to represent the maximum sequence number that the message forwarding node has currently forwarded in a continuous and orderly manner, the sequence number seq is a monotonically increasing sequence number assigned by the sender to the original service message, its initial value is x, and the initial value of Gseq is x-1: When seq is less than or equal to Gseq, the redundant transmission message is discarded; When seq equals Gseq+1: a. Forward the redundant transmission message and update Gseq to seq; b. When the serial number Gseq+1 exists in the serial number cache set WinSet, delete the corresponding serial number, forward the corresponding cached message, update Gseq to Gseq+1, and update the number of serial numbers SurplusCnt in the serial number cache set WinSet to SurplusCnt-1. When seq is greater than Gseq+1, determine whether the sequence number seq exists in the sequence number cache set WinSet. If it does, discard the redundant transmission packet; otherwise, add seq to the sequence number cache set WinSet, update the sequence number count SurplusCnt to SurplusCnt+1, and process it according to the preset mode. When the preset mode is the tunnel cache ordered mode, the redundant transmission packets are cached; When the preset mode is host out-of-order mode, the redundant transmission packets are forwarded directly. The third module is used to update Gseq to Gseq+1 and execute b when the number of sequence numbers SurplusCnt reaches a first preset threshold or the difference between AllMin and Gseq reaches a second preset threshold during the above processing of the redundant transmission message.

[0012] As a third aspect of the present invention, an electronic device is provided, including a storage module, the storage module including instructions loaded and executed by a processor, the instructions, when executed, causing the processor to perform a multipath tunnel redundancy message processing method of the first aspect described above.

[0013] As a fourth aspect of the present invention, a computer-readable storage medium is provided that stores one or more programs, which, when executed by a processor, implement the multipath tunnel redundancy message processing method of the first aspect described above.

[0014] Compared with the prior art, the present invention has the following beneficial effects: First, this application does not rely on an end-to-end feedback mechanism between the sender and receiver. Instead, the message forwarding node in the tunnel manages the sequence status based on the received redundant transmission messages. By parsing the sequence number (seq) in the redundant transmission messages and combining it with the global baseline sequence number (Gseq) and the sequence number cache set (WinSet), the message status is determined, enabling the intermediate nodes in the tunnel to independently process the redundant transmission messages.

[0015] Secondly, this application maintains the maximum received sequence number PathMax[k] for each tunnel path and calculates the minimum value based on the PathMax[k] for all tunnel paths. This minimum value is then used as the overall network path progress value AllMin. This allows packet forwarding nodes to obtain the current status of the slower-receiving path among multiple paths and use this status as a reference for determining whether to advance the processing window. Compared to the method of judging window advancement based on the maximum received sequence number of a single path, this application can reduce the problem of premature advancement of the processing window due to the advanced receiving progress of a certain path.

[0016] Furthermore, this application maintains a global baseline sequence number Gseq and performs different processing based on the relationship between the sequence number seq and Gseq. When seq is less than or equal to Gseq, the corresponding redundant transmission packet is discarded; when seq is equal to Gseq+1, the corresponding packet is forwarded and Gseq is updated, while consecutive cached packets in the sequence number cache set WinSet are released; when seq is greater than Gseq+1, the corresponding packet is cached or forwarded according to a preset mode. Through the above unified sequence state management method, the orderly processing of packets with different sequence states in multi-path redundant transmission scenarios is realized.

[0017] Furthermore, this application sets the sequence number SurplusCnt and the difference between AllMin and Gseq as processing window advancement conditions. When the preset conditions are met, Gseq is updated and a continuous buffered message processing flow is executed. Compared to the fixed waiting time method, this application can dynamically determine the timing of processing window advancement based on the current buffer state and multi-path reception state, reducing message processing delays caused by waiting for a fixed timeout.

[0018] Furthermore, this application integrates tunnel cache ordered mode and host out-of-order mode into a unified sequence state management process, selecting the corresponding packet processing method only based on the preset mode. In tunnel cache ordered mode, packets that do not meet the conditions for continuous processing can be cached; in host out-of-order mode, the corresponding packets can be forwarded directly. Compared to designing independent sequence processing processes for different modes, this application reduces the repetitive design of common processing logic such as sequence state maintenance and window advancement, thus improving the reusability of the processing flow.

[0019] In summary, the multi-path tunnel redundant message processing method provided in this application dynamically judges the timing of message processing window advancement by combining multi-path reception status, sequence status, and buffer status, enabling intermediate nodes in the tunnel to complete redundant transmission message processing without end-to-end feedback mechanisms, and improving the adaptability of message processing flow in multi-path scenarios. Attached Figure Description

[0020] The present invention will now be described in detail with reference to the accompanying drawings and specific embodiments: Figure 1 A flowchart of a multi-path tunnel redundant message processing method provided in an embodiment of the present invention; Figure 2 This is a schematic diagram of a multi-path tunnel redundant message processing device provided in an embodiment of the present invention; Figure 3 This is a schematic diagram of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0021] The embodiments of the present invention will be described below with reference to the accompanying drawings. It should be noted that the embodiments described in this specification are not exhaustive and do not represent the only embodiments of the present invention. The corresponding embodiments below are only for clearly illustrating the inventive content of this patent and are not intended to limit its implementation. For those skilled in the art, different variations and modifications can be made based on the embodiments described. Any variations or modifications that fall within the technical concept and inventive content of this invention and are obvious are also within the protection scope of this invention.

[0022] This application provides a method for processing redundant packets in a multi-path tunnel, applied to a packet forwarding node. In this embodiment, the sending end assigns a globally monotonically increasing sequence number (seq) to the original service packet. Multiple redundant copies of the same original service packet carry the same sequence number (seq) and are transmitted to the packet forwarding node through different tunnel paths.

[0023] like Figure 1 As shown, the specific flow of the method in this application embodiment is as follows: S101. Each time a redundant transmission message is received from the tunnel path, the sequence number seq corresponding to the redundant transmission message and the tunnel path number k to which the redundant transmission message belongs are parsed. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, PathMax[k] is updated to the sequence number seq, and the minimum value of PathMax[k] corresponding to all tunnel paths is calculated. The minimum value is used as the network-wide path progress value AllMin.

[0024] Since multiple redundant copies of the same original service message are transmitted through different tunnel paths, the message sequences received by different tunnel paths may differ in order. In order to obtain the current data reception progress of each tunnel path in real time, this embodiment maintains the maximum reception sequence number PathMax[k] for each tunnel path.

[0025] When the received sequence number seq is greater than the PathMax[k] corresponding to the current tunnel path number k, it means that the tunnel path has received a new sequence number message, so PathMax[k] is updated to the current sequence number seq.

[0026] AllMin represents the sequence number progress of the slowest receiving path among all current tunnel paths.

[0027] By maintaining AllMin, we can avoid premature judgment by packet forwarding nodes that packets on other paths are lost due to a large number of packets being received in advance on a certain high-speed path, thereby improving the accuracy of missing sequence number judgment in multi-path redundant transmission scenarios.

[0028] S102. Process redundant transmission messages according to sequence number seq and global reference sequence number Gseq.

[0029] In this embodiment, the packet forwarding node maintains a global baseline sequence number Gseq, which represents the maximum sequence number that the packet forwarding node has currently forwarded in a continuous and orderly manner.

[0030] The sequence number seq assigned by the sender is a monotonically increasing sequence number with an initial value of x. Therefore, Gseq is initialized to x-1, such that the first valid sequence number satisfies:

[0031] The message forwarding node processes redundant transmission messages according to the relationship between the received sequence number (seq) and the current Gseq, as follows: (1) When seq is less than or equal to Gseq, it means that the message corresponding to the sequence number has been forwarded. Since the same original service message may arrive repeatedly through different paths in multi-path redundant transmission, the message is a redundant copy that has been processed, so the redundant transmission message is directly discarded.

[0032] (2) When seq equals Gseq+1, it means that the currently received message is the continuous message that is expected to be received: First, the message forwarding node forwards the redundant transmission message and updates Gseq to the current sequence number seq.

[0033] Then, it iterates through the sequence number cache set WinSet to check if the sequence number Gseq+1 exists. If it exists, it means that the previously received out-of-order message has been cached and is waiting. Therefore, the corresponding sequence number is deleted, the corresponding cached message is forwarded, Gseq is updated to Gseq+1, and the number of sequence numbers SurplusCnt in the sequence number cache set WinSet is updated to SurplusCnt-1. The loop ends when the sequence number cache set WinSet no longer contains the sequence number Gseq+1.

[0034] Through the above processing, the message forwarding node can automatically release the previously cached consecutive out-of-order messages after receiving the missing sequence number, thus achieving continuous and orderly forwarding.

[0035] (3) When seq is greater than Gseq+1, it means that there are still unreceived sequence numbers in the middle.

[0036] At this point, first check if the current sequence number seq exists in the sequence number cache set WinSet. If it exists, it means that the message is a duplicate copy of the same original service message obtained through other tunnel paths, so discard the redundant transmission message.

[0037] If it does not exist, it means that the message corresponding to the sequence number has arrived for the first time. In this case, the sequence number is added to the sequence number cache set WinSet, and the sequence number count SurplusCnt is updated to SurplusCnt+1.

[0038] Subsequently, the message is processed differently according to the preset pattern: When the preset mode is the tunnel cache ordered mode, redundant transmission packets are cached and forwarded in sequence after missing sequence numbers are filled in. Alternatively, they are forwarded when missing sequence number jump processing is performed in step S103.

[0039] When the preset mode is host out-of-order mode, redundant transmission packets are directly forwarded to the service host, which then handles the packet out-of-order issues.

[0040] S103. During the above processing of redundant transmission messages, the message forwarding node determines whether there are long-waiting missing sequence numbers based on the current buffer status and multi-path reception progress, and performs jump processing on the long-waiting missing sequence numbers.

[0041] Specifically, when any of the following conditions are met: (1) The number of serial numbers SurplusCnt in the serial number cache set WinSet reaches the first preset threshold (in this embodiment, SurplusCnt is greater than or equal to the first preset threshold). or: (2) The difference between the network path progress value AllMin and the global baseline sequence number Gseq reaches the second preset threshold (in this embodiment, the difference is greater than the second preset threshold). If the current missing sequence number cannot be waited for any longer, a missing sequence number jump process needs to be executed. The specific process is as follows: Update Gseq to Gseq+1, and loop through the sequence number cache set WinSet to check if the sequence number Gseq+1 exists. If it exists, delete the corresponding sequence number, forward the corresponding cached message, update Gseq to Gseq+1, and update the sequence number cache set WinSet's sequence number count SurplusCnt to SurplusCnt-1. The loop ends when the sequence number cache set WinSet no longer contains the sequence number Gseq+1.

[0042] By using the above method, without setting a waiting timer or requiring the sender to retransmit confirmation, the missing sequence number can be actively determined by utilizing the buffer size and multi-path progress difference, thereby improving message forwarding efficiency.

[0043] S104. Clean up expired serial numbers in the serial number cache collection WinSet.

[0044] The purpose of this step is to prevent the serial number cache set WinSet from storing historical serial numbers that have already been processed for a long time. After the global baseline serial number Gseq is updated, WinSet is cached and cleaned up. Specifically, after the global baseline serial number Gseq is updated, serial numbers in the serial number cache set WinSet that are less than or equal to the global baseline serial number Gseq are deleted.

[0045] Since the packets corresponding to sequence numbers less than or equal to Gseq have already been forwarded or skipped, they do not need to be retained.

[0046] The aforementioned cache cleanup mechanism reduces the storage pressure on WinSet during long-term operation and improves the continuous operation capability of message forwarding nodes. Furthermore, in this embodiment, redundant cached transmission messages are deleted after being forwarded.

[0047] To further illustrate the multi-path tunnel redundant message processing method provided in the embodiments of this application, the workflow of the method is described below in conjunction with a specific sequence number change process.

[0048] Suppose that the message forwarding node receives redundant transmission messages from multiple tunnel paths. The sequence number seq assigned by the sender to the original service message is 1, 2, 3, 4, 5, ... The message forwarding node maintains a global base sequence number Gseq, a sequence number cache set WinSet, and the path maximum received sequence number PathMax[k] corresponding to each tunnel path.

[0049] Initially, Gseq is set to 0, which means that no sequentially ordered forwarding of any sequence numbered packets has been completed yet.

[0050] (1) Normal forwarding process of continuous messages When the message forwarding node first receives the redundant transmission message with sequence number 1: Since: seq=Gseq+1=1.

[0051] Therefore, the message is determined to be a continuous message that is currently expected to be received.

[0052] The message forwarding node forwards the message directly and updates it to Gseq=1.

[0053] Then, check if the serial number exists in the serial number cache set WinSet: Gseq+1=2.

[0054] If it does not exist, the current process ends.

[0055] (2) Out-of-order message caching process Suppose that a redundant transmission message with sequence number 4 is subsequently received, at which point Gseq=1.

[0056] Since seq=4>Gseq+1=2, it indicates that there is an unreceived sequence number in the middle. Therefore, the packet forwarding node first checks whether sequence number 4 already exists in WinSet. If it does not exist, it adds sequence number 4 to WinSet and updates SurplusCnt=SurplusCnt+1.

[0057] In tunnel cache ordered mode, the packet corresponding to sequence number 4 is cached and awaits the arrival of subsequent consecutive sequence numbers; in host out-of-order mode, the packet corresponding to sequence number 4 is directly forwarded to the service host. In this case: WinSet={4}, SurplusCnt=1.

[0058] (3) Window advancement process after filling in consecutive missing sequences Subsequently, the message forwarding node received the redundant transmission message with sequence number 2.

[0059] At this point, seq = Gseq + 1 = 2, therefore, this message belongs to the consecutive message category. The message forwarding node forwards the message with sequence number 2 and updates: Gseq = 2.

[0060] Then, it checks if Gseq+1=3 exists in WinSet. If not, it continues to wait for subsequent packets. When a packet with sequence number 3 is received, it also satisfies seq=Gseq+1, therefore: 1. Forward the message corresponding to sequence number 3; 2. Update: Gseq=3; 3. Check if Gseq+1=4 exists in WinSet.

[0061] Since serial number 4 was previously cached, serial number 4 was deleted from WinSet and the corresponding cached message was forwarded. At the same time, Gseq=4 and SurplusCnt=0 were updated.

[0062] At this point, sequence number 4, which was previously cached due to out-of-order delivery, no longer needs to wait and can be released as the consecutive windows advance. Assuming that WinSet also contains 5, 6, and 7, according to the round-robin rule, the corresponding packets will be forwarded in sequence, and Gseq and SurplusCnt will be updated.

[0063] (4) Redundant copy deduplication process Since the same original service message will generate multiple redundant copies carrying the same sequence number through different tunnel paths, multiple messages with the same sequence number may arrive at the message forwarding node one after another.

[0064] For example: The message forwarding node has received the message with sequence number 4 and completed: Gseq=4.

[0065] If, at this point, another tunnel path transmits a redundant copy carrying sequence number 4, then: seq ≤ Gseq, indicating that the message corresponding to that sequence number has already been processed. Therefore, the message forwarding node directly discards the message, thus achieving deduplication of the redundant copy.

[0066] (5) Missing sequence number jump process based on AllMin and SurplusCnt Suppose at a certain moment: Gseq=13.

[0067] Due to some tunnel path anomalies or transmission delays, only messages with sequence numbers 15 and 16 were subsequently received, resulting in WinSet={15,16}, and at this time, SurplusCnt=2.

[0068] Meanwhile, the message forwarding node calculates AllMin based on PathMax[k] maintained by each tunnel path, which is used to reflect the reception progress of the slowest path among all current paths.

[0069] When the following conditions are met: SurplusCnt≥T or: AllMin-Gseq≥D2 If this happens, it means that the current missing sequence number is no longer suitable for waiting.

[0070] Therefore, the message forwarding node performs a jump operation for missing sequence numbers: First: Update Gseq = Gseq + 1 = 14.

[0071] After further investigation, it was found that WinSet contained serial number 15. Therefore, the corresponding serial number was deleted and the cached message was forwarded. Gseq=15 and SurplusCnt=1 were updated. At this time, WinSet still contained serial number 16. Therefore, the corresponding serial number was deleted and the cached message was forwarded. Gseq=16 and SurplusCnt=0 were updated.

[0072] In this way, message forwarding nodes do not need to wait for a fixed time or send retransmission requests; they can proactively advance the sequence window based on the multipath reception status.

[0073] (6) Cache cleanup process As Gseq continues to advance, some historical sequence numbers have been processed or have been skipped.

[0074] For example, if Gseq is currently 20, then any sequence number seq ≤ 20 cannot become a sequence to be processed again. Therefore, the message forwarding node deletes historical sequence numbers less than or equal to Gseq from the WinSet to free up cache space.

[0075] As can be seen from the above process, this embodiment of the application achieves packet deduplication, ordered forwarding, and proactive handling of missing sequence numbers in multi-path tunnel redundant transmission scenarios by maintaining the maximum received sequence number PathMax[k], the network-wide path progress value AllMin, the global baseline sequence number Gseq, and the sequence number cache set WinSet. Compared with methods based on timer waiting or relying on retransmission confirmation from the sending end, this embodiment of the application can perform event-driven processing based on the real-time receiving status of multiple paths, improving packet forwarding efficiency and reducing latency caused by cache waiting.

[0076] As can be seen from the above, the beneficial effects of the embodiments of this application are as follows: First, this application does not rely on an end-to-end feedback mechanism between the sender and receiver. Instead, the message forwarding node in the tunnel manages the sequence status based on the received redundant transmission messages. By parsing the sequence number (seq) in the redundant transmission messages and combining it with the global baseline sequence number (Gseq) and the sequence number cache set (WinSet), the message status is determined, enabling the intermediate nodes in the tunnel to independently process the redundant transmission messages.

[0077] Secondly, this application maintains the maximum received sequence number PathMax[k] for each tunnel path and calculates the minimum value based on the PathMax[k] for all tunnel paths. This minimum value is then used as the overall network path progress value AllMin. This allows packet forwarding nodes to obtain the current status of the slower-receiving path among multiple paths and use this status as a reference for determining whether to advance the processing window. Compared to the method of judging window advancement based on the maximum received sequence number of a single path, this application can reduce the problem of premature advancement of the processing window due to the advanced receiving progress of a certain path.

[0078] Furthermore, this application maintains a global baseline sequence number Gseq and performs different processing based on the relationship between the sequence number seq and Gseq. When seq is less than or equal to Gseq, the corresponding redundant transmission packet is discarded; when seq is equal to Gseq+1, the corresponding packet is forwarded and Gseq is updated, while consecutive cached packets in the sequence number cache set WinSet are released; when seq is greater than Gseq+1, the corresponding packet is cached or forwarded according to a preset mode. Through the above unified sequence state management method, the orderly processing of packets with different sequence states in multi-path redundant transmission scenarios is realized.

[0079] Furthermore, this application sets the sequence number SurplusCnt and the difference between AllMin and Gseq as processing window advancement conditions. When the preset conditions are met, Gseq is updated and a continuous buffered message processing flow is executed. Compared to the fixed waiting time method, this application can dynamically determine the timing of processing window advancement based on the current buffer state and multi-path reception state, reducing message processing delays caused by waiting for a fixed timeout.

[0080] Furthermore, this application integrates tunnel cache ordered mode and host out-of-order mode into a unified sequence state management process, selecting the corresponding packet processing method only based on the preset mode. In tunnel cache ordered mode, packets that do not meet the conditions for continuous processing can be cached; in host out-of-order mode, the corresponding packets can be forwarded directly. Compared to designing independent sequence processing processes for different modes, this application reduces the repetitive design of common processing logic such as sequence state maintenance and window advancement, thus improving the reusability of the processing flow.

[0081] In summary, the multi-path tunnel redundant message processing method provided in this application dynamically judges the timing of message processing window advancement by combining multi-path reception status, sequence status, and buffer status, enabling intermediate nodes in the tunnel to complete redundant transmission message processing without end-to-end feedback mechanisms, and improving the adaptability of message processing flow in multi-path scenarios.

[0082] Meanwhile, after the global baseline sequence number Gseq is updated, this application cleans up the processed sequence number records in the sequence number cache set WinSet, and deletes the sequence numbers less than or equal to the global baseline sequence number Gseq, so that the processed sequence number records can be released in a timely manner, avoiding the continuous occupation of cache space by sequence numbers that no longer need to participate in subsequent processing, thereby improving the cache management efficiency of the packet forwarding node during long-term operation.

[0083] The following will describe in detail one or more embodiments of the multipath tunnel redundancy packet processing apparatus of the present invention. Those skilled in the art will understand that these apparatuses can be configured using commercially available hardware components through the steps taught in this solution. Figure 2 This invention illustrates a multi-path tunnel redundant packet processing device provided by an embodiment of the present invention. The device is applied to a packet forwarding node and includes a first module 11, a second module 12, a third module 13, and a fourth module 14.

[0084] The first module 11 is used for S101. Each time a redundant transmission message is received from the tunnel path, the sequence number seq corresponding to the redundant transmission message and the tunnel path number k to which the redundant transmission message belongs are parsed. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, PathMax[k] is updated to the sequence number seq, and the minimum value of PathMax[k] corresponding to all tunnel paths is calculated. The minimum value is used as the network-wide path progress value AllMin.

[0085] The second module 12, S102, is used to process redundant transmission messages based on the sequence number seq and the global reference sequence number Gseq.

[0086] The third module 13, S103, is used to determine whether there are long-waiting missing sequence numbers based on the current buffer status and multi-path reception progress during the above processing of redundant transmission messages, and to perform jump processing on long-waiting missing sequence numbers.

[0087] The third module 14, S104, is used to clean up expired serial numbers in the serial number cache collection WinSet.

[0088] The specific implementation process and working principle of each of the above modules can be found in the description of the aforementioned method embodiments. To avoid repetition, they will not be repeated here.

[0089] In summary, the multi-path tunnel redundancy message processing provided in the above embodiments can execute the multi-path tunnel redundancy message processing methods provided in the foregoing embodiments.

[0090] Similar to the above concept, the above Figure 2 The structure of the audio / video encoder bitrate adjustment device shown can be implemented as an electronic device. Figure 3 A schematic block diagram of the structure of an electronic device provided by an embodiment of the present invention is shown.

[0091] For example, the electronic device includes a storage module 21 and a processor 22. The storage module 21 includes instructions loaded and executed by the processor 22. When executed, the instructions cause the processor 22 to perform the steps described in the above section of this specification, which describes a method for processing redundant packets through a multipath tunnel, according to various exemplary embodiments of the present invention.

[0092] It should be understood that processor 22 can be a Central Processing Unit (CPU), or it can be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among these, the general-purpose processor can be a microprocessor or any conventional processor.

[0093] This invention also provides a computer-readable storage medium that stores one or more programs, which, when executed by a processor, implement the steps described in the above section on a multipath tunnel redundant message processing method according to various exemplary embodiments of the invention.

[0094] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software can be distributed on a computer-readable storage medium, which may include computer-readable storage media (or non-transitory media) and communication media (or transient media).

[0095] As is known to those skilled in the art, the term computer-readable storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer-readable storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, it is known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0096] For example, the computer-readable storage medium may be an internal storage unit of the electronic device described in the foregoing embodiments, such as a hard disk or memory of the electronic device. The computer-readable storage medium may also be an external storage device of the electronic device, such as a plug-in hard disk, Smart Media Card (SMC), Secure Digital (SD) card, Flash Card, etc., provided on the electronic device.

[0097] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A method for processing redundant packets in multi-path tunnels, applied to a packet forwarding node, characterized in that, include: Each time a redundant transmission packet is received from a tunnel path, the sequence number seq corresponding to the redundant transmission packet and the tunnel path number k to which the redundant transmission packet belongs are parsed. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, PathMax[k] is updated to the sequence number seq, and the minimum value is calculated based on PathMax[k] corresponding to all tunnel paths. The minimum value is used as the network-wide path progress value AllMin. Based on the sequence number seq and the global reference sequence number Gseq, the redundant transmission message is processed as follows, wherein the global reference sequence number Gseq represents the maximum sequence number that the message forwarding node has currently forwarded in a continuous and orderly manner, the sequence number seq is a monotonically increasing sequence number assigned by the sender to the original service message, its initial value is x, and the initial value of Gseq is x-1: When seq is less than or equal to Gseq, the redundant transmission message is discarded; When seq equals Gseq+1: a. Forward the redundant transmission message and update Gseq to seq; b. When the serial number Gseq+1 exists in the serial number cache set WinSet, delete the corresponding serial number, forward the corresponding cached message, update Gseq to Gseq+1, and update the number of serial numbers SurplusCnt in the serial number cache set WinSet to SurplusCnt-1. When seq is greater than Gseq+1, determine whether the sequence number seq exists in the sequence number cache set WinSet. If it does, discard the redundant transmission packet; otherwise, add seq to the sequence number cache set WinSet, update the sequence number count SurplusCnt to SurplusCnt+1, and process it according to the preset mode. When the preset mode is the tunnel cache ordered mode, the redundant transmission packets are cached; When the preset mode is host out-of-order mode, the redundant transmission packets are forwarded directly. During the above processing of the redundant transmission messages, when the number of sequence numbers SurplusCnt reaches the first preset threshold, or the difference between AllMin and Gseq reaches the second preset threshold, Gseq is updated to Gseq+1, and step b is executed.

2. The method for processing redundant messages in a multi-path tunnel according to claim 1, characterized in that, This also includes cleaning up expired serial numbers in the serial number cache set WinSet: Once the global baseline sequence number Gseq is updated, delete the sequence numbers in the sequence number cache set WinSet that are less than or equal to the global baseline sequence number Gseq.

3. The method for processing redundant messages in a multi-path tunnel according to claim 1, characterized in that, The redundant transmission message includes multiple message copies generated by copying the same original service message. The multiple message copies carry the same sequence number seq and are transmitted to the message forwarding node through different tunnel paths.

4. A multi-path tunnel redundant message processing device, applied to a message forwarding node, characterized in that, include: The first module is used to parse the sequence number seq corresponding to the redundant transmission message and the tunnel path number k to which the redundant transmission message belongs each time a redundant transmission message is received from the tunnel path. When the sequence number seq is greater than the maximum received sequence number PathMax[k] corresponding to the tunnel path number k, the PathMax[k] is updated to the sequence number seq, and the minimum value is calculated based on the PathMax[k] corresponding to all tunnel paths. The minimum value is used as the network-wide path progress value AllMin. The second module is used to perform the following processing on the redundant transmission message based on the sequence number seq and the global reference sequence number Gseq, wherein the global reference sequence number Gseq is used to represent the maximum sequence number that the message forwarding node has currently forwarded in a continuous and orderly manner, the sequence number seq is a monotonically increasing sequence number assigned by the sender to the original service message, its initial value is x, and the initial value of Gseq is x-1: When seq is less than or equal to Gseq, the redundant transmission message is discarded; When seq equals Gseq+1: a. Forward the redundant transmission message and update Gseq to seq; b. When the serial number Gseq+1 exists in the serial number cache set WinSet, delete the corresponding serial number, forward the corresponding cached message, update Gseq to Gseq+1, and update the number of serial numbers SurplusCnt in the serial number cache set WinSet to SurplusCnt-1. When seq is greater than Gseq+1, determine whether the sequence number seq exists in the sequence number cache set WinSet. If it does, discard the redundant transmission packet; otherwise, add seq to the sequence number cache set WinSet, update the sequence number count SurplusCnt to SurplusCnt+1, and process it according to the preset mode. When the preset mode is the tunnel cache ordered mode, the redundant transmission packets are cached; When the preset mode is host out-of-order mode, the redundant transmission packets are forwarded directly. The third module is used to update Gseq to Gseq+1 and execute b when the number of sequence numbers SurplusCnt reaches a first preset threshold or the difference between AllMin and Gseq reaches a second preset threshold during the above processing of the redundant transmission message.

5. The multi-path tunnel redundant message processing device according to claim 4, characterized in that, It also includes a fourth module for cleaning up expired serial numbers in the serial number cache set WinSet: Once the global baseline sequence number Gseq is updated, delete the sequence numbers in the sequence number cache set WinSet that are less than or equal to the global baseline sequence number Gseq.

6. The multi-path tunnel redundant message processing device according to claim 4, characterized in that, The redundant transmission message includes multiple message copies generated by copying the same original service message. The multiple message copies carry the same sequence number seq and are transmitted to the message forwarding node through different tunnel paths.

7. An electronic device, characterized in that, The system includes a storage module comprising instructions loaded and executed by a processor, which, when executed, cause the processor to perform a multipath tunnel redundant message processing method according to any one of claims 1-3.

8. A computer-readable storage medium storing one or more programs, characterized in that, When the one or more programs are executed by the processor, they implement the multipath tunnel redundant message processing method according to any one of claims 1-3.