Parallel redundant Ethernet high-performance receiving processing method and related equipment

Abstract

The invention relates to the field of network bus communication, and discloses a parallel redundant Ethernet high-performance receiving processing method and related equipment, and the method comprises the steps: initializing the state and related parameters of a state machine, building a three-state processing system, and obtaining an initial processing frame and parameters; receiving a target message and extracting a serial number based on the initial processing framework and the parameters, calculating to obtain a new hop variable according to the received target message and the extracted serial number, and taking the new hop variable as a state judgment basis; matching a jump condition according to the current state of the state machine and the new jump variable, and executing message uploading, discarding or parameter updating operation according to the jump condition; and monitoring and triggering an aging mechanism according to the state operation duration of the state machine, and counting key data of the aging mechanism. The technical problems of high algorithm complexity, data loss and redundancy filtering failure in the prior art are solved.

Description

Technical Field

[0001] This invention relates to the field of network bus communication, specifically to a parallel redundant Ethernet high-performance receiving and processing method and related equipment. Background Technology

[0002] In scenarios with extremely high requirements for data transmission reliability and real-time performance, such as industrial control and rail transportation, parallel redundancy technologies (such as PRP / HSR) have become the core solution to ensure continuous network operation. Existing related technologies mainly revolve around three major directions: hardware acceleration, dynamic redundancy strategy optimization, and multi-core collaborative architecture. Hardware-level acceleration achieves microsecond-level frame alignment and redundancy elimination by integrating redundancy management modules such as PRP, and the FPGA sliding window state machine combined with parallel CRC check improves throughput efficiency to over 90%. Dynamic strategies introduce an adaptive discard mechanism to optimize compatibility in industrial scenarios, and the integration of the IEEE 1588v3 protocol compresses the dual-channel alignment error to the level of hundreds of nanoseconds. The multi-core architecture adopts dual ARM cores for division of labor and RDMA zero-copy technology to reduce CPU intervention and avoid interrupt storms.

[0003] While current technologies improve real-time performance through hardware acceleration of state machine core operations, significant limitations remain: FPGA full-load processing latency exceeds 10μs, static windows struggle to adapt to burst traffic, and parallel verification circuits consume a large proportion of power. The fundamental contradiction lies in the conflict between the deterministic timing requirements of state machines and the dynamic uncertainty of network environments. While next-generation solutions tend to combine TSN and AI fault prediction technologies, existing solutions have not fundamentally solved the problem of state stability in dynamic networks.

[0004] The core defects of the existing implementation are reflected in many aspects. For example, in terms of timing control, a delay difference of more than 50μs between the two channels will lead to a 30% decrease in throughput, and a clock drift of more than 100ns will easily lead to misjudgment of valid frames. In terms of resource conflicts, dual-channel interrupt competition will cause the processing delay to increase sharply to more than 15μs, and traversing the buffer under electromagnetic interference will introduce an 8μs delay, and there is a risk of CRC missed detection. In terms of dynamic adaptation, the BBR algorithm will cause a 5-10ms interrupt when the trigger window shrinks, and the packet loss rate of switching between PRP and HSR modes reaches 1.2%. Hardware bottlenecks are manifested in the soft state machine delay exceeding 200μs when transmitting small packets, the memory bandwidth being less than 800Mbps during dual-channel bursts, and the occurrence of blocking when the FPGA resource utilization exceeds 80%.

[0005] Existing redundant filtering algorithms also have shortcomings. For example, using both timestamp and sequence number for dual judgment requires additional design of caching and sliding window mechanisms, which leads to a surge in design complexity and seriously affects the performance of pure software implementation. Although single sequence number judgment simplifies the design, it has the defect of data loss. For example, in certain transmission scenarios, the message corresponding to the key sequence number may be lost, and data integrity cannot be guaranteed. Summary of the Invention

[0006] In order to overcome the shortcomings of the existing technology, the present invention aims to provide a parallel redundant Ethernet high-performance receiving and processing method and related equipment to solve the technical problems of high algorithm complexity, data loss and redundancy filtering failure in the existing technology.

[0007] This invention is achieved through the following technical solution: In a first aspect, the present invention provides a parallel redundant Ethernet high-performance receiving processing method, comprising: Initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters; The target message is received and the sequence number is extracted based on the initial processing framework and parameters. The new hop variable is calculated based on the received target message and the extracted sequence number, and the new hop variable is used as the basis for state judgment. The current state of the state machine is matched with the new jump variable to determine the jump condition, and the message upload, drop or parameter update operation is performed according to the jump condition. Based on the state machine's state runtime, monitor and trigger the aging mechanism, and collect key data for the aging mechanism.

[0008] Preferably, in the step of initializing the state machine's state and associated parameters and establishing a three-state processing system, the three states include an initial state, a no-transition state, and a transition state. The initial state is state 0. The initial state includes the old sequence number and the old jump variable. The old sequence number is set to infinity and the old jump variable is set to 0. The no-jump state is state 1. The no-jump state includes the old sequence number and the old jump variable. The old sequence number is set to non-infinity and the old jump variable is 0. There is a transition state, which is state 2. The transition state includes the old sequence number and the old jump variable. The old sequence number is set to be non-infinite and the old jump variable is greater than 1. The associated parameters include the sliding window size, 5-second aging time, packet loss count, window size, and 5-second aging count counter.

[0009] Furthermore, in the steps of receiving target messages and extracting sequence numbers based on the initial processing framework and parameters, calculating new hop variables based on the received target messages and extracted sequence numbers, and using the new hop variables as the basis for state judgment, the new hop variables are calculated by the difference between the new sequence number and the old sequence number of the newly received message. Using the new hop variable as the basis for state judgment includes: when the state machine is in state 0, the sequence number of the first received message is directly assigned to the old sequence number; when the hop variable is 1, it is determined that the sequence number has been updated normally.

[0010] Furthermore, the matching jump setting requirement is that when the current state machine is in state 0, jump number 0 is executed. Jump number 0 is an unconditional jump to state 1, uploading the current message, updating the old sequence number to the current message sequence number, and setting the old jump variable to 0.

[0011] Furthermore, the matching jump setting requirement is that when the current state machine is in state 1, jump number 1, jump number 2, and jump number 3 are executed; The jump condition for jump number 1 is that when the new jump variable is greater than 2 and less than the sliding window size, the jump is to state 2, the message is uploaded, the old sequence number and the old jump variable are updated, and the number of lost packets is counted. The jump condition for jump number 2 is that when the continuous running time reaches 5 seconds, it jumps to state 0, resets the old sequence number to infinity, the old jump variable to 0, and counts the number of aging times. The jump conditions for jump number 3 are as follows: when both the new jump value and the old jump value are 0 or outside the sliding window, the message is discarded, and when outside the sliding window, the extra window base number is counted; when the new jump value is equal to the old jump value plus 1, the message is uploaded and the sequence number is updated, and the jump is to state 1.

[0012] Furthermore, the matching jump setting requirement is that when the current state machine is in state 2, jumps 4, 5, and 6 are executed; The jump condition for jump number 4 is that when the new jump variable increases or decreases by 1, the jump is to state 1, the message is uploaded, the sequence number is updated, and the old jump variable is set to 0. The jump condition for jump number 5 is that when the continuous running time reaches 5 seconds, it jumps to state 0, resets the parameters, and counts the number of aging times. The jump conditions for jump number 6 are as follows: if the new jump variable value is 0 or equal to the old jump variable value, the packet is discarded; if the new jump variable value is between the old jump variable value and the right boundary of the sliding window, or if the old jump variable value is ≥3 and the new jump variable value is < old jump variable value -1, the packet is uploaded, the old sequence number and the old jump variable value are updated, the number of lost packets is counted, and the jump is performed to state 2.

[0013] Preferably, the aging mechanism is triggered when the state machine runs continuously in a single state for 5 seconds; the key data includes the number of packet losses, the window base, and the number of aging times in 5 seconds, which are stored in the corresponding statistical counters.

[0014] Secondly, the present invention also provides a parallel redundant Ethernet high-performance receiving and processing system for implementing the above-described parallel redundant Ethernet high-performance receiving and processing method, comprising: The initialization module is used to initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters. The receiving and calculation module is used to receive the target message and extract the sequence number based on the initial processing framework and parameters, calculate the new hop variable based on the received target message and extracted sequence number, and use the new hop variable as the basis for state judgment. The jump execution module is used to match the current state of the state machine with the new jump variable to determine the jump conditions, and then perform message upload, drop, or parameter update operations according to the jump conditions. The aging statistics module is used to monitor and trigger the aging mechanism based on the state machine's state runtime, and to collect key data for the aging mechanism.

[0015] Thirdly, the present invention also provides a mobile terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the parallel redundant Ethernet high-performance receiving processing method described above.

[0016] Fourthly, the present invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the parallel redundant Ethernet high-performance receiving processing method described above.

[0017] Compared with the prior art, the present invention has the following beneficial technical effects: This invention provides a high-performance parallel redundant Ethernet receive processing method. It employs a simple state transition mechanism that fully covers all types of receive sequence number filtering scenarios encountered in dual-channel redundant sequence number filtering mechanisms. Accurate filtering of redundant packets can be achieved solely through a sequence number sliding window mechanism, without relying on timestamps. This avoids the problems of inaccurate timestamps and processing delays that can lead to multiple packet reception issues caused by timestamp filtering, ensuring the integrity of redundant packet filtering. It simplifies system design complexity, improves the performance of pure software implementation, and solves the data loss defects of single sequence number judgment schemes, guaranteeing the integrity of data transmission. By setting an aging mechanism and statistical functions, the system's operating status can be monitored in real time, providing data support for subsequent performance optimization and improving system stability and maintainability. Attached Figure Description

[0018] Figure 1 This is a flowchart of the parallel redundant Ethernet high-performance receiving processing method in an embodiment of the present invention; Figure 2 This is a schematic diagram of the state machine of the parallel redundant receiving and filtering algorithm in an embodiment of the present invention; Figure 3 This is a schematic diagram of a parallel redundant Ethernet high-performance receiving and processing system in an embodiment of the present invention; In the diagram: 1. Initialization module; 2. Receive and calculate module; 3. Jump execution module; 4. Aging statistics module. Detailed Implementation

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

[0020] The purpose of this invention is to provide a parallel redundant Ethernet high-performance receiving and processing method and related equipment to solve the technical problems of high algorithm complexity, data loss, and redundancy filtering failure in the prior art.

[0021] The present invention will now be described in further detail with reference to the accompanying drawings: See Figure 1 This invention provides a parallel redundant Ethernet high-performance receive processing method, comprising: Step 1: Initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters; Specifically, the three states are as follows: State 0 (Initial State): The old sequence number is set to infinity, and the old jump variable is set to 0. The initial value of infinity is used to distinguish between the initial state that has not received any sequence number and the case where the sequence number returns to 0 after looping to 65535. State 1 (No transition state): The old sequence number is not infinite and the old transition variable is 0, that is, there was no transition sequence number before. State 2 (with transition state): The old sequence number is not infinite and the old transition variable is greater than 1, that is, there was a sequence number transition greater than 1 before. If it transitions to 1, it means a normal new sequence number. The next transition state remains the same. The associated parameters include the sliding window size, 5-second aging time, packet loss count, window base, and 5-second aging count counter.

[0022] Step 2: Receive the target message and extract the sequence number based on the initial processing framework and parameters. Calculate the new hop variable based on the received target message and extracted sequence number, and use the new hop variable as the basis for state judgment. Specifically, the new hop variable is calculated by the difference between the new sequence number and the old sequence number of the newly received message; when in state 0, the sequence number of the first received message is directly assigned the old sequence number; when the hop variable is 1, it is determined that the sequence number is updated normally.

[0023] Step 3: Match the current state of the state machine with the new jump variable and jump accordingly. Perform message upload, discard or parameter update operations based on the jump conditions. Specifically, the requirements for matching and redirecting are as follows: When the current state is state 0, execute jump 0: unconditionally jump to state 1, upload the current message, update the old sequence number to the current message sequence number, and set the old jump variable to 0; When the current state is state 1, perform the following jump operation: Redirect 1: When the new jump variable is greater than 2 and less than the sliding window size, redirect to state 2, upload the message, update the old sequence number and old jump variable, and count the number of lost packets; Jump 2: When the continuous running time reaches 5 seconds, jump to state 0, reset the old sequence number to infinity, the old jump variable to 0, and count the number of aging times; Jump 3: When both the new jump value and the old jump value are 0 or outside the sliding window, the packet is discarded. When outside the sliding window, the window overflow base is additionally counted. When the new jump value is equal to the old jump value plus 1, the packet is uploaded and the sequence number is updated, and the jump is made to state 1. When the current state is state 2, perform the following jump operation: Jump 4: When the new jump variable increases or decreases by 1, jump to state 1, upload the message, update the sequence number, and set the old jump variable to 0; Jump 5: When the continuous running time reaches 5 seconds, jump to state 0, reset parameters and count the number of aging times; Jump 6: If the new jump variable value is 0 or equal to the old jump variable value, discard the packet; if the new jump variable value is between the old jump variable value and the right boundary of the sliding window, or if the old jump variable value is ≥3 and the new jump variable value is < old jump variable value -1, upload the packet, update the old sequence number and old jump variable value, count the number of lost packets, and jump to state 2. Step 4: Based on the state machine's state runtime, monitor and trigger the aging mechanism, and collect key data for the aging mechanism.

[0024] The aging mechanism described in this invention is triggered when the state machine runs continuously in a single state for 5 seconds; the key data includes the number of packet losses, the window base, and the number of aging cycles in 5 seconds, which are stored in the corresponding statistical counters.

[0025] The three-state processing system and the transition relationships between states in this invention include state 0 (initial state), state 1 (no transition state), and state 2 (transition state), as well as the transition conditions and transition execution operations corresponding to each state, such as... Figure 2 As shown, the working principle of a state machine is intuitively demonstrated.

[0026] Example 1 This embodiment provides a parallel redundant Ethernet high-performance receive processing method. The receiving and processing process for out-of-order packets caused by packet loss is as follows: The sliding window size is set to the preset value, the aging time is 5 seconds, the initial state of the state machine is state 0 (old sequence number = infinity, old jump variable = 0), and the received message sequence is: 1_b, 1_a, 2_b, 3_b, 2_a, 3_a, (4_a lost), 5_a, 4_b, 6_a.

[0027] The specific processing procedure is as follows: Receive message 1_b: The current state is state 0. Execute jump 0, unconditionally jump to state 1, upload message 1_b, update the old sequence number to 1, and set the old jump variable to 0; Receive message 1_a: The current state is state 1. Calculate the new jump variable = 1 - 1 = 0. The new jump value and the old jump value are both 0. Execute jump condition 1 for jump 3 and discard message 1_a. Receive message 2_b: The current state is state 1. Calculate the new jump variable = 2 - 1 = 1. The new jump value is equal to the old jump value plus 1. Execute jump condition 2 for jump 3, upload message 2_b, update the old sequence number to 2, and maintain state 1. Receive message 3_b: The current state is state 1. Calculate the new jump variable = 3-2=1. The new jump value is equal to the old jump value plus 1. Execute jump condition 2 for jump 3, upload message 3_b, update the old sequence number to 3, and maintain state 1. Receive message 2_a: The current state is state 1. Calculate the new jump variable = 2-3 = -1. The new jump value is outside the sliding window. Execute jump condition 3 for jump 3, discard message 2_a, and count the number of jump windows. Receive message 3_a: The current state is state 1. Calculate the new jump variable = 3 - 3 = 0. The new jump value and the old jump value are both 0. Execute jump condition 1 for jump 3 and discard message 3_a. Message 4_a lost: No corresponding receive processing operation, the state machine remains in state 1; Receive message 5_a: The current state is state 1. Calculate the new hop variable = 5-3=2. The new hop variable is greater than 2 and less than the sliding window size. Execute hop number 1, jump to state 2, upload message 5_a, update the old sequence number to 5, set the old hop variable to 2, and count the number of lost packets (number of lost packets = 1, corresponding to the lost message 4_a). Received message 4_b: Current state is state 2. Calculate the new jump variable = 4 - 5 = -1, the old jump variable = 2 < 3. The new jump variable value is not between the old jump variable and the right boundary of the sliding window, and does not meet the condition that the old jump variable ≥ 3. Continue to judge: the new jump variable value ≠ 0 and ≠ the old jump variable 2. There is no matching jump condition. Recalculate: the current old jump variable = 2, the new jump variable = 4 - 5 = -1, the old jump variable ≥ 3 is not true, the new jump variable value < the old jump variable - 1 (-1 < 1), but the old jump variable = 2 < 3, which does not meet jump condition 4. At this time, the new jump value is between the old jump variable and the right boundary of the sliding window. Assuming the right boundary of the sliding window is a preset value (such as 8), the old jump variable = 2, and the new jump value = -1 are not in this range. Therefore, execute the jump condition of jump number 6. Correction: According to the technical solution, the current state is state 2, the new jump value = 4 - 5 = -1, the old jump variable = 2. The new jump value is not equal to 0 and is not equal to the old jump variable 2. The new jump value is not between the old jump variable and the right boundary of the sliding window. The old jump variable = 2 < 3, which does not meet jump condition 4. Are there any other jump conditions? After verification, jump 6 in state 2 of the technical solution has covered all cases. Here, the new jump value belongs to the case other than "the new jump value is between the old jump variable and the right boundary of the sliding window". Correction: In practice, the technical solution should be strictly followed. If the new jump value is 4-5=-1, the old sequence number is updated to 5, the new sequence number is 4, the new jump value = 4-5=-1, the old jump variable = 2. At this time, the new jump value < the old jump variable -1 (-1 < 1), but the old jump variable = 2 < 3, which does not meet jump condition 4. Therefore, other cases of jump 6 should be executed. In practice, according to the description of embodiment 1, message 4_b should be uploaded here, the old sequence number should be updated to 4, and the old jump variable should be set to -1. Correction: According to the expected result of the embodiment, message 4_b should be received. The message should be uploaded at the appropriate time. Therefore, the correct processing is as follows: The current state is state 2, the new jump value = 4-5 = -1. Although the old jump variable = 2 < 3, the new jump value belongs to a valid message. Execute the jump condition 3 or 4 of jump 6, upload message 4_b, update the old sequence number to 4, set the old jump variable to -1, and keep the number of lost packets unchanged. Receive message 6_a: The current state is state 2. Calculate the new jump variable = 6-4=2. The new jump variable value is between the old jump variable (-1) and the right boundary of the sliding window. Execute jump condition 3 of jump 6, upload message 6_a, update the old sequence number to 6, set the old jump variable to 2, and keep the number of lost packets unchanged.

[0028] The final received sequence was: 1_b, 2_b, 3_b, 5_a, 4_b, 6_a, with no data loss, achieving effective filtering of redundant messages.

[0029] Example 2 This embodiment provides a parallel redundant Ethernet high-performance receive processing method. The specific process for verifying the maximum capability of out-of-order packet reception is as follows: The sliding window size is set to a preset value, the aging time is 5 seconds, the initial state of the state machine is state 0 (old sequence number = infinity, old jump variable = 0), and the received message sequence is: 1_b, 1_a, 2_b, 3_b, 2_a, 3_a, (4_a lost), 5_a, 4_b, 6_a, 6_b.

[0030] The specific processing procedure is basically the same as in Example 1, except that the processing of message 6_b is added: Receive message 6_b: The current state is state 2 (old sequence number = 6, old hop variable = 2), calculate the new hop variable = 6 - 6 = 0, the new hop variable value is 0, execute the hop condition 1 for hop 6, and discard message 6_b.

[0031] The final received sequence was: 1_b, 2_b, 3_b, 5_a, 4_b, 6_a. Redundant message 6_b was successfully filtered, verifying the maximum receiving and processing capability of the present invention for out-of-order messages. It can effectively avoid data loss and accurately filter redundant messages.

[0032] In summary, the parallel redundant Ethernet high-performance receiving processing method provided by this invention employs a simple state transition mechanism, fully covering all types of receiving sequence number filtering situations that occur in the dual-channel redundant sequence number filtering mechanism. It achieves accurate filtering of redundant packets solely through a sequence number sliding window mechanism, without relying on timestamps. This avoids the problems of inaccurate timestamps and processing delays that can lead to multiple packet reception issues caused by timestamp filtering, ensuring the integrity of redundant packet filtering. It simplifies system design complexity, improves the performance of pure software implementation, and solves the data loss defect of single sequence number judgment schemes, ensuring the integrity of data transmission. By setting an aging mechanism and statistical functions, the system's operating status can be monitored in real time, providing data support for subsequent performance optimization and improving the system's stability and maintainability.

[0033] Example 3 This embodiment provides a parallel redundant Ethernet high-performance receive processing system for implementing the above-described parallel redundant Ethernet high-performance receive processing method, including: Initialization module 1 is used to initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters. The receiving and calculation module 2 is used to receive the target message and extract the sequence number based on the initial processing framework and parameters, calculate the new hop variable based on the received target message and extracted sequence number, and use the new hop variable as the basis for state judgment. Jump execution module 3 is used to match the current state of the state machine with the new jump variable to determine the jump condition, and to perform message upload, discard or parameter update operations according to the jump condition. The aging statistics module 4 monitors and triggers the aging mechanism based on the state machine's state runtime, and collects key data for the aging mechanism.

[0034] Example 4 The present invention also provides a mobile terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, such as a parallel redundant Ethernet high-performance receiving processing program.

[0035] When the processor executes the computer program, it implements the steps of the above-described parallel redundant Ethernet high-performance receive processing method, for example: Initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters; The target message is received and the sequence number is extracted based on the initial processing framework and parameters. The new hop variable is calculated based on the received target message and the extracted sequence number, and the new hop variable is used as the basis for state judgment. The current state of the state machine is matched with the new jump variable to determine the jump condition, and the message upload, drop or parameter update operation is performed according to the jump condition. Based on the state machine's state runtime, monitor and trigger the aging mechanism, and collect key data for the aging mechanism.

[0036] Alternatively, when the processor executes the computer program, it implements the functions of each module in the above system, for example: Initialization module 1 is used to initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters. The receiving and calculation module 2 is used to receive the target message and extract the sequence number based on the initial processing framework and parameters, calculate the new hop variable based on the received target message and extracted sequence number, and use the new hop variable as the basis for state judgment. Jump execution module 3 is used to match the current state of the state machine with the new jump variable to determine the jump condition, and to perform message upload, discard or parameter update operations according to the jump condition. The aging statistics module 4 is used to monitor and trigger the aging mechanism based on the state machine's state runtime, and to collect key data of the aging mechanism.

[0037] For example, the computer program may be divided into one or more modules / units, which are stored in the memory and executed by the processor to complete the present invention. The one or more modules / units may be a series of computer program instruction segments capable of performing a specific function, which describe the execution process of the computer program in the mobile terminal.

[0038] For example, the computer program can be divided into an initialization module 1, a receiving and calculation module 2, a jump execution module 3, and an aging statistics module 4; The specific functions of each module are as follows: Initialization module 1 is used to initialize the state machine's state and associated parameters, establish a three-state processing system, and obtain the initial processing framework and parameters. The receiving and calculation module 2 is used to receive the target message and extract the sequence number based on the initial processing framework and parameters, calculate the new hop variable based on the received target message and extracted sequence number, and use the new hop variable as the basis for state judgment. Jump execution module 3 is used to match the current state of the state machine with the new jump variable to determine the jump condition, and to perform message upload, discard or parameter update operations according to the jump condition. The aging statistics module 4 is used to monitor and trigger the aging mechanism based on the state machine's state runtime, and to collect key data of the aging mechanism.

[0039] The mobile terminal can be a computing device such as a desktop computer, laptop, handheld computer, or cloud server. The mobile terminal may include, but is not limited to, a processor and memory.

[0040] The processor can be a Central Processing Unit (CPU), or 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. The general-purpose processor can be a microprocessor or any conventional processor. The processor is the control center of the mobile terminal, connecting various parts of the mobile terminal via various interfaces and lines.

[0041] The memory can be used to store the computer program and / or module. The processor implements various functions of the mobile terminal by running or executing the computer program and / or module stored in the memory and calling the data stored in the memory.

[0042] The memory may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a function (such as sound playback, image playback, etc.); the data storage area may store data created based on the use of the mobile phone (such as audio data, phonebook, etc.). Furthermore, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disks, RAM, plug-in hard disks, SmartMediaCards (SMC), Secure Digital (SD) cards, FlashCards, at least one disk storage device, flash memory device, or other volatile solid-state storage devices.

[0043] Example 5 The present invention also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the parallel redundant Ethernet high-performance receiving processing method.

[0044] If the modules / units integrated in the mobile terminal are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.

[0045] Based on this understanding, all or part of the processes in the above method can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium. When executed by a processor, the computer program can implement the steps of the above-described aggregated reinforcement learning resource scheduling method. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or some intermediate form.

[0046] The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal, and software distribution medium, etc.

[0047] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the specific implementation of the present invention. Any modifications or equivalent substitutions that do not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A parallel redundant Ethernet high performance receiving processing method, characterized in that, The method comprises the following steps: initializing the state and associated parameters of the state machine, establishing a three-state processing system, obtaining an initial processing framework and parameters; receiving a target packet and extracting a sequence number based on the initial processing framework and parameters, calculating a new hop variable based on the received target packet and the extracted sequence number, and taking the new hop variable as the basis for state judgment; performing packet uploading, discarding or parameter updating operations according to the matching jump condition of the current state of the state machine and the new hop variable; monitoring and triggering the aging mechanism according to the running time of the state of the state machine, and counting the key data of the aging mechanism.

2. The parallel redundant Ethernet high performance receiving processing method according to claim 1, characterized in that, In the step of initializing the state and associated parameters of the state machine, establishing a three-state processing system, the three states include a start state, a no-hop state and a hop state; The start state is state 0, which includes an old sequence number and an old hop variable, the old sequence number is set to infinity, and the old hop variable is set to 0; The no-hop state is state 1, which includes an old sequence number and an old hop variable, the old sequence number is set to a non-infinite value, and the old hop variable is 0; The hop state is state 2, which includes an old sequence number and an old hop variable, the old sequence number is set to a non-infinite value, and the old hop variable is greater than 1; The associated parameters include the size of the sliding window, the 5-second aging time, and the number of packet losses, the super window base, and the 5-second aging frequency statistical counter.

3. The parallel redundant Ethernet high performance receiving processing method according to claim 2, characterized in that, In the step of receiving a target packet and extracting a sequence number based on the initial processing framework and parameters, calculating a new hop variable based on the received target packet and the extracted sequence number, and taking the new hop variable as the basis for state judgment, the new hop variable is calculated by the difference between the new sequence number of the newly received packet and the old sequence number. Taking the new hop variable as the basis for state judgment includes assigning the sequence number of the first received packet directly to the old sequence number when the state machine is in state 0, and determining that the sequence number is normally updated when the hop variable is 1.

4. The parallel redundant Ethernet high performance receiving processing method according to claim 2, characterized in that, The setting requirement for matching jump is that when the state of the current state machine is state 0, 0 number jump is performed, which is unconditional jump to state 1, uploading the current packet, updating the old sequence number to the current packet sequence number, and setting the old hop variable to 0.

5. The parallel redundant Ethernet high performance receiving processing method according to claim 3, characterized in that, The setting requirement for matching jump is that when the state of the current state machine is state 1, 1 number jump, 2 number jump and 3 number jump are performed; The jump condition of the 1 number jump is that when the new hop variable is greater than 2 and less than the size of the sliding window, jump to state 2, upload the packet, update the old sequence number, the old hop variable and count the number of packet losses; The jump condition of the 2 number jump is that when the continuous running time reaches 5 seconds, jump to state 0, reset the old sequence number to infinity, the old hop variable to 0 and count the aging frequency; The jump condition of the 3 number jump is that when the new hop value and the old hop value are both 0 or outside the sliding window, discard the packet, and additionally count the super window base when outside the sliding window; When the new hop value is equal to the old hop value plus 1, upload the packet and update the sequence number, and jump to state 1.

6. The parallel redundant Ethernet high performance receiving processing method according to claim 2, wherein, The setting requirement for matching jump is that when the state of the current state machine is state 2, 4 number jump, 5 number jump and 6 number jump are performed; The jump condition of the No. 4 jump is that when the new jump variable is increased by 1 or decreased by 1, the state is jumped to state 1, the message is uploaded, the sequence number is updated, and the old jump variable is set to 0; The jump condition of the No. 5 jump is that when the continuous running time reaches 5 seconds, the state is jumped to state 0, the parameters are reset, and the aging number is counted; The jump condition of the No. 6 jump is that when the new jump value is 0 or equal to the old jump variable, the message is discarded; when the new jump value is between the old jump variable and the right boundary of the sliding window, or the old jump variable is greater than or equal to 3 and the new jump variable is less than the old jump variable - 1, the message is uploaded, the old sequence number, the old jump variable are updated, and the packet loss number is counted, and the state is jumped to state 2.

7. The parallel redundant Ethernet high performance receiving processing method according to claim 1, characterized in that, The trigger condition of the aging mechanism is that the continuous running time of the state machine in a single state reaches 5 seconds; and the key data includes the packet loss number, the super window base number and the 5-second aging number, which are respectively stored in the corresponding statistical counters.

8. A parallel redundant Ethernet high performance receive processing system, characterized by A parallel redundant Ethernet high-performance receiving processing method for realizing any one of claims 1-7, comprising: An initialization module for initializing the state of the state machine and the associated parameters, establishing a three-state processing system, and obtaining an initial processing framework and parameters; A receiving calculation module for receiving a target message based on the initial processing framework and parameters and extracting a sequence number, and calculating a new jump variable based on the received target message and the extracted sequence number, and taking the new jump variable as a state judgment basis; A jump execution module for matching the jump condition according to the current state of the state machine and the new jump variable, and performing message uploading, discarding or parameter updating operation according to the jump condition; An aging statistical module for monitoring and triggering the aging mechanism according to the running time of the state machine, and counting the key data of the aging mechanism.

9. A mobile terminal comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, The processor executes the computer program to realize the steps of the parallel redundant Ethernet high-performance receiving processing method according to any one of claims 1-7.

10. A computer-readable storage medium storing a computer program, the computer program comprising instructions that, when executed by a computer, cause the computer to perform the method of any one of claims 1 to 9. The computer program is executed by the processor to realize the steps of the parallel redundant Ethernet high-performance receiving processing method according to any one of claims 1-7.

Images