CN113098858B - Lock-free processing system and method for link establishment message - Google Patents
Lock-free processing system and method for link establishment message Download PDFInfo
- Publication number
- CN113098858B CN113098858B CN202110336624.0A CN202110336624A CN113098858B CN 113098858 B CN113098858 B CN 113098858B CN 202110336624 A CN202110336624 A CN 202110336624A CN 113098858 B CN113098858 B CN 113098858B
- Authority
- CN
- China
- Prior art keywords
- flow table
- lock
- unit
- establishment message
- link establishment
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/161—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Abstract
The invention provides a lock-free processing system and method for a link establishment message, and relates to the field of data processing; the lock-free processing system is arranged in the processor; comprising a plurality of independent processing units, each processing unit respectively comprising: the link layer analysis module is used for analyzing the link establishment message; the flow table inquiry module is used for inquiring the corresponding flow table information in the flow table inquiry unit; and the application layer analysis module is used for carrying out application layer analysis when the corresponding flow table exists in the flow table query unit, and summarizing the final analysis result into a database for storage. The beneficial effects of the technical scheme are as follows: the flow table can be directly queried and created through the lock-free processing system. The invention solves the problems of low efficiency, packet loss, error reporting and the like of the link establishment message in the related technology, and provides the lock-free processing system and method of the link establishment message, which simplify the interactive form of a protocol stack, improve the efficiency of the link establishment message and reduce the occurrence probability of packet loss and error reporting.
Description
Technical Field
The invention relates to the field of data processing, in particular to a lock-free processing system and method for a link establishment message.
Background
With the advent of big data age, various data grows in an exponential scale, the data of the flow packet is bigger and bigger, the rapid collection and restoration data flow becomes a development trend, the data collection in the prior art is commonly used shared TCP/IP protocol stack, after receiving the flow packet, the flow packet is analyzed through a link layer, the flow table is queried in a read lock mode after the analysis is completed, after the flow table is queried, the flow table enters an application layer for analysis and is sent to a database, when the flow table is not read, the TCP protocol stack is needed to create the flow table in a write lock mode, the flow table is created, then the application layer analysis is carried out, and the flow table is sent to the database.
In the prior art, when the multithread is used for data acquisition at the same time, interaction with a TCP/IP protocol stack is needed in an unlocking and writing lock mode, the interaction is complex, the efficiency of building a link message is low when the data acquisition is caused, and when the multithread is used for processing, the problems of packet loss, error reporting and the like can occur because the flow packet is too large and exceeds the processing capacity of the protocol stack.
Disclosure of Invention
The invention provides a technical scheme of a lock-free processing system and method for a link establishment message, which aims to effectively improve or even solve the problem of low efficiency of the link establishment message and improve the efficiency of a protocol stack in data acquisition.
According to the invention, a lock-free processing system of a link establishment message is provided, which is arranged in a processor; the system comprises a plurality of independent processing units, wherein the input end of each processing unit is respectively connected to the output end of a network card, the output end of each processing unit is respectively connected to a database, and the query end of each processing unit is respectively connected to a flow table query unit;
each processing unit is used for bearing one processing thread, and each processing thread corresponds to one protocol stack;
each of the processing units comprises:
the link layer analysis module is used for acquiring the link establishment message output by the network card, analyzing the link establishment message and outputting an analysis result;
the flow table query module is connected with the link layer analysis module and is used for querying corresponding flow table information in the flow table query unit according to the analysis result and outputting a query result;
and the application layer analysis module is connected with the flow table query module and is used for carrying out application layer analysis on the link establishment message according to the flow table when the query result is that the corresponding flow table exists in the flow table query unit, and summarizing the final analysis result into the database for storage.
Further, the lock-free processing system further comprises a table building unit, which is respectively connected with each processing unit and the flow table query unit, and is used for creating a corresponding flow table in the flow table query unit when the query result is that the flow table query unit does not have the corresponding flow table.
Further, in the lock-free processing system, the analysis result obtained by the link layer analysis module includes a message length and a message sequence number of the link establishment message.
Further, in the lock-free processing system, the flow table query module initiates a query to the flow table query unit in a lock-free processing mode.
Further, in the lock-free processing system, the table building unit builds a corresponding flow table in the flow table query unit in a lock-free processing mode.
Further, in the lock-free processing system, the table building unit is a TCP protocol stack.
Further, in the lock-free processing system, the final analysis results output by all the application layer analysis modules are sent to the database in an aggregate mode for storage.
A lock-free processing method of a link establishment message is applied to a processor; including the above-mentioned lock-free processing system and include:
step S1, respectively sending the link establishment message into a plurality of independent processing threads to perform link layer analysis;
step S2, inquiring whether a corresponding flow table exists or not according to an analysis result obtained by the link layer analysis:
if not, turning to step S3;
if yes, turning to step S4;
step S3, a TCP protocol stack is adopted to create a corresponding flow table, and then the step S4 is performed;
s4, respectively adopting a corresponding flow table to analyze an application layer of the link establishment message;
and S5, aggregating the final analysis result obtained by the analysis of the application layer, and then sending the aggregated analysis result into a database for storage.
Further, in the method for processing without lock, in step S2, a mode of processing without lock is adopted to query whether a corresponding flow table exists.
Further, in the method for processing without lock, in step S3, a corresponding flow table is created by adopting a mode of processing without lock.
The lock-free processing system and method for the link establishment message provided by the invention have the following beneficial effects:
1) Simplifying the protocol stack interaction form;
2) The efficiency of the link establishment message is improved;
3) And the occurrence probability of packet loss and error reporting is reduced.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments and together with the description serve to explain the invention, without limiting the invention in any way, wherein:
FIG. 1 is a flow diagram of a prior art link establishment message processing;
FIG. 2 is a block diagram of a processing unit of a lock-free processing system in accordance with a preferred embodiment of the present invention;
FIG. 3 is a flow chart of the processing of the chaining message through the lock-free processing in the preferred embodiment of the present invention;
FIG. 4 is a flow chart of a lock-free processing method in a preferred embodiment of the invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that, without conflict, the embodiments of the present invention and features of the embodiments may be combined with each other.
The invention is further described below with reference to the drawings and specific examples, which are not intended to be limiting.
In the prior art, when the multithread is used for data acquisition at the same time, interaction with a TCP/IP protocol stack is needed in an unlocking and writing lock mode, so that the efficiency of building a link message is low in the data acquisition process, and when the multithread is used for processing a single thread, the problems of packet loss, error reporting and the like can occur because the flow packet is too large and exceeds the processing capacity of the protocol stack. In the prior art, as shown in fig. 1, a processing flow of a protocol stack is shown in the prior art, a network card 1 receives a link establishment message and sends the link establishment message to a processing unit 2, a processing unit 5 and a processing unit 8, each processing unit bears an independent processing thread, the processing unit 2 receives the link establishment message sent by the network card 1, enters a link layer analysis module 21 to perform link layer analysis and output an analysis result, sends the analysis result to a flow table query module 22, and enters a flow table query unit 3 to perform flow table query; meanwhile, the processing unit 5 receives the link establishment message sent by the network card 1, enters the link layer analysis module 51 to perform link layer analysis and output an analysis result, sends the analysis result to the flow table query module 52, enters the flow table query unit 3 to perform flow table query, and meanwhile, the processing unit 8 receives the link establishment message sent by the network card 1, enters the link layer analysis module 81 to perform link layer analysis and output an analysis result, sends the analysis result to the flow table query module 82, and enters the flow table query unit 3 to perform flow table query; when the corresponding flow table is not found in the flow table query unit 3, the flow table enters the table building unit 4, a corresponding flow table is built in the flow table query unit 3 through the table building unit 4, the flow tables enter the application layer analysis modules 23 corresponding to the corresponding processing units 2, 5 and 8 respectively, the application layer analysis modules 53 and 83 conduct application layer analysis, the final analysis result is output, and the final analysis result is sent into the database 11 for storage in an aggregation mode; when the flow table querying unit 3 finds the corresponding flow table, the flow table enters the application layer parsing module 23 corresponding to the corresponding processing unit 2, processing unit 5 and processing unit 8, the application layer parsing module 53 and the application layer parsing module 83 perform application layer parsing, and output final parsing results, and all the final parsing results are sent to the database 11 in an aggregation mode for storage.
Therefore, the invention leads to a lock-free processing system for the link establishment message so as to solve the problems in the prior art.
In this embodiment, a lock-free processing system for a link establishment message is provided, and the lock-free processing system is disposed in a processor; the system comprises a plurality of independent processing units, wherein the input end of each processing unit is respectively connected to the output end of the network card 1, the output end of each processing unit is respectively connected to a database, and the query end of each processing unit is respectively connected to a flow table query unit;
each processing unit is used for bearing one processing thread, and each processing thread corresponds to one protocol stack respectively; as shown in fig. 2, each processing unit includes:
the link layer parsing module 21 is configured to obtain and parse the link establishment message output by the network card 1, and output a parsing result;
the flow table query module 22 is connected to the link layer analysis module 21, and is configured to query the flow table query unit 3 for corresponding flow table information according to the analysis result, and output a query result;
the application layer analysis module 23 is connected to the flow table query module 22, and is configured to perform application layer analysis on the link establishment message according to the flow table when the query result is that the flow table query unit 3 has a corresponding flow table, and collect the final analysis result to the database 11 for storage.
Specifically, in this embodiment, the set processor supports domestic and imported processors, and supports, but is not limited to, the following CPU models: CPU FT-2000+ (ARM 64), CPU FT-2000+ (X86_64) and CPU Intel D1557 (X86_64).
Specifically, in this embodiment, the processing unit includes a plurality of link layer parsing modules 21, a flow table query module 22 and an application layer parsing module 23, where the modules are independent and correspond to each other one by one.
Specifically, in this embodiment, the flow table query module 22 performs a corresponding flow table query for the processing thread in the flow table query unit 3.
In a preferred embodiment of the present invention, the present invention further includes a table creating unit, which is respectively connected to each processing unit and the flow table query unit, and is configured to create a corresponding flow table in the flow table query unit when the query result is that the flow table query unit does not have a corresponding flow table.
Specifically, in the present embodiment, the present invention,
in the preferred embodiment of the present invention, the parsing result obtained by the link layer parsing module 21 includes the message length and the message sequence number of the link establishment message.
In the preferred embodiment of the present invention, the flow table query module 22 initiates a query to the flow table query unit 3 using a lock-free process.
Specifically, in this embodiment, the method of using the lock-free processing to initiate the query to the flow table query unit 3 is a direct query without using a read lock.
In the preferred embodiment of the present invention, the table creating unit 4 creates the corresponding flow table in the flow table query unit 3 by using a lock-free processing method.
Specifically, in this embodiment, the corresponding flow table is built in the flow table query unit 3 by adopting a lock-free processing manner, which is a manner that write lock is not required, and the table is directly built.
In a preferred embodiment of the present invention, the table-building unit 4 is a TCP stack.
Specifically, in this embodiment, when the flow table querying unit 3 does not have a corresponding flow table, the processing thread notifies the TCP protocol stack to establish the corresponding flow table in a lock-free processing manner.
In the preferred embodiment of the present invention, the final parsing result output by the application layer parsing module 23 is sent to the database 11 for storage in an aggregated manner.
Specifically, in this embodiment, taking the number of TCP stacks as 3 as an example, the processing flow of the lock-free processing system is shown in fig. 3: the network card 1 receives the link establishment message and sends the link establishment message to the processing unit 2, the processing unit 5 and the processing unit 8, each processing unit bears an independent processing thread, the processing unit 2 receives the link establishment message sent by the network card 1, enters the link layer analysis module 21 to conduct link layer analysis and output analysis results, sends the analysis results to the flow table query module 22, enters the flow table query unit 3 to conduct flow table query, enters the table establishment unit 4 when the flow table query unit 3 does not find the corresponding flow table, establishes the corresponding flow table in the flow table query unit 3 through the table establishment unit 4, enters the application layer analysis module 23 corresponding to the processing unit 2 to conduct application layer analysis and output final analysis results, the processing unit 5 receives the link establishment message sent by the network card 1, enters the link layer analysis module 51 to conduct link layer analysis and output analysis results, sending the analysis result to the flow table inquiry module 52, entering the flow table inquiry unit 6 for flow table inquiry, entering the table construction unit 7 when the corresponding flow table is not found in the flow table inquiry unit 6, establishing a corresponding flow table in the flow table inquiry unit 6 through the table construction unit 7, entering the application layer analysis module 53 corresponding to the processing unit 5 for application layer analysis, outputting the final analysis result, simultaneously receiving the link establishment message sent by the network card 1 by the processing unit 8, entering the link layer analysis module 81 for link layer analysis, outputting the analysis result, sending the analysis result to the flow table inquiry module 82, entering the flow table inquiry unit 9 for flow table inquiry, entering the table construction unit 10 when the corresponding flow table is not found in the flow table inquiry unit 9, establishing a corresponding flow table in the flow table inquiry unit 9 through the table construction unit 10, an application layer analysis module 83 corresponding to the processing unit 8 is entered for application layer analysis, and a final analysis result is output; when the flow table querying unit 3 finds the corresponding flow table, the flow table enters the application layer parsing module 23 in the corresponding processing unit 2 for application layer parsing and outputs the final parsing result, when the flow table querying unit 6 finds the corresponding flow table, the flow table enters the application layer parsing module 53 in the corresponding processing unit 5 for application layer parsing and outputs the final parsing result, when the flow table querying unit 9 finds the corresponding flow table, the flow table enters the application layer parsing module 83 in the corresponding processing unit 8 for application layer parsing and outputs the final parsing result, and all the final parsing results are sent into the database 11 for storage in an aggregation mode.
Specifically, in the present embodiment, the lock-free processing system in the present application is described with respect to the data processing speed in three examples below:
example one:
CPU:Intel D1557(X86_64)；
operating system: CENTOS7.5;
flow mode: 100 ten thousand HTTP traffic, first packet length: 66 bytes;
number of traffic handling threads: 2;
first package performance (pps): 1.54M;
example two:
CPU:FT-2000+(ARM64)；
operating system: CENTOS8.2;
flow mode: 100 ten thousand HTTP traffic, first packet length: 66 bytes;
number of traffic handling threads: 2;
first package performance (pps): 1.32M;
example three:
CPU:FT-2000+(X86_64)；
operating system: CENTOS8.2;
flow mode: 2000 ten thousand TCP flows, first packet length: 66 bytes;
number of traffic handling threads: 3;
first package performance (pps): 1.8M.
It can be derived from the above examples that, by using the lock-free processing system in the present application, the first packet performance is improved for different traffic processing threads, and that using the lock-free processing system in the present application, the non-first packet performance is not affected.
In a preferred embodiment of the present invention, a lock-free processing method of a link establishment message is also provided, and is applied to a processor; including the lock-free processing system described above and shown in fig. 4, includes:
step S1, respectively sending the link establishment messages into a plurality of independent processing threads for link layer analysis;
step S2, inquiring whether a corresponding flow table exists or not according to an analysis result obtained by the link layer analysis:
if not, turning to step S3;
if yes, turning to step S4;
step S3, a TCP protocol stack is adopted to create a corresponding flow table, and then the step S4 is performed;
s4, respectively adopting corresponding flow tables to analyze an application layer of the link establishment message;
and S5, aggregating the final analysis result obtained by the analysis of the application layer, and then sending the aggregated analysis result into a database for storage.
In a preferred embodiment of the present invention, in step S2, a lock-free processing manner is adopted to query whether a corresponding flow table exists.
In a preferred embodiment of the present invention, in step S3, a corresponding flow table is created by using a lock-free processing method.
With respect to more implementation details of the method, the system is already disclosed, and this embodiment will not be repeated.
The foregoing description is only illustrative of the preferred embodiments of the present invention and is not to be construed as limiting the scope of the invention, and it will be appreciated by those skilled in the art that equivalent substitutions and obvious variations may be made using the description and illustrations of the present invention, and are intended to be included within the scope of the present invention.
Claims (9)
1. The lock-free processing system of a kind of link establishment message, set up in the processor; the system is characterized by comprising a plurality of independent processing units, wherein the input end of each processing unit is respectively connected to the output end of a network card, the output end of each processing unit is respectively connected to a database, and the query end of each processing unit is respectively connected to a flow table query unit;
each processing unit is used for bearing one processing thread, and each processing thread corresponds to one protocol stack;
each of the processing units comprises:
the link layer analysis module is used for acquiring the link establishment message output by the network card, analyzing the link establishment message and outputting an analysis result;
the flow table query module is connected with the link layer analysis module and is used for querying corresponding flow table information in the flow table query unit according to the analysis result and outputting a query result;
the application layer analysis module is connected with the flow table query module and is used for carrying out application layer analysis on the link establishment message according to the flow table when the query result is that the corresponding flow table exists in the flow table query unit, and summarizing the final analysis result into the database for storage;
the system also comprises a table building unit which is respectively connected with each processing unit and the flow table query unit and is used for building a corresponding flow table in the flow table query unit when the query result is that the flow table query unit does not have the corresponding flow table.
2. The lock-free processing system of claim 1, wherein the parsing result obtained by the link layer parsing module includes a message length and a message sequence number of the link establishment message.
3. The lock-free processing system of claim 1, wherein the flow table lookup module initiates a lookup to the flow table lookup unit using lock-free processing.
4. The lock-free processing system of claim 1, wherein the table building unit builds a corresponding flow table in the flow table lookup unit using lock-free processing.
5. The lock-free processing system of claim 1, wherein the tabulated unit is a TCP protocol stack.
6. The lock-free processing system of claim 1, wherein the final parsing results output by all the application layer parsing modules are sent to the database in an aggregated manner for storage.
7. A lock-free processing method of a link establishment message is applied to a processor; a lock-free processing system according to any one of claims 1-6, comprising:
step S1, respectively sending the link establishment message into a plurality of independent processing threads to perform link layer analysis;
step S2, inquiring whether a corresponding flow table exists or not according to an analysis result obtained by the link layer analysis:
if not, turning to step S3;
if yes, turning to step S4;
step S3, a TCP protocol stack is adopted to create a corresponding flow table, and then the step S4 is performed;
s4, respectively adopting a corresponding flow table to analyze an application layer of the link establishment message;
and S5, aggregating the final analysis result obtained by the analysis of the application layer, and then sending the aggregated analysis result into a database for storage.
8. The method of lock-free processing according to claim 7, wherein in step S2, whether a corresponding flow table exists is queried by means of lock-free processing.
9. The method of lock-free processing according to claim 7, wherein in step S3, a corresponding flow table is created by lock-free processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110336624.0A CN113098858B (en) | 2021-03-29 | 2021-03-29 | Lock-free processing system and method for link establishment message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110336624.0A CN113098858B (en) | 2021-03-29 | 2021-03-29 | Lock-free processing system and method for link establishment message |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113098858A CN113098858A (en) | 2021-07-09 |
| CN113098858B true CN113098858B (en) | 2023-07-14 |
Family
ID=76671083
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110336624.0A Active CN113098858B (en) | 2021-03-29 | 2021-03-29 | Lock-free processing system and method for link establishment message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113098858B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009103225A1 (en) * | 2008-02-18 | 2009-08-27 | 华为技术有限公司 | A packet forwarding method and equipment |
| CN103731356A (en) * | 2013-12-09 | 2014-04-16 | 福建星网锐捷网络有限公司 | Message processing method and device |
| CN111447145A (en) * | 2020-03-25 | 2020-07-24 | 联想(北京)有限公司 | Flow table management method, device, system and storage medium of multi-core system |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8768889B1 (en) * | 2004-04-07 | 2014-07-01 | Oracle America, Inc. | Method and apparatus for performing lock-free updates in a linked list |
| CN102710497A (en) * | 2012-04-24 | 2012-10-03 | 汉柏科技有限公司 | Method and system for processing messages of multi-core and multi-thread network equipment |
| CA2888684C (en) * | 2012-10-19 | 2017-03-07 | Argyle Data, Inc. | Multi-threaded, lockless data parallelization |
| CN102938000B (en) * | 2012-12-06 | 2015-08-19 | 武汉烽火网络有限责任公司 | Method for searching route is shown in flowing without lock of a kind of high-speed parallel |
| CN109962832B (en) * | 2017-12-26 | 2022-06-14 | 华为技术有限公司 | Message processing method and device |
| CN109379303A (en) * | 2018-08-22 | 2019-02-22 | 华东计算技术研究所（中国电子科技集团公司第三十二研究所） | Parallelization processing framework system and method based on improving performance of gigabit Ethernet |
-
2021
- 2021-03-29 CN CN202110336624.0A patent/CN113098858B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009103225A1 (en) * | 2008-02-18 | 2009-08-27 | 华为技术有限公司 | A packet forwarding method and equipment |
| CN103731356A (en) * | 2013-12-09 | 2014-04-16 | 福建星网锐捷网络有限公司 | Message processing method and device |
| CN111447145A (en) * | 2020-03-25 | 2020-07-24 | 联想(北京)有限公司 | Flow table management method, device, system and storage medium of multi-core system |
Non-Patent Citations (1)
| Title |
|---|
| NTCI-Flow:一种可扩展的高速网络流量处理框架;王煜骢;陈兴蜀;罗永刚;王岳;;工程科学与技术(S1);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113098858A (en) | 2021-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2419986C2 (en) | Combining multiline protocol accesses | |
| US8381201B2 (en) | Processing of expressions | |
| CN110287163B (en) | Method, device, equipment and medium for collecting and analyzing security log | |
| CN109800259B (en) | Data acquisition method and device and terminal equipment | |
| CN112788128B (en) | Business information pushing method and device, storage medium and electronic device | |
| EP3065343B1 (en) | Network monitoring method and apparatus, and packet filtering method and apparatus | |
| CN112751788A (en) | Double-plane switching method supporting multi-type frame mixed transmission | |
| CN109861998B (en) | Plug-in type dynamic analysis system and method based on Beidou short message protocol | |
| CN113098858B (en) | Lock-free processing system and method for link establishment message | |
| CN114125015A (en) | Data acquisition method and system | |
| CN113420032A (en) | Classification storage method and device for logs | |
| CN112688924A (en) | Network protocol analysis system | |
| CN114422617B (en) | Message processing method, system and computer readable storage medium | |
| CN113507465B (en) | socket and http shared port and message processing method and device thereof | |
| US8625619B2 (en) | Domain gateway control system and method thereof | |
| WO2021128936A1 (en) | Message processing method and apparatus | |
| WO2021129849A1 (en) | Log processing method, apparatus and device, and storage medium | |
| CN114979307A (en) | Communication protocol analysis method, intelligent terminal and storage medium | |
| CN115776434A (en) | RDMA data transmission system, RDMA data transmission method and network equipment | |
| CN107707492B (en) | Method and device for reporting and issuing message | |
| CN112417015A (en) | Data distribution method and device, storage medium and electronic device | |
| CN117354400B (en) | Acquisition and analysis service system for Beidou short message | |
| CN115996203B (en) | Network traffic domain division method, device, equipment and storage medium | |
| CN115499338B (en) | Data processing method, device, medium and cloud network observation system | |
| EP4089960A1 (en) | Method and device for acquiring data |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 200031 No. 76, Yueyang Road, Shanghai, Xuhui District Applicant after: Shanghai Chen Rui Mdt InfoTech Ltd. Address before: No.76 Yueyang Road, Xuhui District, Shanghai 200030 Applicant before: SHANGHAI CHENRUI INFORMATION TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |