WO2011120467A2 - Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau - Google Patents

Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau Download PDF

Info

Publication number
WO2011120467A2
WO2011120467A2 PCT/CN2011/073811 CN2011073811W WO2011120467A2 WO 2011120467 A2 WO2011120467 A2 WO 2011120467A2 CN 2011073811 W CN2011073811 W CN 2011073811W WO 2011120467 A2 WO2011120467 A2 WO 2011120467A2
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
preserving
network
packet
order
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2011/073811
Other languages
English (en)
Chinese (zh)
Other versions
WO2011120467A3 (fr
Inventor
尹永宁
佟兴
高亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN2011800005300A priority Critical patent/CN102204183A/zh
Priority to PCT/CN2011/073811 priority patent/WO2011120467A2/fr
Publication of WO2011120467A2 publication Critical patent/WO2011120467A2/fr
Publication of WO2011120467A3 publication Critical patent/WO2011120467A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9084—Reactions to storage capacity overflow
    • H04L49/9089—Reactions to storage capacity overflow replacing packets in a storage arrangement, e.g. pushout
    • H04L49/9094—Arrangements for simultaneous transmit and receive, e.g. simultaneous reading/writing from/to the storage element
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers

Definitions

  • the embodiments of the present invention relate to the field of communications, and in particular, to a message order-preserving processing method, a sequence-preserving coprocessor, and a network device. Background technique
  • the so-called message out-of-order refers to the sequence of messages sent by the sender, which is forwarded by several intermediate nodes, but does not arrive at the destination in the original order.
  • Message out of order can seriously affect the performance of some network applications.
  • TCP Transmission Control Protocol
  • CRTP Compressed Real-Time Protocol
  • HEADER messages are synchronized to the context, resulting in greatly reduced compression efficiency. Therefore, in order to improve the efficiency of network operation, existing communication standards require network devices, such as routers, to avoid packet out of order.
  • the embodiment of the invention provides a message order-preserving processing method, a sequence-preserving co-processor and a network device, in order to perform a sequence-preserving process on a message in a case where a multi-thread asynchronous processing of a message.
  • the embodiment of the invention provides a message order processing method, which includes:
  • An embodiment of the present invention provides a save order coprocessor, including:
  • a receiving module configured to receive a network packet sent by a thread, where the network packet includes a packet identifier
  • a determining module configured to determine a sequence-preserving stream corresponding to the “3 ⁇ 4” identifier, where the sequence-preserving stream corresponds to a channel of the network device, and the packet processing sequence included in the sequence-preserving stream is a network packet entering The sequence of the channels;
  • the order-preserving processing module is configured to perform the order-preserving processing on the network packet according to the packet processing sequence.
  • An embodiment of the present invention provides a network device, including: a network processor unit, a sequence-preserving coprocessor, and a co-processor that are sequentially connected, and the pre-order coprocessor uses the above-mentioned order-preserving coprocessor.
  • the corresponding sequence-preserving stream may be determined according to the packet identifier included in the network packet sent by the thread, and the network packet is passed through the order-preserving stream according to the sequence of the network packet included in the sequence-preserving stream. You can sort the sending order of network packets to enter network devices with network packets.
  • FIG. 1 is a flowchart of an embodiment of a message order processing method according to the present invention.
  • FIG. 2 is a flowchart of another embodiment of a message order processing method according to the present invention.
  • FIG. 3 is a schematic structural diagram of a correspondence between a message identifier and a sequence flow generated in the embodiment shown in FIG. 2;
  • FIG. 4 is a flowchart of still another embodiment of a message order processing method according to the present invention.
  • FIG. 5 is a schematic diagram of a processing procedure of the embodiment shown in FIG. 4 in a scenario
  • FIG. 6 is a schematic structural diagram of an embodiment of a sequence-preserving coprocessor according to the present invention.
  • FIG. 7 is a schematic structural diagram of another embodiment of a sequence-preserving coprocessor according to the present invention.
  • FIG. 8 is a schematic structural diagram of still another embodiment of a sequence-sequencing coprocessor according to the present invention.
  • FIG. 9 is a schematic structural diagram of an embodiment of a network device according to the present invention. detailed description
  • FIG. 1 is a flowchart of an embodiment of a message sequence processing method according to the present invention. As shown in FIG. 1, the method in this embodiment may include:
  • Step 101 Receive a network packet sent by a thread, where the network packet includes a packet identifier.
  • the order Co-Processor (hereinafter referred to as 0CP) can receive the network packet sent by the thread, and the network packet can include the packet identifier, which is not limited in this embodiment.
  • the OCP in this embodiment may be implemented by using an Application Specific Interrupted Circuits (ASIC) technology, and may be packaged with a Network Processor Unit (hereinafter referred to as NPU).
  • ASIC Application Specific Interrupted Circuits
  • NPU Network Processor Unit
  • a network device such as a router
  • a network message When a network packet enters each channel, it has a sequence, that is, when transmitting in each channel, the sequence of network packets is correct, but the packets of each channel are allocated to multiple threads for processing, The processing of the thread is affected by many factors.
  • the network packets sent from each thread are out of order. Therefore, the network packets received by the OCP are out of order.
  • Step 102 Determine a sequence-preserving stream corresponding to the packet identifier, where the sequence-preserving stream corresponds to a channel of the network device, and the packet processing sequence included in the sequence-preserving stream is that the network packet enters the channel. In order.
  • the embodiment may include multiple sequence-preserving streams, and each of the sequence-preserving streams corresponds to one channel of the network device. Therefore, the number of the sequence-preserving streams in this embodiment may be equal to the channel channel of the network device.
  • the sequence-preserving stream may include the packet identifier of all the network packets entering the N-th channel, and the packet identifier may be in accordance with the corresponding network. The order in which the packets enter the Nth channel is arranged.
  • the OCP can monitor the packets received by each channel. For each channel, the OCP can record the sequence in which the network packets are received. According to the sequence, the OCP can generate the sequence-preserving stream corresponding to the channel. It is to be noted that the embodiment does not limit how the OCP can learn the sequence of the network packets entering the channel. The technical personnel can also use any means to monitor the sequence of the network packets entering the channel and notify the OCP. Therefore, when the pre-ordering stream is used to perform the order-preserving processing on the network packet, the out-of-order network ⁇ ⁇ can be restored to the order in which the network ⁇ ⁇ enters the channel. In a specific implementation, the OCP may extract the packet identifier from each network packet.
  • the OCP may determine the sequence-preserving stream where the packet identifier is located, thereby determining the channel corresponding to the packet identifier. , it is also possible to determine the channel in which the network has the corresponding sequence stream or the network 4 text entry.
  • the OCP can respectively associate the out-of-order network messages received from the threads to the respective order-preserving streams.
  • Step 103 Perform sequence order processing on the network packet according to the packet processing sequence.
  • the OCP can perform the order-preserving processing on the network packets according to the packet processing sequence included in the sequence-preserving stream corresponding to the channel, that is, the network recorded in the sequence-preserving stream.
  • the order in which the packets enter the channel is sent in sequence, so that the order in which the network packets are processed in sequence is the same as the sequence in which the network packets enter the channel.
  • FIG. 2 is a flowchart of another embodiment of a message sequence processing method according to the present invention. As shown in FIG. 2, the method in this embodiment may include :
  • Step 201 Generate a sequence-preserving flow corresponding to the channel according to the sequence of the network packet entering the channel, and generate a correspondence between the packet identifier of the network packet and the sequence-preserving stream.
  • FIG. 3 is a schematic structural diagram of a correspondence between a packet identifier and a sequence-preserving stream generated in the embodiment shown in FIG. 2, as shown in FIG.
  • Sequence stream list (Link) 0 ⁇ Preservation stream link n corresponds to n+1 channels of the network device respectively. Valid indicates that the corresponding sequence stream is valid, head is the header, tail is the tail, and next is the next node.
  • Pointer, PKT—ID0 ⁇ PKT— IDm is the identifier of the network packet received on each channel of the network device.
  • the correspondence indicated by the arrow in FIG. 3 is the correspondence between the sequence stream link1 and the PKT_ID, wherein the header of the sequence stream link1 is at PKT_ID1, and at PKT_ID1.
  • PKT—ID3 the next pointer at ID3 points to PKT—ID5
  • PKT—ID5 is also the footer of the sequencer linkl
  • PKT ID1, PKT ID3, and PKT—ID5 enter the channel corresponding to the sequencer linkl.
  • PKT - ID0 ⁇ PKT - IDm can correspond to each of the sequence flow links.
  • Step 202 Receive a network packet sent by each thread, where the network packet includes a packet identifier.
  • Step 203 Cache network packets sent by each thread, and generate a sequence order including a sequence of processing sequences.
  • each thread may sequentially send a sequence order request (hereinafter referred to as REQ) to the OCP, where the REQ includes the network packet. Data content, etc.
  • REQ sequence order request
  • the OCP can then cache the REQ sent by each thread, for example, by caching the REQ in BUFFER.
  • the OCP can also generate a sequence-preserving request queue, where the sequence of the order-preserving processing includes a sequence of order-preserving processing, and the sequence of the order-preserving processing is a sequence of sending network packets by each thread.
  • the order-preserving processing order can be embodied by a request descriptor (hereinafter referred to as: REQ-ID).
  • REQ-ID request descriptor
  • Table 1 shows a description of REQ-ID.
  • the NPU_ID is the identifier of the parallel processor, and the THREAD_ID is the thread identifier of each NPU.
  • Each REQ-ID in the order-preserving processing queue can index one REQ, and the number of REQ-IDs is equal to the product of the number of Co-process (hereinafter referred to as COP) and the number of threads.
  • Table 2 shows a description of the REQ cached in BUFFER.
  • OP ADDR CTRL DATA indicates the type of operation of REQ, for example, the type of read operation is READ, the type of write operation is WRITE, the type of read and write operation is WRITE &READ; ADDR indicates the peripheral address accessed by REQ; CTRL is used to describe REQ Data length, whether to save control information, etc.; DATA indicates the request data sent by the REQ to the COP.
  • the REQ and the order-preserving request queue in Table 2 are cached in the BUFFER.
  • Step 204 Determine the sequence flow corresponding to the packet identifier of each network packet in sequence according to the sequence of the sequence processing.
  • the OCP can process the corresponding REQs according to the order of the order-preserving processing in the order-preserving request queue, that is, the network packets are processed in sequence.
  • the OCP can determine the sequence flow corresponding to each network packet according to the correspondence between the PKT_ID and the order-preserving stream in Table 1, for example.
  • Step 205 Send network messages corresponding to each channel to the data bus according to the message processing sequence of each sequence-preserving stream.
  • each network message For the network message corresponding to each of the sequence-preserving streams, each network message needs to be sent to the data bus BUS in sequence according to the message processing order in the sequence-preserving stream.
  • the OCP can send the network message to the bus BUS, and then the OCP can perform the sequence flow.
  • the next PKT-ID in the set is set to the list header, so that the next save order processing is for the next network message.
  • the OCP may perform the order-preserving processing on the next REQ buffered in the BUFFER according to the REQ-ID in the order-preserving request queue, and the current REQ is Need to wait for the next poll.
  • the OCP when the network packet enters each channel, can record the sequence of the network packet entry for each channel, and the OCP can cache the network packet sent by each thread, and according to the network packet sent by each thread.
  • the packet identifier included in the packet determines the corresponding sequence-preserving stream, and performs the order-preserving processing on the network packet according to the sequence in which the network packet included in the sequence-preserving stream enters the channel. Therefore, that is The order in which the packets are sent is the same as the order in which the network packets enter the network device channel. Therefore, for the embodiment shown in FIG. 1 or FIG. 2, the packets can be sent to the network packets sent by the threads on the NPU side.
  • the order-preserving process can also perform the order-preserving processing on the network packets sent by the threads on the COP side.
  • a network packet sent by a thread on the NPU side needs a thread on the COP side to send a corresponding response. Therefore, the OCP can perform the order-preserving processing on the network packet sent by the thread on the NPU side.
  • the OCP can perform the order-preserving processing on the response packet sent by the thread on the COP side.
  • FIG. 4 is a flowchart of still another embodiment of a packet order processing method according to the present invention
  • FIG. 5 is a schematic diagram of a processing procedure of the embodiment shown in FIG. 4 in a scenario, as shown in FIG. 4 and FIG.
  • sexually only three threads, namely, thread A, thread B, and thread C, and the PKT_ID of the network packet currently held by thread A is 0, and the network packet currently held by thread B is shown.
  • the PKT_ID is 1, and the PKT_ID of the network message currently held by thread C is 2, and the three network messages belong to the same channel.
  • the processing sequence of the corresponding packet in the sequence-preserving stream corresponding to the channel is 0, 1, and 2, that is, the order in which the network packet enters the channel is 0, 1, and 2, and the asynchronous thread sends the network to the OCP.
  • the sequence is Thread: ⁇ Thread A, Thread C.
  • this embodiment may include:
  • Step 401 thread B, thread A, and thread C send REQs to the OCP in turn.
  • Thread B, Thread A, and Thread C send REQs to OCP in turn, and each REQ can use the description shown in Table 2.
  • Step 402 The REQ BUFFER in the OCP buffers the REQ, and generates a REQ_ID queue (hereinafter referred to as: REQ_ID Queue).
  • the order of the order-preserving processing in the REQ-ID queue is 1, 0, 2.
  • Step 403 The scheduling unit in the OCP (hereinafter referred to as Schedule) schedules an REQ_ID from the REQ-ID Queue in the order of order-preserving processing.
  • Step 404 The schedule determines whether the REQ_ID is in the chain header of the sequence-preserving stream. If yes, step 405 is performed; otherwise, step 403 is performed.
  • Step 405 The schedule sends a REQ authorization to the REQ BUFFER, and sets the next REQ_ID in the sequence flow to the list header.
  • Step 406 The REQ BUFFER sends the REQ corresponding to the REQ_ID to the REQ First In First Out (hereinafter referred to as FIFO) queue.
  • FIFO First In First Out
  • Schedule may schedule REQ_ID'T from the REQ_ID Queue, and then Schedule may compare the scheduled REQ_ID'T with the REQ-ID included in the chain header of the sequencer, thereby Determine whether the scheduled REQ_ID'T is in the chain header of the sequence.
  • the current chain header of the sequence-preserving stream is "0". Therefore, the REQ_ID'T of the Schedule schedule cannot be sent to the BUS FIFO queue.
  • the Schedule may schedule the REQ ID 'O' from the REQ_ID Queue, and then the Schedule may compare the scheduled REQ_ID'O" with the REQ_ID included in the chain header of the sequencer to determine the The scheduled REQ_ID'T is in the chain header of the sequence.
  • Schedule can send REQ authorization to REQ BUFFER, so that REQ BUFFER sends the REQ corresponding to REQ_ID'O" to the BUS FIFO, and , Schedule can set the next REQ_ID'T' in the sequence flow to the list header. Then, Schedule can schedule REQ_ID "2" from the REQ_ID Queue, and then Schedule can compare the scheduled REQ_ID "2" with the REQ-ID included in the current list header of the sequence flow. Therefore, it is judged whether the scheduled REQ_ID "2" is in the chain header of the sequence-preserving stream.
  • the Schedule may send a REQ authorization to the REQ BUFFER, so that the REQ BUFFER sends the REQ corresponding to the REQ_ID'T' to the BUS FIFO, and the Schedule may be in the order stream.
  • the next REQ—ID "2" is set to the linked list header.
  • the Schedule may compare the scheduled REQ_ID "2,” with the REQ_ID included in the current list header of the sequence flow to determine whether the scheduled REQ_ID "2" is in the chain header of the sequence. Judging from the judgment, REQ_ID "2" is in the current list header of the sequence-preserving stream. Therefore, Schedule can send a REQ authorization to the REQ BUFFER, so that the REQ BUFFER sends the REQ corresponding to the REQ_ID "2" to the BUS FIFO.
  • the above process can be used, and details are not described herein.
  • the REQ order in the REQ FIFO queue is REQA, REQB, REQC.
  • Steps 407, REQ A, REQB, and REQC access the COP in order.
  • RSP radio Service Set
  • the response message sent by the COP is processed in a sequence.
  • FIG. 6 is a schematic structural diagram of an embodiment of a sequence-sequencing coprocessor according to the present invention.
  • the OCP of this embodiment may include: a receiving module 11, a determining module 12, and a sequence processing module 13, wherein the receiving module 11
  • the network packet is sent by the receiving thread, where the network packet includes a packet identifier, and the determining module 12 is configured to determine a sequence-preserving stream corresponding to the packet identifier, where the sequence-preserving stream and the network device are in a channel.
  • the packet processing sequence included in the sequence-preserving stream is a sequence in which the network packet enters the channel; the sequence-preserving processing module 13 is configured to perform the order-preserving of the network packet according to the packet processing sequence. deal with.
  • FIG. 7 is a schematic structural diagram of another embodiment of a sequence-sequencing coprocessor according to the present invention. As shown in FIG. 7, the OCP of the embodiment may further include: generating a processing module 14 and a cache according to the OCP shown in FIG.
  • the processing module 15 is configured to generate a sequence flow corresponding to the channel according to the sequence in which the network packet enters the channel, and generate a text identifier and the order of the network Corresponding relationship between the flows; the determining module 12 is specifically configured to determine, according to the correspondence generated by the generating processing module, a sequence-preserving stream corresponding to the network identifier; a cache processing module 15 configured to cache a network packet sent by each thread, and a sequence-preserving request queue is generated, and the order-preserving processing sequence is a sequence of sending network packets by each thread.
  • the determining module 12 is further configured to be used according to the The order processing sequence determines the sequence flow corresponding to the packet identifier of each network packet in turn.
  • the pre-processing processing module 13 includes a determining unit 131 and a processing unit 132, and a link header.
  • the processing unit 132 is configured to send the network packet if the packet identifier of the network packet is in a link header of the sequence-preserving stream. And setting the next packet identifier in the sequence-preserving stream as a link header; if the packet identifier of the network packet is not in the link header of the sequence-preserving stream, A network 4 ⁇ text for order processing.
  • the OCP of this embodiment may be used to perform the method of the method embodiment shown in FIG. 2, and the implementation principle and technical effects are similar, and details are not described herein again.
  • FIG. 8 is a schematic structural diagram of another embodiment of a sequence-sequencing coprocessor according to the present invention.
  • the OCP of the embodiment is based on the OCP shown in FIG. 6.
  • the receiving module 11 may include: a receiving unit 111 and a second receiving unit 112, wherein the first receiving unit 111 is configured to receive a network message sent by a thread on a network processor unit side; and the second receiving unit 112 is configured to receive a network sent by a thread on the coprocessor side. Message.
  • the OCP of this embodiment may be used to perform the method of the method embodiment shown in FIG. 4, and the implementation principle and the technical effect are similar, and details are not described herein again.
  • first receiving unit 111 and the second receiving unit 112 in this embodiment may also be selected, and the method of the embodiment shown in FIG. 1 or FIG. 2 may be performed.
  • the sequencer coprocessor can be implemented by using an ASIC technology.
  • a specific circuit diagram can be designed by a person skilled in the art according to the concept of the embodiment of the present invention, which is not limited in this embodiment.
  • FIG. 9 is a schematic structural diagram of an embodiment of a network device according to the present invention.
  • the network device in this embodiment may include a network processor unit 1, a sequencer coprocessor 2, and a coprocessor 3, which are sequentially connected, where
  • the preserving coprocessor 2 can adopt the structure shown in any one of the embodiments of FIG. 6 to FIG. 8 , which can correspondingly perform the method of the method embodiment shown in FIG. 1 , 2 or 4 , and the implementation principle and technical effect are similar. I will not repeat them here.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)

Abstract

La présente invention concerne, dans des modes de réalisation, un procédé de traitement de préservation d'ordre des messages, un coprocesseur de préservation d'ordre et un équipement de réseau. Le procédé de traitement de préservation d'ordre des messages comprend : la réception de messages du réseau envoyés par des fils, les messages du réseau contenant des identifications de message (101) ; la détermination d'un flux de préservation d'ordre correspondant aux identifications des messages, un flux de préservation d'ordre correspondant à un canal de l'équipement de réseau et l'ordre de traitement du message contenu dans le flux de préservation d'ordre étant l'ordre dans lequel les messages entrent dans le canal (102) ; l'exécution du traitement de préservation d'ordre par rapport aux messages du réseau selon l'ordre de traitement des messages (103). Les modes de réalisation de la présente invention peuvent exécuter le traitement de préservation d'ordres par rapport aux messages en cas de traitement de messages asynchrones à fils multiples.
PCT/CN2011/073811 2011-05-09 2011-05-09 Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau Ceased WO2011120467A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN2011800005300A CN102204183A (zh) 2011-05-09 2011-05-09 报文保序处理方法、保序协处理器和网络设备
PCT/CN2011/073811 WO2011120467A2 (fr) 2011-05-09 2011-05-09 Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/073811 WO2011120467A2 (fr) 2011-05-09 2011-05-09 Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau

Publications (2)

Publication Number Publication Date
WO2011120467A2 true WO2011120467A2 (fr) 2011-10-06
WO2011120467A3 WO2011120467A3 (fr) 2012-04-05

Family

ID=44662805

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/073811 Ceased WO2011120467A2 (fr) 2011-05-09 2011-05-09 Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau

Country Status (2)

Country Link
CN (1) CN102204183A (fr)
WO (1) WO2011120467A2 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020143509A1 (fr) * 2019-01-07 2020-07-16 华为技术有限公司 Procédé de transmission de données et dispositif de réseau
CN113014528A (zh) * 2019-12-19 2021-06-22 厦门网宿有限公司 报文处理方法、处理单元及虚拟专用网络服务器
CN113965347A (zh) * 2021-09-09 2022-01-21 山石网科通信技术股份有限公司 防火墙的数据处理方法及装置
CN114338559A (zh) * 2021-12-15 2022-04-12 杭州迪普信息技术有限公司 一种报文保序的方法及装置
CN114731334A (zh) * 2020-02-14 2022-07-08 华为技术有限公司 报文保序方法和装置
CN116155828A (zh) * 2022-12-21 2023-05-23 北京云豹创芯智能科技有限公司 一种多个虚拟队列的报文保序方法及其装置、存储介质、电子设备
CN116405443A (zh) * 2023-03-28 2023-07-07 中科驭数（北京）科技有限公司 报文转发方法、装置、设备及存储介质
CN118316888A (zh) * 2024-06-11 2024-07-09 贵州华芯半导体技术有限公司 报文保序传输方法、芯片及电子设备
CN118519729A (zh) * 2024-07-18 2024-08-20 贵州华芯半导体技术有限公司 一种报文调度方法、系统、存储介质和电子设备

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102710524B (zh) * 2012-06-15 2015-01-21 大连梯耐德网络技术有限公司 一种多协议网络报文传输保序系统的实现方法
CN102843235A (zh) * 2012-09-06 2012-12-26 汉柏科技有限公司 一种报文加/解密方法
CN102932141B (zh) * 2012-09-27 2016-01-06 汉柏科技有限公司 多加解密芯片并行处理报文加解密的保序方法及系统
CN103927123B (zh) * 2013-01-15 2017-02-08 华为技术有限公司 缓存管理方法及装置
CN105656804B (zh) * 2014-11-20 2019-12-24 中兴通讯股份有限公司 一种报文处理方法及装置
CN109697022B (zh) * 2017-10-23 2022-03-04 深圳市中兴微电子技术有限公司 一种报文描述符pd的处理方法、装置及计算机可读存储介质
CN108093061A (zh) * 2017-12-26 2018-05-29 北京天融信网络安全技术有限公司 业务板间信息的同步方法、装置、存储介质及计算机设备
CN114448573B (zh) * 2022-03-02 2024-02-23 新华三半导体技术有限公司 一种报文处理方法及装置
CN118055156A (zh) * 2022-11-15 2024-05-17 华为技术有限公司 一种数据处理方法及装置
CN120639831A (zh) * 2023-01-29 2025-09-12 华为技术有限公司 报文传输方法、装置及系统
WO2025050277A1 (fr) * 2023-09-05 2025-03-13 新华三技术有限公司 Procédé de transmission de flux déterministe, appareil et nœud de réseau

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8214588B2 (en) * 2003-11-05 2012-07-03 International Business Machines Corporation Parallel asynchronous order-preserving transaction processing
CN100531142C (zh) * 2006-12-30 2009-08-19 华为技术有限公司 保证报文顺序的方法和装置
CN100531147C (zh) * 2007-03-07 2009-08-19 华为技术有限公司 多链路捆绑协议报文分片接收方法
CN101175033B (zh) * 2007-11-27 2010-06-16 中兴通讯股份有限公司 报文保序方法及其装置
CN101291194B (zh) * 2008-05-20 2010-08-25 成都市华为赛门铁克科技有限公司 报文保序的方法和系统

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020143509A1 (fr) * 2019-01-07 2020-07-16 华为技术有限公司 Procédé de transmission de données et dispositif de réseau
US12015560B2 (en) 2019-01-07 2024-06-18 Huawei Technologies Co., Ltd. Data transmission method and network device
CN113014528A (zh) * 2019-12-19 2021-06-22 厦门网宿有限公司 报文处理方法、处理单元及虚拟专用网络服务器
CN113014528B (zh) * 2019-12-19 2022-12-09 厦门网宿有限公司 报文处理方法、处理单元及虚拟专用网络服务器
CN114731334B (zh) * 2020-02-14 2023-10-20 华为技术有限公司 报文保序方法和装置
CN114731334A (zh) * 2020-02-14 2022-07-08 华为技术有限公司 报文保序方法和装置
CN113965347A (zh) * 2021-09-09 2022-01-21 山石网科通信技术股份有限公司 防火墙的数据处理方法及装置
CN113965347B (zh) * 2021-09-09 2024-03-15 山石网科通信技术股份有限公司 防火墙的数据处理方法及装置
CN114338559A (zh) * 2021-12-15 2022-04-12 杭州迪普信息技术有限公司 一种报文保序的方法及装置
CN114338559B (zh) * 2021-12-15 2024-03-22 杭州迪普信息技术有限公司 一种报文保序的方法及装置
CN116155828A (zh) * 2022-12-21 2023-05-23 北京云豹创芯智能科技有限公司 一种多个虚拟队列的报文保序方法及其装置、存储介质、电子设备
CN116405443A (zh) * 2023-03-28 2023-07-07 中科驭数（北京）科技有限公司 报文转发方法、装置、设备及存储介质
CN116405443B (zh) * 2023-03-28 2024-06-07 中科驭数（北京）科技有限公司 报文转发方法、装置、设备及存储介质
CN118316888A (zh) * 2024-06-11 2024-07-09 贵州华芯半导体技术有限公司 报文保序传输方法、芯片及电子设备
CN118519729A (zh) * 2024-07-18 2024-08-20 贵州华芯半导体技术有限公司 一种报文调度方法、系统、存储介质和电子设备

Also Published As

Publication number Publication date
CN102204183A (zh) 2011-09-28
WO2011120467A3 (fr) 2012-04-05

Similar Documents

Publication Publication Date Title
WO2011120467A2 (fr) Procédé de traitement de préservation d'ordre des messages, processeur de préservation d'ordre et équipement de réseau
CN109412964B (zh) 报文控制方法及网络装置
US9864633B2 (en) Network processor having multicasting protocol
US9755947B2 (en) Hierarchical self-organizing classification processing in a network switch
US9461930B2 (en) Modifying data streams without reordering in a multi-thread, multi-flow network processor
US9300597B2 (en) Statistics module for network processors in virtual local area networks
US9485200B2 (en) Network switch with external buffering via looparound path
CN113711572A (zh) 一种报文传输方法及装置
US9565035B1 (en) Enhanced audio video bridging (AVB) methods and apparatus
WO2024222965A1 (fr) Système et procédé de gestion de trafic, puce et support de stockage lisible par ordinateur
TW201110622A (en) Method and system for energy-efficiency-based packet classification
WO2015100915A1 (fr) Procédé et dispositif de planification de file d'attente, et support de stockage informatique
WO2019228318A1 (fr) Procédé et dispositif de traitement de messages
CN104917680B (zh) 用于执行分组流的并行散列的计算机系统
WO2014015498A1 (fr) Procédé, dispositif et système d'envoi et de réception de paquets
CN105635000A (zh) 一种报文存储转发方法和电路及设备
CN108614792B (zh) 1394事务层数据包存储管理方法及电路
CN115086238A (zh) 一种tsn网络端口输出调度装置
CN111865813B (zh) 一种基于反ecn标记的数据中心网络传输控制方法、系统及可读存储介质
CN117596201A (zh) 一种基于循环排队转发机制的联合路由调度方法及装置
CN105391647A (zh) 一种流量控制的方法及系统
TWI465075B (zh) 封包處理之裝置與系統
CN107426111A (zh) 硬件可实现的基于wred算法的拥塞控制方法和装置
CN115835402A (zh) 基于数据帧动态优先级的时间敏感网络流调度方法及装置
WO2012149742A1 (fr) Procédé et dispositif de préservation d'ordre de signaux

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201180000530.0

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11762041

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11762041

Country of ref document: EP

Kind code of ref document: A2