A method, apparatus, electronic device, and storage medium for marking ECNs in a RoCE network.

By calculating packet hash values ​​in the RoCE network and using a counting table to determine conditions, the problems of invalid and over-marking of ECN tags in the prior art are solved, achieving fast and accurate ECN marking and improving congestion control.

CN116318626BActive Publication Date: 2026-01-30SUZHOU SHENGKE TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310124240.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-02-16
Publication Date
2026-01-30
Estimated Expiration
2043-02-16

AI Technical Summary

Technical Problem

Existing RoCE network ECN labeling methods suffer from invalid and over-labeling, resulting in poor congestion control and high implementation complexity, making it impossible to label ECNs quickly and accurately.

Method used

By calculating the hash value of the message and using the queue hash count table, queue tag count table, and queue hash tag periodic table, it is determined whether the ECN tagging conditions are met, thereby achieving accurate and fast ECN tagging of messages in the RoCE network and reducing invalid and over-tags.

Benefits of technology

It enables accurate and fast ECN marking of packets in a session within a RoCE network, reducing invalid and over-marking and improving the effectiveness and efficiency of congestion control.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116318626B_ABST
    Figure CN116318626B_ABST
Patent Text Reader

Abstract

This invention discloses a method, apparatus, electronic device, and storage medium for marking ECNs in a RoCE network. The method includes receiving a packet and calculating a hash value based on the information carried in the packet; further, using the hash value to look up a queue hash count table and incrementing the corresponding queue hash count; determining whether a random marking event has occurred, and if so, incrementing the corresponding queue waiting mark count in the queue marking count table; determining whether the packet meets the ECN marking conditions, and if so, marking the packet with ECN and forwarding it, decrementing the corresponding queue hash count and queue waiting mark count, and setting the corresponding queue hash mark value in the queue hash marking period table to a second preset value. This invention can accurately and quickly mark ECNs for packets in a session and reduce invalid and excessive marking.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of network communication technology, and in particular to a method for marking ECNs in a RoCE network, as well as an apparatus, electronic device, and storage medium for implementing the method. Background Technology

[0002] RDMA (Remote Direct Memory Access) is a direct memory access technology that transfers data directly from the memory of one computer to the memory of another. Data is quickly moved from one system to the memory of a remote system without the intervention of the operating systems of both systems or the time-consuming processing of the processor, ultimately achieving the effects of high bandwidth, low latency, and low resource utilization.

[0003] RoCEv2 is a network layer protocol that encapsulates InfiniBand raw messages based on IP / UDP protocols and deploys RDMA services through IP routing networks. ROCEv2 employs a Go-Back-N retransmission mechanism, meaning that if a received frame has sequence numbers 1, 2, 3, 5, 6, 7, 8, 9, 10, ..., 4, it will revert to sequence number 4 and retransmit the sequence 4, 5, 6, 7, 8, 9, 10, ... This mechanism means that if out-of-order packets occur during ROCEv2 transmission, transmission performance will drastically degrade. Therefore, congestion control is crucial in ROCEv2 networks.

[0004] In RoCE V2 networks, the widely used congestion control algorithm is DCQCN (Data Center Quantized Congestion Notification). Initially, the network interface card (NIC) sends data streams at maximum capacity. Network devices monitor the congestion level of network ports and announce this level to the receiving NIC via the ECN bit in the IP header. Upon receiving the ECN flag, the receiving NIC sends a CNP flag to the sending NIC. Upon receiving the CNP flag, the sending NIC implements rate reduction measures. The effectiveness, accuracy, and real-time nature of the network device's ECN flag directly impact the congestion control outcome.

[0005] Existing network devices use WRED (Weighted Random Early Detection) in switch queues for probabilistic, content-insensitive packet labeling of ECNs. During implementation, WRED parameters are first configured, including the initial labeling queue depth, maximum probability labeling depth, and maximum labeling probability. When the queue depth is less than the initial labeling queue depth, no labeling occurs; when the queue depth is between the initial and maximum probability labeling depths, probabilistic labeling is performed, with the probability increasing as the queue depth increases, from the initial probability to the maximum labeling probability. Currently, to achieve faster labeling, more factors are typically considered to determine different WRED parameters. However, WRED alone is prone to synchronization effects, leading to over-labeling and slowdowns. Furthermore, its implementation complexity is high, requiring a 5-tuple entry to read the WRED parameter table, and its enqueue-based labeling method cannot achieve the fastest packet labeling speed.

[0006] The information disclosed in this background section is intended only to enhance the understanding of the overall background of the invention and should not be construed as an admission or in any way implying that the information constitutes prior art known to those skilled in the art. Summary of the Invention

[0007] The purpose of this invention is to provide a method, apparatus, electronic device, and storage medium for marking ECNs in a RoCE network, which can accurately and quickly mark ECNs for packets in a session and reduce invalid and excessive marking.

[0008] To achieve the above objectives, embodiments of the present invention provide a method for marking ECNs in a RoCE network, the method comprising:

[0009] Receive messages and calculate hash values ​​based on the information carried in the messages;

[0010] The queue hash count table is looked up based on the RoCE queue number into which the message enters and its corresponding hash value, and the corresponding queue hash count value is incremented by one.

[0011] Determine whether a random tagging event has occurred;

[0012] In response to a random marking event, increment the corresponding queue waiting mark count in the queue mark count table by one;

[0013] Determine whether the message meets the ECN marking conditions;

[0014] In response to the ECN marking condition being met, the message is marked with ECN and forwarded, and the corresponding queue hash count value is decremented by one, the queue wait mark count value is decremented by one, and the corresponding queue hash mark value in the queue hash mark periodic table is set to the second preset value.

[0015] In one or more embodiments of the present invention, the information includes the source IP address and the destination IP address.

[0016] In one or more embodiments of the present invention, determining whether a random tagging event has occurred includes:

[0017] Determine whether the depth of the RoCE queue containing the message is between the starting marking queue depth and the maximum probability marking depth;

[0018] In response to determining that a random marking event has occurred between the initial marking queue depth and the maximum probability marking depth.

[0019] In one or more embodiments of the present invention, the ECN marking conditions include: the queue waiting mark count value corresponding to the message is greater than a preset value, the total queue depth is greater than the starting mark queue depth, the queue hash count value is greater than the marking threshold, the queue hash mark value is a first preset value, and the original ECN value of the message is unmarked.

[0020] In one or more embodiments of the present invention, the hash counter table is configured with several entries for each RoCE queue, each entry corresponding to the number and hash value of a RoCE queue, and each entry is used to store the queue hash counter value.

[0021] In one or more embodiments of the present invention, the queue tag count table is configured with multiple entries, each entry corresponding to a RoCE queue, and each entry stores the queue wait tag count value.

[0022] In one or more embodiments of the present invention, the queue hash tag periodic table is configured with several entries for each RoCE queue, each entry corresponding to the number and hash value of a RoCE queue, and each entry is used to store the queue hash tag value indicating whether a session has been tagged.

[0023] An embodiment of the present invention provides an apparatus for marking an ECN in a RoCE network, the apparatus comprising:

[0024] The hash calculation module is used to receive messages and calculate hash values ​​based on the information carried in the messages.

[0025] The queue hash counting module is used to look up the queue hash counting table based on the number of the RoCE queue into which the message enters and its corresponding hash value, and increment the corresponding queue hash count value by one;

[0026] The first judgment module is used to determine whether a random marking event has occurred;

[0027] The queue wait flag counting module is used to increment the corresponding queue wait flag count value in the queue flag counting table by one in response to the occurrence of a random flag event.

[0028] The second judgment module is used to determine whether the message meets the ECN marking conditions;

[0029] The marking module is used to mark a packet with ECN and forward it in response to the ECN marking condition being met, and to decrement the corresponding queue hash count value by one, decrement the queue waiting mark count value by one, and set the corresponding queue hash mark value in the queue hash mark periodic table to the second preset value.

[0030] An embodiment of the present invention provides an electronic device, the electronic device comprising:

[0031] At least one processor; and

[0032] At least one memory is coupled to the at least one processor and stores a computer program for execution by the at least one processor, which, when executed by the at least one processor, causes the electronic device to perform the method described above.

[0033] In one or more embodiments of the present invention, a computer-readable storage medium is characterized in that it stores a computer program thereon, which, when executed by a machine, implements the method described above.

[0034] Compared with existing technologies, the present invention can accurately and quickly mark ECNs for messages in a session and reduce invalid and excessive marking. Attached Figure Description

[0035] Figure 1 This is a flowchart of a method for marking an ECN in a RoCE network according to an embodiment of the present invention;

[0036] Figure 2 This is a message processing flowchart according to an embodiment of the present invention;

[0037] Figure 3 This is a structural diagram of a device for marking ECNs in a RoCE network according to an embodiment of the present invention. Detailed Implementation

[0038] The specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings, but it should be understood that the scope of protection of the present invention is not limited to the specific embodiments.

[0039] Unless otherwise expressly stated, throughout the specification and claims, the term "comprising" or its variations such as "including" or "comprises" shall be understood to include the stated elements or components without excluding other elements or other components.

[0040] like Figures 1 to 2As shown, a method for marking ECNs in a RoCE network according to a preferred embodiment of the present invention can accurately and quickly mark ECNs for packets in a session and reduce invalid and excessive marking. Specifically, a method for marking ECNs in a RoCE network includes the following steps:

[0041] S100: Receives the message and calculates the hash value based on the information carried in the message;

[0042] Specifically, in a RoCE network, network communication devices engage in sessions to exchange information. During these sessions, relevant information is carried in packets to achieve the final information exchange. To achieve the accurate and rapid marking of ECNs and reduce invalid and excessive marking as described in this invention, this invention first calculates hash values ​​using the information carried in the packets. These hash values ​​are then used to distinguish different sessions, and the ECN is accurately marked for each session. In implementation, the network communication device parses the packets received from each session to obtain the relevant information carried in the packets. This information includes, but is not limited to, source IP address information and destination IP address information. After obtaining the information carried in the packets, a hash calculation is performed using this information to obtain the corresponding hash value.

[0043] S200: Based on the RoCE queue number and its corresponding hash value, look up the queue hash count table and increment the corresponding queue hash count by one.

[0044] Specifically, packets received by the network communication device enter different RoCE queues. To facilitate accurate ECN marking later, this invention counts the number of packets contained in different sessions within each RoCE queue. This allows for subsequent determination of whether packet marking is necessary, thereby achieving accurate ECN marking. In implementation, a queue hash count table is established in the network communication device to record the number of packets contained in different sessions within each RoCE queue.

[0045] Furthermore, such as Figure 2As shown, the queue hash count table has several entries configured for each RoCE queue. Each entry corresponds to a session, and each entry can be used to store the queue hash count value, which corresponds to the number of packets contained in the session. Different sessions can be distinguished by hash values. In specific implementation, the corresponding entry can be determined by the RoCE queue number and hash value, so that the corresponding queue hash count value can be stored in that entry. That is, each entry corresponds to a RoCE queue number and hash value. By indexing the RoCE queue number and hash value into which the packet enters, the corresponding entry can be retrieved. For example, if n entries are configured for RoCE queue 0, the keys corresponding to each entry are (queue 0, hash0), (queue 1, hash1), ..., (queue n, hash0). In implementation, the first entry configured for RoCE queue 0 is retrieved using the key (queue 0, hash0), and the number of packets of the corresponding session can be stored in that entry.

[0046] Furthermore, when counting the number of packets contained in different sessions in different RoCE queues, when a packet enters the queue, the corresponding entry can be determined using the RoCE queue number and its corresponding hash value, and the queue hash count stored in that entry can be incremented by one; when a packet leaves the queue, the corresponding entry can also be determined using the RoCE queue number and its corresponding hash value, and the queue hash count stored in that entry can be decremented by one, thus ultimately achieving the counting of the number of packets.

[0047] S300, determine whether a random marking event has occurred;

[0048] S400, in response to the occurrence of a random marking event, increments the corresponding queue waiting mark count value in the queue mark count table by one;

[0049] Specifically, as the number of packets received by the network communication device increases, the number of packets in each RoCE queue also increases, meaning the queue depth of each RoCE queue also increases. Since the network communication device uses WRED (Weighted Random Early Detection) to probabilistically mark ECNs without the packet content being detected, a random marking event is triggered when the RoCE queue depth is between the initial marking depth and the maximum probability marking depth. This means the network communication device probabilistically marks the ECN, with the probability increasing as the queue depth increases, from the initial probability to the maximum marking probability.

[0050] Furthermore, to delay the marking of the first message of a session, this invention utilizes a queue marking counter table to count the number of waits for each RoCE queue. This allows for subsequent use of the wait count of the RoCE queue to determine whether to mark the message with an ECN. Specifically, only RoCE queues with a wait count greater than a preset value will mark their messages with an ECN; otherwise, no ECN will be marked, thus achieving delayed marking of the first message of a session. Figure 2 As shown, the queue tag count table here is configured with multiple entries, each entry corresponds to a RoCE queue, and each entry stores the queue wait tag count value, which can represent the number of times the RoCE queue waits.

[0051] Furthermore, when a random marking event occurs, the queue waiting mark count value corresponding to the RoCE queue in the queue marking count table is incremented by one. And when a packet that meets the marking criteria is scheduled out of the RoCE queue, the queue waiting mark count value corresponding to that RoCE queue is decremented by one. Additionally, when a packet is dequeued, the current queue length is determined for each packet. If the queue length is less than the minimum marking queue depth, the corresponding count is reduced by the amount of reduction. Simultaneously, the queue depth is periodically scanned using a timer. If the queue depth decreases, the waiting mark count is reduced by the reduction interval; if the queue length is less than the minimum marking queue depth, the corresponding count is reduced by the amount of reduction.

[0052] S500, determine whether the message meets the ECN marking conditions;

[0053] S600, in response to meeting the ECN marking condition, marks the packet with ECN and forwards it, decrements the corresponding queue hash count by one, decrements the queue wait mark count by one, and sets the corresponding queue hash mark value in the queue hash mark periodic table to the second preset value.

[0054] Specifically, to avoid excessive marking of the same session, a queue hash marking periodic table is established in the network communication device. This queue hash marking periodic table is used to indicate whether a session in a certain RoCE queue has been marked. Specifically, such as... Figure 2As shown, in the queue hash tag periodic table, each RoCE queue has several entries. Each entry corresponds to a session, and each entry stores a queue hash tag value indicating whether the session has been tagged. When a session has been tagged, the queue hash tag value is a first preset value (e.g., 0); when a session has not been tagged, the queue hash tag value is a second preset value (e.g., 1). In implementation, the corresponding entry can be determined using the RoCE queue number and hash value, allowing the corresponding queue hash tag value to be stored in that entry. That is, each entry corresponds to a RoCE queue number and hash value, and the corresponding entry can be retrieved by using the RoCE queue number and hash value as a key for indexing. For example, if n entries are configured for RoCE queue 0, each entry corresponds to the keys (queue 0, hash 0), (queue 1, hash 1), ..., (queue n, hash 0). In implementation, the first entry configured for RoCE queue 0 is retrieved using the key (queue 0, hash 0), and the corresponding queue hash tag value can then be stored in that entry.

[0055] Furthermore, after performing corresponding counts using the queue hash count table and the queue mark count table, the values ​​recorded in these tables, along with the values ​​recorded in the queue hash mark periodic table, can be used to determine whether a message meets the ECN marking conditions. These ECN marking conditions include: the queue waiting mark count for the message being greater than a preset value; the total queue depth being greater than the WRED starting mark depth; the queue hash count being greater than a mark threshold; the queue hash mark value being a first preset value; and the original ECN value of the message being unmarked. Only when all of the above conditions are met can the message be determined to meet the ECN marking conditions; otherwise, the message is determined not to meet the ECN marking conditions.

[0056] Furthermore, when a message meets the ECN marking conditions, the message is marked with ECN and forwarded, and the corresponding queue hash count value is decremented by one, the queue waiting mark count value is decremented by one, and the corresponding queue hash mark value in the queue hash mark periodic table is set to the second preset value.

[0057] In this embodiment, when a packet meets the ECN marking conditions and is marked with ECN, the corresponding queue hash mark value in the queue hash mark periodic table is set to a second preset value. Simultaneously, a timer is used to periodically scan the queue hash mark periodic table to set the queue hash mark value corresponding to the packet to a first preset value.

[0058] like Figure 3As shown, this invention also discloses an apparatus for marking ECNs in a RoCE network, which can implement the method described above, and can accurately and quickly mark ECNs for packets in a session while reducing invalid and excessive marking. Specifically, the apparatus for marking ECNs in a RoCE network includes: a hash calculation module, a queue hash counting module, a first judgment module, a queue waiting mark counting module, a second judgment module, and a marking module. The hash calculation module receives packets and calculates hash values ​​based on the information carried in the packets; the queue hash counting module looks up the queue hash counting table based on the RoCE queue number the packet enters and its corresponding hash value, and increments the corresponding queue hash count by one; the first judgment module determines whether a random marking event has occurred; the queue waiting mark counting module increments the corresponding queue waiting mark count in the queue mark counting table when a random marking event occurs; the second judgment module determines whether the packet meets the ECN marking conditions; and the marking module, in response to meeting the ECN marking conditions, marks the packet with an ECN and forwards it, decrements the corresponding queue hash count by one, decrements the queue waiting mark count by one, and sets the corresponding queue hash mark value in the queue hash marking period table to a second preset value. The modules described above correspond one-to-one with the steps described above. For details on how each module implements its corresponding function, please refer to the above description. They will not be repeated here.

[0059] This invention provides a preferred embodiment of an electronic device, which may include, but is not limited to, personal computers, server computers, workstations, desktop computers, laptop computers, notebook computers, mobile electronic devices, smartphones, tablet computers, cellular phones, personal digital assistants (PDAs), handheld devices, messaging devices, wearable electronic devices, consumer electronic devices, etc. This electronic device can implement the aforementioned method for marking ECNs in a RoCE network, enabling accurate and rapid marking of ECNs for packets in a session and reducing invalid and excessive marking. Specifically, the electronic device includes at least one memory, at least one processor, and a computer program. The at least one memory is coupled to the at least one processor, wherein the computer program is stored in the memory and can be run on the processor, such as a program for marking ECNs in a RoCE network. In implementation, when the processor executes the computer program, it can implement various steps in the aforementioned method, such as receiving packets and calculating hash values ​​based on the information carried in the packets.

[0060] The computer program here can be divided into one or more units, which are stored in the memory and executed by the memory to complete the present invention. The one or more 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 electronic device.

[0061] It should be noted that the electronic devices mentioned here include, but are not limited to, the memory, processor, and computer program described above. They may also include other devices, such as input devices for inputting instructions (e.g., keyboards), displays for displaying negotiation results, communication interfaces, etc. These components communicate with each other via a bus.

[0062] A preferred embodiment of the present invention provides a computer-readable storage medium storing a computer program. When executed by a processor, this computer program implements a method for marking ECNs in a RoCE network, enabling accurate and rapid marking of ECNs in packets within a session and reducing invalid and excessive marking. The computer program includes computer program code, which may be in the form of source code, an executable file, or some intermediate form. The computer-readable medium may include any entity or device capable of carrying the computer program code, such as a recording medium, USB flash drive, external hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), etc.

[0063] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0064] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0065] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0066] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0067] The foregoing description of specific exemplary embodiments of the invention is for illustrative and explanatory purposes. These descriptions are not intended to limit the invention to the precise forms disclosed, and it will be apparent that many changes and variations can be made in accordance with the foregoing teachings. The exemplary embodiments were chosen and described in order to explain the specific principles of the invention and its practical application, thereby enabling those skilled in the art to implement and utilize various different exemplary embodiments of the invention, as well as various different choices and variations. The scope of the invention is intended to be defined by the claims and their equivalents.

Claims

1. A method for marking ECN in a RoCE network, the method comprising: The method comprises: receiving a packet and calculating a hash value according to information carried by the packet; finding a queue hash count table according to the number of the RoCE queue into which the packet enters and the corresponding hash value, and adding one to the corresponding queue hash count value; determining whether a random marking event occurs, which comprises determining whether the RoCE queue in which the packet is located has a queue depth between a start marking queue depth and a maximum probability marking depth, and determining that the random marking event occurs when the determination is positive; in response to the random marking event occurring, adding one to the corresponding queue marking count value in the queue marking count table; determining whether the packet satisfies an ECN marking condition, which comprises the corresponding queue marking count value of the packet being greater than a preset value, the total queue depth being greater than the start marking queue depth, the queue hash count value being greater than a marking threshold, the queue hash marking value being a first preset value, and the original ECN value of the packet being unmarked; in response to the ECN marking condition being satisfied, marking the packet with ECN and forwarding the packet, and reducing one from the corresponding queue hash count value, reducing one from the queue marking count value, and setting the corresponding queue hash marking value in the queue hash marking period table to a second preset value.

2. The method of claim 1, wherein, The information comprises a source IP address and a destination IP address.

3. The method of claim 1, wherein, The queue hash count table is configured with a plurality of entries for each RoCE queue, each entry corresponding to the number and hash value of an RoCE queue, and each entry being used to store a queue hash count value.

4. The method of claim 1, wherein, The queue marking count table is configured with a plurality of entries, each entry corresponding to an RoCE queue, and each entry being used to store a queue marking count value.

5. The method of claim 1, wherein, The queue hash marking period table is configured with a plurality of entries for each RoCE queue, each entry corresponding to the number and hash value of an RoCE queue, and each entry being used to store a queue hash marking value indicating whether a session is marked.

6. An apparatus for marking ECN in a RoCE network, the apparatus comprising: The device comprises: a hash calculation module configured to receive a packet and calculate a hash value according to information carried by the packet; a queue hash count module configured to find a queue hash count table according to the number of the RoCE queue into which the packet enters and the corresponding hash value, and add one to the corresponding queue hash count value; a first determination module configured to determine whether a random marking event occurs, which comprises determining whether the RoCE queue in which the packet is located has a queue depth between a start marking queue depth and a maximum probability marking depth, and determining that the random marking event occurs when the determination is positive; a queue marking count module configured to add one to the corresponding queue marking count value in the queue marking count table in response to the random marking event occurring; a second determination module configured to determine whether the packet satisfies an ECN marking condition, which comprises the corresponding queue marking count value of the packet being greater than a preset value, the total queue depth being greater than the start marking queue depth, the queue hash count value being greater than a marking threshold, the queue hash marking value being a first preset value, and the original ECN value of the packet being unmarked; The marking module marks and forwards the packet in response to the ECN marking condition being met, decrements the corresponding queue hash count value, decrements the queue waiting marking count value, and sets the corresponding queue hash marking value in the queue hash marking period table to a second preset value.

7. An electronic device, comprising: The electronic device includes: at least one processor; and at least one memory coupled to the at least one processor and storing a computer program for execution by the at least one processor, which, when executed by the at least one processor, causes the electronic device to perform the method of any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, A computer program stored thereon, which, when executed by a machine, implements the method of any one of claims 1 to 5.

Citation Information

Patent Citations

  • Message marking method and device

    CN113765812A

  • Data transmission method and device of multi-protocol hybrid network, and storage medium

    CN114079638A