CN109981481B - Multi-site protection design method - Google Patents
Multi-site protection design method Download PDFInfo
- Publication number
- CN109981481B CN109981481B CN201910040657.3A CN201910040657A CN109981481B CN 109981481 B CN109981481 B CN 109981481B CN 201910040657 A CN201910040657 A CN 201910040657A CN 109981481 B CN109981481 B CN 109981481B
- Authority
- CN
- China
- Prior art keywords
- message
- serial number
- initial message
- link
- initial
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000013461 design Methods 0.000 title abstract description 17
- 238000012545 processing Methods 0.000 claims abstract description 45
- 230000007246 mechanism Effects 0.000 claims abstract description 14
- 238000012423 maintenance Methods 0.000 claims description 70
- 239000012634 fragment Substances 0.000 claims description 16
- 238000013467 fragmentation Methods 0.000 claims description 8
- 238000006062 fragmentation reaction Methods 0.000 claims description 8
- 238000011084 recovery Methods 0.000 claims description 6
- 238000004321 preservation Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 19
- 230000008531 maintenance mechanism Effects 0.000 abstract 2
- 238000007726 management method Methods 0.000 description 18
- 238000010586 diagram Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004064 recycling Methods 0.000 description 1
Images
Classifications
-
- 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
- H04L45/02—Topology update or discovery
-
- 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/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6245—Modifications to standard FIFO or LIFO
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Communication Control (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to a design method of multi-site protection, which comprises the following steps: dividing each message of the file into an initial message, a middle message and a completion message; judging the received message, and executing an initial message processing flow through a link number management mechanism, a serial number maintenance mechanism and a field protection mechanism according to whether the received message is an initial message or not; and when the non-initial message is received, starting a data processing flow of the non-initial message through a link number management mechanism, a serial number maintenance mechanism and a field protection mechanism. The design method of multi-site protection introduces the whole design, can eliminate unsafe factors of transmission for multi-link concurrent network transmission, and ensures error-free and efficient transmission of data.
Description
Technical Field
The invention relates to a network communication technology, in particular to a design method of multi-site protection.
Background
In network communication, in order to ensure the security of network data transmission, it is generally necessary to process the network data to be transmitted. Due to the performance limitations and requirements of the data processing modules, the network packets input to the data processing modules must be contiguous. Due to the objective conditions of the unsound Ethernet transmission security mechanism, the limited buffer resources in the logic and the like, in the data transmission occasions with larger throughput and larger bandwidth, some messages are inevitably lost in the transmission process, which causes the disorder of data processing and leads to the paralysis of the whole system.
Disclosure of Invention
The present invention aims to provide a design method of multi-site protection, which is used for solving the problems of the prior art.
The invention discloses a design method of multi-site protection, which comprises the following steps: dividing each message of the file into an initial message, a middle message and a finished message; judging the received message, and executing the following steps according to whether the message is an initial message or not: after receiving the initial message, starting a data processing flow of the initial message, including: s1, inquiring a link number management table, confirming whether an available link number exists, if not, discarding the message, and if so, executing S2; s2, accessing a link number management table, and applying for link numbers for all messages of the file; s3, writing the applied link number into a serial number maintenance table; s4, inquiring whether the system can process the initial message, if not, caching the initial message until the initial message can be processed, and if so, executing the step S5; s5, processing initial message data; s6, extracting a field from the output processed initial message data, and writing the field into a field protection table; after receiving the non-initial message, starting a data processing flow of the non-initial message, comprising: a1, using a link number of a non-initial message to index a serial number maintenance table; a2, judging whether the serial number of the non-initial message is equal to or larger than the serial number in the maintenance table by 1, if so, executing A3, otherwise, discarding the non-initial message; a3, writing the serial number of the current non-initial message into a serial number maintenance table, and updating the serial number; a4, using the serial number and the link number of the current non-initial message to index a field protection table, and reading out field information; a5, inquiring whether the non-initial message can be processed, if yes, executing the step A6, if not, caching the non-initial message until the non-initial message can be processed, then executing the step A6, and processing the data of the non-initial message and the field information; a7, extracting a 'field' from the processed data and writing the 'field' into a field protection table; a8, judging whether the non-initial message is a completion message, if so, executing the step A9, otherwise, executing the step A10; a9, writing the link number into a link number management table, and recycling the link number; and A10, returning and waiting for receiving a new message.
According to an embodiment of the design method of multi-site protection of the present invention, the management method of the link number management table includes: the structure of the storage link number management table is a first-in first-out cache FIFO; initializing the link number management table: sequentially writing data 1 to n into the FIFO, wherein n is the cache depth; when receiving the initial message application connection number, taking out the connection number from the connection number management table; distributing the applied link number to an initial message, a middle message and an end message of the file; and when receiving an end message carrying the link number, extracting the link number of the end message, and rewriting the link number into the FIFO to finish the link number recovery.
According to an embodiment of the design method of multi-site protection of the present invention, the serial number maintenance table includes: the serial numbers of the input fragmentation messages of the same link number are continuous, and the serial number of the currently received message is in a serial number maintenance table or is 1 greater than the serial number of the currently received message; for the condition that the serial number of the received message is in the maintenance table, the maintenance table is unchanged; the message serial number is 1 greater than the serial number of the maintenance table, and the last serial number of the serial number maintenance table is discarded.
According to an embodiment of the design method of multi-site protection of the present invention, the structure of the serial number maintenance table includes: and each link number corresponds to a serial number.
According to one embodiment of the design method of multi-site protection, the working mechanism of the serial number maintenance table comprises the steps of writing the distributed link number serving as an index into the serial number maintenance table with an RAM as a framework after receiving an initial message; receiving the intermediate message and the completion message, and reading the maintained serial number by using the link number as an index addressing RAM; if the serial numbers of the received intermediate message and the received finished message are in the serial number maintenance table, continuing processing; if the serial numbers of the received intermediate message and the completion message are plus 1 in the serial number maintenance table, continuing processing, and simultaneously writing the serial number of the received current fragmentation message into the serial number maintenance table; if the received intermediate message and the received finished message are discarded because the serial numbers do not meet the condition, the serial number maintenance table is unchanged.
An embodiment of the method for designing a multi-site protection according to the present invention, wherein the site protection comprises: if the data or the operation result of the previous fragment message of the same file is used for processing the current fragment message, caching the previous fragment message, and extracting the data or the operation result of the previous fragment message for processing after the current fragment message arrives.
According to one embodiment of the multi-site protection design method, a site protection working mechanism comprises the steps of writing an initial message into a site according to an acquired link number and a serial number as an index, processing the initial message, and synchronously writing a processing result into the same site; the field recovery comprises the following steps: receiving a non-initial message, analyzing the link number and the serial number, reading and recovering the site by the index number, and processing the read site and the received non-initial message; the field preservation comprises the following steps: receiving a non-initial message, and if the serial number of the non-initial message is in a serial number maintenance table, not needing to store the non-initial message on site; if the sequence number +1 of the non-initial message is in the sequence number maintenance table, the site and the processed result need to be synchronously stored in the site, and the oldest site is discarded; if the serial number of the received non-initial message is not in the serial number maintenance table, and meanwhile, the non-initial message +1 is not in the serial number maintenance table, the received message is an invalid message.
According to the multi-site protection design method, three safety mechanisms of link number management, serial number maintenance and site protection are introduced into the whole design, unsafe factors of transmission can be eliminated for multi-link concurrent network transmission, and error-free and efficient transmission of data is guaranteed.
Drawings
FIG. 1 is a view showing a link number management representation intention;
FIG. 2 is a schematic diagram of a serial number maintenance table;
FIG. 3 is a schematic view of multi-site protection;
FIG. 4 is a data processing flow diagram of an initial message;
FIG. 5 is a flow chart illustrating data processing for intermediate messages and completion messages.
Detailed Description
In order to make the objects, contents, and advantages of the present invention clearer, the following detailed description of the embodiments of the present invention will be made in conjunction with the accompanying drawings and examples.
In the ethernet transport protocol, data is encapsulated into messages for transmission. Since the network transmission protocol has a strict limitation on the length of the message, for a large document, it is usually necessary to divide the document into a plurality of messages for transmission. The first transmission message of the file is called an initial message, the last transmission message is called a completion message, and the middle messages are collectively called middle messages. In the logic design, different file messages are distinguished by link numbers, namely, the logic allocates a unique link number to each file, and all messages belonging to the file have the same link number. And different fragmentation messages of each file are assigned with a sequence number by software to represent the sequence of the message in the fragmentation message of the file. Usually, the sequence numbers of all messages of the same file must be arranged consecutively. When the logic receives the data message issued by the software, the integrity of the message transmission process needs to be judged by using the link number and the serial number, and the same linked message input to the data processing module is ensured to be continuous.
Fig. 1 shows a link number management representation intention, and as shown in fig. 1, the link number management method includes:
the structure for storing the table is a first-in first-out buffer FIFO (hereinafter, referred to as FIFO), and the buffer size is required to satisfy the maximum number of links required in the entire design.
The working method of the link number management table comprises the following steps:
initialization: sequentially writing data 1 to n into the FIFO, wherein n is the cache depth;
the working process comprises the following steps:
the cpu sends an 'initial message' of the file, and does not carry a link number (which is not allocated yet);
when receiving the initial message, accessing the link number management table to apply for a link number;
sending a 'return message' and sending the applied link number to the cpu; the cpu assigns link numbers to the "middle message" and the "end message" of the file;
the CPU sends a 'middle message' of the file and carries a link number;
the cpu sends an 'end message' of the file and carries a link number;
when receiving an end message carrying a link number, extracting the link number of the end message, and rewriting the link number into FIFO to complete link number recovery;
only the link number stored in FIFO can other file message apply for the link number, so the problem of link conflict of file message in the process of processing is avoided.
Further, the cpu may parse the "return message" of the "initial message" after receiving the "return message". The 'link number' is taken out from the file, and the 'link number' is written into corresponding fields of the 'intermediate message' and the 'finished message', so that all messages belonging to the same file have the same 'link number'.
The sequence number 2 maintenance table includes:
the sequence numbers of the input fragmentation messages of the same link number must be continuous, and the sequence number of the currently received message should be in the sequence number maintenance table or be 1 greater than the sequence number of the currently received message (i.e. the sequence number +1 of the currently received message is in the sequence number maintenance table). The situation that the received message sequence number is in the maintenance table generally occurs when the message is lost in the transmission process and the program informs software to retransmit the message. The measures taken for the message programs with the sequence numbers not meeting the requirements are as follows: discarding; if the received message serial number is 1 greater than the serial number of the maintenance table, a new serial number comes, the new serial number needs to be written into the serial number maintenance table, the last serial number of the serial number maintenance table is discarded correspondingly, and the size of the serial number maintenance table generally needs to meet the size of a field cache message.
Fig. 2 is a schematic structural diagram of the serial number maintenance table, as shown in fig. 2, "session0, session1, \ 8230," session "represents" link number "," seq _ num _ i, seq _ num _ j, and seq _ num _ k "represents" serial number ". The "serial number maintenance table" is queried to index using the "link number".
As shown in fig. 2, the sequence number maintenance table working mechanism includes:
the program receives an initial message, writes the initial message into a serial number maintenance table which takes the RAM as the framework by taking the distributed link number as an index, and transmits the initial message to a next-stage module which needs to receive the message for processing;
receiving the intermediate message and the completion message, and reading the maintained serial number by using the link number as an index addressing RAM;
if the received serial numbers of the intermediate message and the finished message are in the serial number maintenance table, the message is transmitted to the next level module needing to receive the message for processing;
if the received serial number (the serial number +1 of the intermediate message and the finished message) is in the serial number maintenance table, the message is transmitted to the next level module needing to receive the message for processing, and the serial number of the received current fragmentation message is written into the serial number maintenance table; if the message is not in the serial number maintenance table, the message is discarded, and the serial number maintenance table is unchanged.
3 the field protection comprises:
if the processing of the current fragment message uses the data or operation result of the preceding fragment message (the complete message is divided, the message transmitted at one time by the network does not exceed 2KB, and if the message is larger than 2KB, the message is divided into messages suitable for network transmission), the preceding fragment message must be cached, and the preceding fragment message may be cached in the RAM inside the program, or may be cached in an off-chip cache chip, such as a DDR/SRAM/FLASH, etc., and the cache is exemplified by the RAM below. That is, after the current fragment message arrives, data or operation results of the preceding fragment message need to be extracted and then transmitted to the next-stage module for processing, and the process is also called field protection.
Fig. 3 is a schematic diagram of multi-site protection, and as shown in fig. 3, { session _ i/j/k, seq _ num } in the diagram is an index number for accessing a site cache RAM, which is composed of a "link number" and a "serial number", and Scene i is a stored site (fragmented packet).
The field protection work mechanism comprises:
the program receives the initial message, writes the initial message into scene 0 according to the obtained link number m and the sequence number 0 (the sequence number of the initial message is 0), transmits the initial message to the next-stage module needing to receive the message for processing, and synchronously writes the processing result into the same scene 0;
and (3) field recovery: the program receives the intermediate message and the completion message, analyzes the link number m and the serial number k, reads and restores the site by the index number { m, k-i (i is more than or equal to 1 and less than or equal to n) }, and synchronously inputs the read site and the received message to the next-stage module for processing;
and (4) field preservation: the program receives the intermediate message and the completion message, if the serial number is in the serial number maintenance table, the field storage is not needed, because the field is already stored in the RAM; if the (serial number + 1) is in the serial number maintenance table, the results processed by the field and the next-stage module need to be synchronously stored in the field, and the oldest field is discarded;
invalid message: if the received ' serial number ' is not in the serial number maintenance table, and the ' serial number ' +1 ' is not in the serial number maintenance table, the received message is an invalid message and is discarded.
Fig. 4 is a data processing flow chart of the initial packet, and as shown in fig. 4, the data processing flow of the initial packet includes:
s1, receiving a new message issued by software;
s2, judging whether the message from the channel is an initial message or not, if not, discarding the message and re-receiving the message, and if so, continuing to execute S3;
s3, inquiring a link number management table, confirming whether an available link number exists or not, if not, discarding the message, and if so, executing S4;
s4, accessing a link number management table, and applying for link numbers for all messages of the file;
s5, writing the serial number of the message into a track serial number maintenance table;
s6, inquiring whether a new message can be processed or not, if not, caching the message until the new message can be processed and executing S7, and if so, executing the step S7;
s7, processing message data;
s8, extracting a 'field' from the output processed message data and writing the 'field' into a 'field protection table';
and S9, ending.
Fig. 5 is a flow chart of data processing of the intermediate message and the completion message, and as shown in fig. 5, the data processing of the intermediate message and the completion message includes:
a1, software receives a return message of an initial message, writes a link number into a next-stage message and then issues the link number;
a2, judging the type of the message, if the message is a middle message, executing the step A3, and if the message is a finished message, writing the link number back to a link number management table, namely recovering the link number;
a3, using a message 'link number' to index a serial number maintenance table;
a4, judging whether the serial number of the current message is equal to or larger than the serial number in the maintenance table by 1, if so, executing A5, otherwise, discarding the message;
a5, writing the serial number of the current message into a serial number maintenance table, and updating the serial number;
a6, indexing a field protection table by using the serial number and the link number, and reading field information;
a7, inquiring whether the message can be processed, if not, caching the message until the message can be processed to execute A8, and if yes, executing the step A8;
a8, processing data of the 'message' and the 'field' together;
a9, extracting a 'field' from the processed data and writing the 'field' into a field protection table; and returning to receive a new message.
Compared with the prior art, the technical scheme provided by the invention realizes the safe transmission of the network by constructing three safety mechanisms of 'link number management table', 'serial number maintenance table' and 'field protection' and storing the field of a plurality of messages, and a designer can flexibly configure by combining the actual situation by adopting the mechanism, so the method has certain engineering practical value.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (3)
1. A method of designing multi-site protection, comprising: dividing each message of the file into an initial message, a middle message and a finished message;
judging the received message, and executing the following steps according to whether the message is an initial message or not:
after receiving the initial message, starting a data processing flow of the initial message, comprising:
s1, inquiring a link number management table, confirming whether an available link number exists or not, if not, discarding the message, and if so, executing S2;
s2, accessing a link number management table, and applying for link numbers for each message of the file;
s3, writing the applied link number into a serial number maintenance table;
s4, inquiring whether the system can process the initial message or not, if not, caching the initial message until the initial message can be processed, and if so, executing the step S5;
s5, processing initial message data;
s6, extracting a field from the output processed initial message data, and writing the field into a field protection table;
after receiving the non-initial message, starting a data processing flow of the non-initial message, comprising:
a1, using a link number of a non-initial message to index a serial number maintenance table;
a2, judging whether the serial number of the non-initial message is equal to or larger than the serial number in the maintenance table by 1, if so, executing A3, otherwise, discarding the non-initial message;
a3, writing the serial number of the current non-initial message into a serial number maintenance table, and updating the serial number;
a4, using the serial number and the link number of the current non-initial message to index a field protection table, and reading out field information;
a5, inquiring whether the non-initial message can be processed, if yes, executing the step A6, if not, caching the non-initial message until the non-initial message can be processed, then executing the step A6,
a6, carrying out data processing on the non-initial message and the field information;
a7, extracting a 'field' from the processed data and writing the 'field' into a field protection table;
a8, judging whether the non-initial message is a completion message, if so, executing the step A9, otherwise, executing the step A10;
a9, writing the link number back to the link number management table, and recovering the link number;
a10, returning and waiting for receiving a new message;
the method for managing the link number management table comprises the following steps:
the structure of the storage link number management table is a first-in first-out cache FIFO;
initializing the link number management table: sequentially writing data 1 to n into the FIFO, wherein n is the cache depth;
when receiving an initial message application link number, taking out the link number from a link number management table;
distributing the applied link number to an initial message, a middle message and an end message of the file;
when receiving an end message carrying a link number, extracting the link number of the end message, and rewriting the link number into FIFO to complete link number recovery;
the sequence number maintenance table includes:
the serial numbers of the input fragmentation messages with the same link number are continuous, and the serial number of the currently received message is in a serial number maintenance table or is 1 larger than the serial number of the currently received message; for the condition that the serial number of the received message is in the maintenance table, the maintenance table is unchanged; the message serial number is 1 greater than the serial number of the maintenance table, and the last serial number of the serial number maintenance table is discarded;
the structure of the serial number maintenance table comprises: each link number corresponds to a serial number;
the working mechanism of the serial number maintenance table comprises that after an initial message is received, the distributed link number is used as an index to be written into the serial number maintenance table which takes an RAM as a framework; receiving the intermediate message and the completion message, and reading the maintained serial number by using the link number as an index addressing RAM; if the serial numbers of the received intermediate message and the received finished message are in the serial number maintenance table, continuing processing; if the serial numbers of the received intermediate message and the completion message are plus 1 in the serial number maintenance table, continuing processing, and simultaneously writing the serial number of the received current fragmentation message into the serial number maintenance table; if the received intermediate message and the received finished message are discarded because the serial numbers do not meet the condition, the serial number maintenance table is unchanged.
2. The method of designing multi-site protection according to claim 1, wherein site protection includes: if the data or the operation result of the previous fragment message of the same file is used for processing the current fragment message, caching the previous fragment message, and extracting the data or the operation result of the previous fragment message for processing after the current fragment message arrives.
3. The method of claim 1, wherein the site protection work mechanism comprises:
after receiving the initial message, writing the initial message into a field according to the obtained link number and the sequence number as indexes, processing the initial message, and synchronously writing a processing result into the same field;
the field recovery comprises the following steps: receiving a non-initial message, analyzing the link number and the serial number, reading and recovering the site by the index number, and processing the read site and the received non-initial message;
the field preservation comprises the following steps: receiving a non-initial message, and if the serial number of the non-initial message is in a serial number maintenance table, not needing to store the non-initial message on site; if the sequence number +1 of the non-initial message is in the sequence number maintenance table, the site and the processed result need to be synchronously stored in the site, and the oldest site is discarded; if the serial number of the received non-initial message is not in the serial number maintenance table, and meanwhile, the non-initial message +1 is not in the serial number maintenance table, the received message is an invalid message.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910040657.3A CN109981481B (en) | 2019-01-16 | 2019-01-16 | Multi-site protection design method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910040657.3A CN109981481B (en) | 2019-01-16 | 2019-01-16 | Multi-site protection design method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109981481A CN109981481A (en) | 2019-07-05 |
CN109981481B true CN109981481B (en) | 2022-11-11 |
Family
ID=67076666
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910040657.3A Active CN109981481B (en) | 2019-01-16 | 2019-01-16 | Multi-site protection design method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109981481B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115514722A (en) * | 2022-08-30 | 2022-12-23 | 北京左江科技股份有限公司 | An FPGA-based data packet connection controller and its data packet processing method |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101291194A (en) * | 2008-05-20 | 2008-10-22 | 华为技术有限公司 | Method and system for keeping sequence of report |
CN103986647A (en) * | 2014-05-21 | 2014-08-13 | 大唐移动通信设备有限公司 | Message transmission method and device |
WO2016145764A1 (en) * | 2015-03-18 | 2016-09-22 | 中兴通讯股份有限公司 | Method and apparatus for packet loss control |
WO2017000836A1 (en) * | 2015-06-29 | 2017-01-05 | 华为技术有限公司 | Message transmission method and device |
-
2019
- 2019-01-16 CN CN201910040657.3A patent/CN109981481B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101291194A (en) * | 2008-05-20 | 2008-10-22 | 华为技术有限公司 | Method and system for keeping sequence of report |
CN103986647A (en) * | 2014-05-21 | 2014-08-13 | 大唐移动通信设备有限公司 | Message transmission method and device |
WO2016145764A1 (en) * | 2015-03-18 | 2016-09-22 | 中兴通讯股份有限公司 | Method and apparatus for packet loss control |
WO2017000836A1 (en) * | 2015-06-29 | 2017-01-05 | 华为技术有限公司 | Message transmission method and device |
Also Published As
Publication number | Publication date |
---|---|
CN109981481A (en) | 2019-07-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9465662B2 (en) | Processor with efficient work queuing | |
DE112012004451T5 (en) | Multiprotocol serdes PHY Vorrichting | |
US8873550B2 (en) | Task queuing in a multi-flow network processor architecture | |
CN102104544B (en) | Order preserving method for fragmented message flow in IP (Internet Protocol) tunnel of multi-nuclear processor with accelerated hardware | |
WO2014135038A1 (en) | Packet transmission method and device based on pcie bus | |
US8990422B1 (en) | TCP segmentation offload (TSO) using a hybrid approach of manipulating memory pointers and actual packet data | |
CN113542148B (en) | Message aggregation method and device, network card and readable storage medium | |
US20130254462A1 (en) | Method and apparatus to reduce flash memory device programming time over a c.a.n. bus | |
CN109981481B (en) | Multi-site protection design method | |
CN102694730A (en) | Method and device for parallel processing | |
CN109246036A (en) | A kind of method and apparatus handling fragment message | |
CN109951750A (en) | Data processing method and system based on mono- layer of cross architecture of FlexE | |
CN108614792A (en) | 1394 transaction layer data packet memory management methods and circuit | |
CN111181819B (en) | Serial port communication method for receiving multi-byte data frame based on linked list structure | |
CN102629235A (en) | Method for increasing read-write speed of double data rate (DDR) memory | |
CN111198698B (en) | EtherCAT-based multi-device firmware program parallel downloading method and system | |
CN106533976A (en) | Data packet processing method and device | |
CN116235156A (en) | Write transactions combining uppercase writes | |
CN105357148A (en) | Method and system for preventing output message of network exchange chip from being disordered | |
CN111367494B (en) | A method and device for receiving serial data frames | |
CN115357534B (en) | High-speed multipath LVDS acquisition system and storage medium | |
CN117376051A (en) | Method, device and network chip for sharing buses by multiple messages | |
CN105610814B (en) | Reduce the method and system of message Forwarding Latency | |
CN114416395B (en) | A cross-switch chip ACL management method and system | |
CN111585918B (en) | Store-and-forward device and method applied to store-and-forward mechanism switch |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
CB03 | Change of inventor or designer information | ||
CB03 | Change of inventor or designer information |
Inventor after: Chen Junlai Inventor after: Zhang Wei Inventor after: Ma Xuezhen Inventor after: Sun Haiyang Inventor before: Chen Junlai |
|
GR01 | Patent grant | ||
GR01 | Patent grant |