CN1331336C - Rapid analyzing method for data pack - Google Patents
Rapid analyzing method for data pack Download PDFInfo
- Publication number
- CN1331336C CN1331336C CNB2004100132172A CN200410013217A CN1331336C CN 1331336 C CN1331336 C CN 1331336C CN B2004100132172 A CNB2004100132172 A CN B2004100132172A CN 200410013217 A CN200410013217 A CN 200410013217A CN 1331336 C CN1331336 C CN 1331336C
- Authority
- CN
- China
- Prior art keywords
- protocol
- protocol header
- information
- header
- data packet
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
本发明公开了一种数据包的快速解析方法，采用基于查找表的专用集成电路实现技术，对数据包头信息进行有效的解析和抽取。其步骤为：①数据包解析及信息抽取：依据数据包头定位和信息抽取操作表，对数据包进行解析和信息抽取处理，并生成数据包信息关键字。②数据包查找关键字生成：完成数据包的解析和信息抽取之后，依据用户指定的查找关键字生成规则，生成查找关键字。本发明通过修改规则表的相应内容可以达到修改对数据包的具体解析方法和定义新的协议头类型处理方法，其灵活性和可扩展性很强。同时，采用多级流水线并行处理的方式，很大程度上减少了数据包的解析处理周期，获得了对数据报文的高速处理。
The invention discloses a fast parsing method of a data packet, which adopts a special integrated circuit realization technology based on a lookup table to effectively parse and extract the header information of the data packet. The steps are: ① Data packet analysis and information extraction: According to the data packet header location and information extraction operation table, the data packet is analyzed and information extracted, and the data packet information keywords are generated. ② Data packet search keyword generation: After the data packet analysis and information extraction are completed, the search keyword is generated according to the search keyword generation rules specified by the user. The present invention can modify the specific parsing method of the data packet and define a new protocol header type processing method by modifying the corresponding content of the rule table, and has strong flexibility and expandability. At the same time, the parallel processing of multi-stage pipelines is adopted, which greatly reduces the analysis and processing cycle of data packets, and obtains high-speed processing of data packets.
Description
Technical field
The invention belongs to network communicating system and applied technical field, be specifically related to that packet is resolved and the method for information extraction, it is applicable in the network equipments such as network processing unit, router, switch the processing to packet.
Background technology
Along with the Internet scale constantly increases, miscellaneous service is more and more.Because network traffic data is increasing, this just requires the network equipment to have efficient and fast data bag dissection process technology comes to provide reliable service for the user.
At present, be used for the method that network packet is resolved is mainly contained two kinds.A kind of is to adopt the software processes pattern, and its basic thought is that based on many lean instruction sets CPU architecture mode, it is made up of the CPU of a plurality of equities, according to designing requirement it is write different programs, finishes different functions.General processor exchanges by mode and each lean instruction set CPU of shared drive, and unified function is finished in cooperation mutually.It adopts following pattern usually to the processing of packet: reception-storage-processing-transmission.Use to memory in data communication mainly contains the buffer-stored of bag and the search of look-up table.The storage of the buffering of each bag needs access memory at least 4 times: writing when network is received bag; Read frame and be used for the look-up table search; The reformed bag of write-back is used for transmission; Reading bag transmits.Like this, provide the linear speed handling property, the bandwidth that requires buffer storage is 4 times of network link bandwidth at least.Add the intrinsic expense of memory itself, the memory theoretical bandwidth is the twice of actual bandwidth, and therefore, the bandwidth of buffer should be 8 times of actual bandwidth.In fact Tong Xin full-duplex mode, the bandwidth of requirement also needs to double.Memory becomes the critical component of network processing unit, and its storage speed directly affects the ability of network transaction data aspect.Command function in the lean instruction set familiar instruction set is single, need many instructions when carrying out complex task, the shortcoming of bringing thus is that the time overhead of a large amount of instructions is big when carrying out complex task, so such processor can't satisfy the processing requirements of a plurality of gigabit ports mostly.
Another kind is to adopt many dedicated IC chips framework, and wherein each functional part is different devices, independently finishes the task of oneself, functions such as finishing classification respectively, make a strategic decision and communicate by letter with general processor.The appearance of application-specific integrated circuit (ASIC) special chip technology can be separated from each other data plane and signaling aspect, and it is solidificated in the operation of data plane such as route querying, processing data packets in the hardware chip, has improved the speed of processing data packets greatly.Shortcoming is a very flexible, in case design is finished, function expansibility is relatively poor.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art part, a kind of fast resolving method of packet is provided, this method can realize the fast processing to packet, and its autgmentability is strong.
In order to realize the foregoing invention purpose, the fast resolving method of a kind of packet provided by the invention may further comprise the steps:
(1) to the parsing in data packet header and the extraction of information, concrete steps comprise:
(1) protocol header of each grade of initialization location and information extraction table, protocol mapping table, lower-layer protocols concordance list and search key create-rule table; Wherein, protocol header location and information extraction table are used for depositing the processing method to packet variety of protocol head, localization method and data packet head information extraction method comprising original position, protocol mapping table is used for the coding of the variety of protocol that storage system can support, the lower-layer protocols concordance list is used for depositing the index value of all kinds of lower-layer protocols at protocol header location and information extraction table; Search key create-rule table is used to deposit the generation method of search key;
(2) judge whether processed protocol header is first protocol header of packet, if then get the initializtion protocol head type index value and the initializtion protocol head positional value of system default; Otherwise, take out the positional value of the lower-layer protocols head that when handling the upper-layer protocol head, obtains and the index value of lower-layer protocols head;
(3) index value with the resulting protocol head removes to search protocol header location and information extraction table, obtains the processing rule of current data packet;
(4) if the value identification process of the global operation list item in the table is finished, then packet is resolved and the data pick-up EO, enters step (two), otherwise, carry out step (5), (6) and (7) simultaneously;
(5) give lower-layer protocols head location according to locating rule, its step is as follows:
(5.1) judge whether the agreement length field exists in the protocol header, if exist, then extract the data of this length field, otherwise, according to the content in the form in two kinds of situation, the one, multi protocol label switching protocol adopts special-purpose processing mode, the 2nd, the agreement of regular length is then got the protocol header length that pre-defines;
(5.2) according to the original position of following formula (1) calculating lower-layer protocols head, enter step (2);
(5.2) according to the original position of following formula (1) calculating lower-layer protocols head, enter step (2); A lower-layer protocols start bit=this layer protocol head start bit+this layer protocol head length degree (1)
(6) determine the type of lower-layer protocols, the steps include:
(6.1) judge whether the lower layer protocol type territory exists in the protocol header, the protocol header index that does not exist then employing to pre-define enters step (3); Otherwise extract the data in protocol type territory, and continue to carry out following steps (6.2), step (6.3) and step (6.4):
(6.2) the data search protocol mapping table in the protocol type territory that obtains with step (6.1) obtains the mapping value a of agreement, b, c, d;
(6.3) agreement mapping value a, b, c, d calculates offset address by formula (2):
offset＝a*2^α+b*2^β+c*2^λ+d*2^μ (2)
Wherein, α, β, λ, μ obtains by searching protocol header location and information extraction table;
(6.4) the plot list item addition in above-mentioned offset address and protocol header location and the information extraction table is obtained an absolute address`, search the lower-layer protocols concordance list, obtain a lower-layer protocols index value, enter step (2) with this absolute address`;
(7) protocol header information extraction, concrete steps are as follows:
(7.1) judge whether extraction information byte mask is 0, if, then no longer extract information, end step (7), otherwise continue to carry out following operation;
(7.2) extract the protocol header relevant information according to extracting the information byte mask;
(7.3) information that extracts is inserted the correspondence position of packet information keyword;
(7.4) revise packet information keyword identification code according to message identification code, enter step (2);
(2) generate search key
According to the search key create-rule sign that in protocol header location and information extraction table, obtains for the last time, in search key create-rule table, find corresponding search key generation method, then, according to packet information keyword and packet information keyword identification code, generate search key according to above-mentioned search key generation method.
How packet being carried out dissection process adopts fully by searching the respective rule table and determines, therefore, can reach concrete analytic method and the definition new protocol header type of process method of modification to packet by the corresponding contents of revising rule list, its flexibility and extensibility are very strong.Simultaneously, adopt the mode of multi-stage pipeline parallel processing, reduced the dissection process cycle of packet to a great extent, obtained high speed processing the data message.
Description of drawings
Fig. 1 is the pipeline processes schematic diagram of a multi-layer protocol packet;
Fig. 2 resolves and the information extraction flow chart for packet;
Fig. 3 is the protocol mapping table schematic diagram;
Fig. 4 is a lower-layer protocols concordance list schematic diagram;
Fig. 5 is a protocol header information extraction schematic diagram;
Fig. 6 is a packet information keyword schematic diagram;
Fig. 7 concerns schematic diagram for extracting information byte mask and message identification code.
Embodiment
At first the symbol shown in a pair of Figure of description of employing is illustrated.
Table one
For convenience of explanation, the content of employing table two pair protocol header location and information extraction table is illustrated.
| Contents in table | Action Specification |
| Global operation (OP0) | The global operation indication, use different value representations respectively: finishing dealing with abandons this layer data packet header and abandons total packet for IP fragmentation, the processing of lower floor's packet index value |
| Length computation (OP1) | This layer protocol head length calculation method represents with different value: do not do any operation and get low 4 of length field in this layer protocol head with predefined regular length and take advantage of 4 high 4 of getting length field in this layer protocol head to take advantage of 4 to be used for the multi protocol label switching protocol head |
| Index operation (OP2) | Lower floor's index operation, different value is represented: do not do any operation and adopt the PT thresholding computation of table lookup of this layer head to adopt predefined index to be used for the Ethernet protocol head, lower layer protocol type value＜=0x05DC: finish dealing with; Lower layer protocol type value＞0x05DC: with its lower layer protocol type value computation of table lookup |
| Regular length | Predefined protocol header length |
| Offset address | The offset address of protocol header length field |
| Width | The length of protocol header length field |
| The agreement index | The lower layer protocol type index, pre-defined |
| The agreement skew | Lower layer protocol type territory offset address |
| The agreement width | The length in lower layer protocol type territory |
| The protocol header sign | Be used to write down the data packet head of having resolved |
| Extract the information byte mask | Which byte will be extracted in this layer of head |
| Search key create-rule sign | Identify the create-rule of the search key of this packet |
| Message identification code | Show the information that has extracted |
| Plot | The base address of this protocol header in the lower-layer protocols concordance list |
| A | The possible maximum of preceding 4 bits in the lower layer protocol type territory |
| B | The possible maximum of time 4 bits in the lower layer protocol type territory |
| C | The possible maximum of the 3rd 4 bits in the lower layer protocol type territory |
| D | The possible maximum of last 4 bits in the lower layer protocol type territory |
| α | Calculate a lower-layer protocols index address: the weights of preceding 4 bits in the lower-layer protocols territory (the α position moves to left) |
| β | Calculate a lower-layer protocols index address: the weights (the β position moves to left) of time 4 bits in the lower-layer protocols territory |
| λ | Calculate a lower-layer protocols index address: the weights of the 3rd 4 bits in the lower-layer protocols territory (the λ position moves to left) |
| μ | Value is 0 |
1 explanation packet is resolved the pipeline processes framework at first, in conjunction with the accompanying drawings:
As shown in Figure 1, at a multi-layer protocol combining structure of packet on the network, adopt multi-stage pipeline arrangement successively every layer protocol header parsing to be handled.Each of streamline grade identical integrated circuit structure special of employing is finished identical function.Different is that every level production line all has location, a sets of data packet header and information extraction operation table separately, has disposed data parsing and the information extraction processing rule of finishing this layer protocol head in the table.Adopt the processing method of multi-stage pipeline, improved processing data packets speed.The specific descriptions of pipeline processes are as follows:
(1) according to data packet head architectural feature on the network, each level of pipeline processes is finished identical functions, and its hardware structure is the same.
(2) each level production line is finished following work: the data message that extracts this layer protocol head; Calculate the original position of next layer protocol head; Obtain the types value of lower-layer protocols head, and obtain this lower-layer protocols head at the protocol header location of following level production line and the index value in the information extraction table, obtain the rule of its subordinate's pipeline processes by searching protocol mapping table and lower-layer protocols concordance list.
(3) progression of streamline does not have fixing requirement, and for the structure of current network data pack protocol head, designing 5 level production lines can meet the demands.When in a single day dedicated IC chip is decided, its pipeline series also just has been fixed up.Each level all has corresponding data packet head location and information extraction operation table.The user can revise the content of table as required, to support the dissection process of novel protocol header.
Specify the step of packet fast resolving below again:
The first step is to the parsing in data packet header and the extraction of information.Whole process is to carry out according to the rule of data packet head location and the definition of information extraction operation table.
In conjunction with the accompanying drawings 2, packet is resolved and the concrete steps of information extraction are described below:
(1) data packet head of each grade of initialization location and information extraction operation table (comprising protocol header location and information extraction table, protocol mapping table and lower-layer protocols concordance list) and search key create-rule table.
Whether be first protocol header of data, be initializtion protocol head type index value and the initializtion protocol head positional value of then getting system default if (2) judging processed; Otherwise, take out the index value of the lower-layer protocols head that when handling the upper-layer protocol head, obtains and the positional value of lower-layer protocols head.
(3) index value with the protocol header that obtains in the step (2) removes to search protocol header location and information extraction table, obtains the processing rule of current data packet.
(4) if the value identification process of the global operation list item in the table is finished, then packet is resolved and the data pick-up EO, otherwise, carry out the operation in (5), (6) and (7) step simultaneously.
(5) give lower-layer protocols head location according to locating rule.Its concrete steps are as follows:
(a) judge whether the agreement length field exists in the protocol header, have the data that then extract this length field, otherwise, in two kinds of situation, the one, multi protocol label switching protocol adopts special-purpose processing mode, the 2nd, the agreement of regular length is then got the protocol header length that pre-defines.
(b) the following formula (1) of foundation calculates the original position of lower-layer protocols head:
A lower-layer protocols start bit=this layer protocol head start bit+this layer protocol head length degree (1)
(6) determine the type of lower-layer protocols, its concrete steps are as follows:
(a) judge whether the lower layer protocol type territory exists in the protocol header, the protocol header index that does not exist then employing to pre-define; Otherwise extract the data in protocol type territory, and continue to carry out following steps (b), step (c) and step (d).
(b) the data search protocol mapping table in the protocol type territory that obtains with step (a) obtains the mapping value a of agreement, b, c, d, wherein a, b, c, d are respectively first in the lower layer protocol type territory, two, three, four 4 bit values are searched protocol mapping table successively, the agreement mapping value that obtains, when the lower-layer protocols types value does not have 16 bit long, a, the b value is 0.
(c) utilize formula (2) to calculate offset address.
offset＝a*2^α+b*2^β+c*2^λ+d*2^μ (2)
(d) add that with this offset address the plot list item in protocol header location and the information extraction table obtains an absolute address`, search the lower-layer protocols concordance list, obtain a lower-layer protocols index value with this absolute address`.
(7) protocol header information extraction, concrete steps are as follows:
(a) judge whether extraction information byte mask is 0, is the information that then no longer extracts; Otherwise the operation below continuing to carry out.
(b) extract the protocol header relevant information according to extracting the information byte mask
(c) information that extracts is inserted the correspondence position of packet information keyword
(d) revise packet information keyword identification code according to message identification code
In second step, generate search key
According to the search key create-rule sign that in protocol header location and information extraction table, obtains for the last time, in search key create-rule table, find corresponding search key generation method, then, according to packet information keyword and packet information keyword identification code, generate search key according to above-mentioned search key generation method.
Table two has been listed the contents in table of search key create-rule table.
| Contents in table | Explanation |
| Search rule | Expression search operation rule, comprise following several aspect: whether the search key conversion operations is opened.Opening will two search key of triggering for generating: normal search key and the search key of having changed, Content Addressable Memory is done twice search operation.If twice search operation all do not found, whether current search key is learned into Content Addressable Memory.Whether whether record transmits is upgraded identification field search rule enable bit after the operation of control protocol tag lookup is finished |
| Content Addressable Memory table block number | The table block that will search in the chosen content addressable memory |
| Global mask | Search mask, be used for the behaviour that searches of Content Addressable Memory |
| Do | |
| Search key byte mask | How indication generates search key |
| Search key conversion mask 1 | Search key source mask |
| Search key conversion mask 2 | Search key purpose mask |
Table two
The protocol header length calculation is described as follows:
For different protocol header, its length calculation method may be different.The agreement that has has fixing length; The length that has changes, and is provided by the length field in the protocol header; What also have will obtain by certain special-purpose computational methods, as multi protocol label switching protocol.Specifically describe as follows:
(1) for the regular length agreement, the value in the regular length territory of configuration protocol head location and information extraction table is its length value, and the value of OP1 is joined for adopting predefined regular length.Like this, application-specific integrated circuit (ASIC) can be according to this value of OP1 be got in the table fixed-length value as the length of its protocol header when handling.
(2) variable-length agreement, this quasi-protocol length can be obtained by the length field in its protocol header, is offset agreement width territory according to the good agreement of concrete protocol configuration in protocol header location and information extraction table.The value of OP1 is joined for getting low 4 or high 4 of length field in this layer protocol head and is taken advantage of 4.Transmission control protocol and Internet protocol belong to this quasi-protocol;
(3) multi protocol label switching protocol, its length have special-purpose computational methods.The value of OP1 is joined for being used for the multi protocol label switching protocol head, and can be used as multilayer multi protocol label switching protocol head stack is that a special protocol header is handled.The method of hardware using is by detecting the s territory (1 bit) in the multi protocol label switching protocol head, at the bottom of being the stack that was illustrated in the multilayer multi protocol label switching protocol head stack at 1 o'clock, just obtain the length of whole multi protocol label switching protocol protocol header by the statistical value of this protocol header number.
The structure of 3 pairs of protocol mapping tables describes in conjunction with the accompanying drawings:
Protocol mapping table is that a width is 16 bits, and the degree of depth is 16 form.For convenience of description, protocol mapping table is equally divided into 4 row, is named as Table A, table B, table C and table D successively, first, second and third and four 4 bit values of being respectively applied for the protocol class offset shine upon.The content of Table A is to determine like this: first 4 bit value of required all the protocol class offsets to be processed of Table A, it is one or several numeral that drops in 0 to 0x0F, we are index value the relevant position in Table A of these several numerals as the degree of depth, insert successively since 0 Digital ID it, f is filled out in other positions.Table B, table C adopt identical method construct with table D.
Be the computing formula and the explanation thereof of offset address in the lower-layer protocols concordance list below:
offset＝a*2^α+b*2^β+c*2^λ+d*2^μ (2)
Wherein, a, b, c, d first, second, third and fourth 4 bit mapping value among Table A, table B, table C and the table D in protocol mapping table respectively of being followed successively by protocol type territory in this layer protocol head.α and β and λ can find in protocol header location and information extraction table, and its value is calculated with following formula by protocol mapping table:
μ＝0，
min{2^λ＞Max(d)*2^μ}＝＞λ
min{2^β＞Max(c)*2^λ+Max(d)*2^μ}＝＞β
min{2^α＞Max(b)*2^β+Max(c)*2^λ+Max(d)*2^μ}＝＞α
Being described as follows of plot list item in protocol header location and the information extraction table:
The depth calculation formula that data packet header is occupied in the lower-layer protocols concordance list is:
depth＝Max(a)*2^α+Max(b)*2^β+Max(c)*2^λ+Max(d)*2^μ
So in protocol header location and information extraction table, the plot list item value of first stature is that the base value of 0, the second stature is the depth of 0+ first stature, the base value of the 3rd stature be the front head depth value with, the rest may be inferred.
In conjunction with the accompanying drawings 4, a lower-layer protocols concordance list is described below:
Content in the lower-layer protocols concordance list is the index of various protocol types in subordinate protocol header location and information extraction table.This layer of each protocol header of being supported has a size respectively and is the continuum of depth in a lower-layer protocols concordance list, the index value of storing the lower layer protocol type that it supports in this zone.
Be described as follows extracting the information byte mask in conjunction with Fig. 5:
Defined extraction information byte mask entry in protocol header location and information extraction table, it is to be used for showing how from the protocol header extracted data.When extracting information byte mask list item employing binary representation, each bit when this binary digit is that this byte is extracted in 1 expression, is that 0 expression is not extracted corresponding to a byte of data packet head.The extraction information byte mask list item of 32 bits can be handled the protocol header that reaches 32 byte wides, if protocol header length less than 32 bytes, we mend 0 in the mask back of this protocol header, benefit 0 in this protocol header not relevant corresponding byte.Mask value is 0xFFF00000 in the accompanying drawing 5, extracts destination address and source address information in the protocol header.
In conjunction with the accompanying drawings 6 and Fig. 7 as follows to data package informatin keyword and message identification code identifier declaration:
The packet information key length is 32 bytes, is used for storing data packet head information.When data packet header was resolved, extraction information and when inserting the packet information keyword was carried out record by message identification code to this.In the accompanying drawing 7, need to extract the SIP of IP head, DIP, information such as ID extract the corresponding SIP of information byte mask, and DIP, the mask value in ID territory are 1, and other thresholdings are 0.Accordingly, store SIP in the packet information keyword, DIP, the message identification code of the relevant position of ID is set at 1 and identifies.
Claims (3)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100132172A CN1331336C (en) | 2004-05-25 | 2004-05-25 | Rapid analyzing method for data pack |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100132172A CN1331336C (en) | 2004-05-25 | 2004-05-25 | Rapid analyzing method for data pack |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1585379A CN1585379A (en) | 2005-02-23 |
| CN1331336C true CN1331336C (en) | 2007-08-08 |
Family
ID=34600367
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100132172A Expired - Fee Related CN1331336C (en) | 2004-05-25 | 2004-05-25 | Rapid analyzing method for data pack |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1331336C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105554002A (en) * | 2015-12-22 | 2016-05-04 | 曙光信息产业股份有限公司 | Tunnel message analyzing method and device |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1909502B (en) * | 2005-08-01 | 2010-05-05 | 中兴通讯股份有限公司 | Device and method for fast positioning of data stream message head |
| CN101309406B (en) * | 2007-05-17 | 2010-06-16 | 中兴通讯股份有限公司 | DVB-H wireless signal simulating method and apparatus, IPDC protocol stack debug method and apparatus |
| CN101599894B (en) * | 2008-06-04 | 2013-01-30 | 华为技术有限公司 | Processing method, device and system for message with clock information |
| CN102867001B (en) * | 2011-07-05 | 2019-12-24 | 腾讯科技（北京）有限公司 | Method and device for acquiring information |
| CN102316121B (en) * | 2011-10-19 | 2013-11-20 | 武汉烽火网络有限责任公司 | Filtering matching preprocessing method supporting dynamic extended frame head and device |
| CN102739553B (en) * | 2012-07-20 | 2015-04-29 | 烽火通信科技股份有限公司 | Identification and processing device for Ethernet data packet |
| CN103929445B (en) * | 2013-01-11 | 2017-06-13 | 中国科学院声学研究所 | A kind of method of online analyzing HTTP chunked coded datas |
| CN103873464B (en) * | 2014-02-27 | 2017-05-10 | 华为技术有限公司 | Message processing method and forwarding equipment |
| CN104009923B (en) * | 2014-05-12 | 2017-07-14 | 中国人民解放军信息工程大学 | A kind of IPV6 message hardware analytic methods based on pointer iteration |
| CN106549817A (en) * | 2015-09-21 | 2017-03-29 | 深圳市中兴微电子技术有限公司 | Packet identification method and device |
| CN107783728B (en) * | 2016-08-31 | 2021-07-23 | 百度在线网络技术（北京）有限公司 | Data storage method, device and equipment |
| CN107704606B (en) * | 2017-10-17 | 2021-01-08 | 南京茂毓通软件科技有限公司 | Universal extraction method for instant chat protocol elements based on custom tag language |
| CN108327745B (en) * | 2018-01-02 | 2020-06-02 | 中车青岛四方机车车辆股份有限公司 | Real-time train data analysis method and device |
| WO2021087729A1 (en) * | 2019-11-05 | 2021-05-14 | Oppo广东移动通信有限公司 | Method and apparatus for indicating decompressed object, and communication device |
| CN111600796B (en) * | 2020-05-20 | 2021-10-01 | 中国电子科技集团公司第五十四研究所 | Flow identification device and method based on configurable analysis field |
| CN112100170B (en) * | 2020-08-05 | 2021-09-14 | 中科驭数（北京）科技有限公司 | Method and device for decoding interactive data of database |
| CN112732241B (en) * | 2021-01-08 | 2022-04-01 | 烽火通信科技股份有限公司 | Programmable analyzer under multistage parallel high-speed processing and analysis method thereof |
| CN115348046A (en) * | 2021-05-13 | 2022-11-15 | 华为技术有限公司 | Message transmission method and device |
| CN114006956B (en) * | 2021-10-29 | 2024-12-03 | 杭州迪普信息技术有限公司 | Message data analysis method, device and equipment |
| CN115883681B (en) * | 2023-02-08 | 2023-06-23 | 天翼云科技有限公司 | Message parsing method, device, electronic device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6366961B1 (en) * | 1999-03-03 | 2002-04-02 | Nokia Telecommunications, Oy | Method and apparatus for providing mini packet switching in IP based cellular access networks |
| CN1411210A (en) * | 2002-03-08 | 2003-04-16 | 华为技术有限公司 | Method of acting address analytic protocol Ethernet Switch in application |
| CN1450754A (en) * | 2003-04-11 | 2003-10-22 | 华中科技大学 | Scheduling method for data pocket |
| US6697845B1 (en) * | 2000-05-25 | 2004-02-24 | Alcatel | Network node management system and method using proxy by extensible agents |
-
2004
- 2004-05-25 CN CNB2004100132172A patent/CN1331336C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6366961B1 (en) * | 1999-03-03 | 2002-04-02 | Nokia Telecommunications, Oy | Method and apparatus for providing mini packet switching in IP based cellular access networks |
| US6697845B1 (en) * | 2000-05-25 | 2004-02-24 | Alcatel | Network node management system and method using proxy by extensible agents |
| CN1411210A (en) * | 2002-03-08 | 2003-04-16 | 华为技术有限公司 | Method of acting address analytic protocol Ethernet Switch in application |
| CN1450754A (en) * | 2003-04-11 | 2003-10-22 | 华中科技大学 | Scheduling method for data pocket |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105554002A (en) * | 2015-12-22 | 2016-05-04 | 曙光信息产业股份有限公司 | Tunnel message analyzing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1585379A (en) | 2005-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1331336C (en) | Rapid analyzing method for data pack | |
| US6691124B2 (en) | Compact data structures for pipelined message forwarding lookups | |
| US7237058B2 (en) | Input data selection for content addressable memory | |
| CN1307564C (en) | Network switch and components and method of operation | |
| CN101160856B (en) | Network processor | |
| CN102364463B (en) | Hash-based method for searching CAM (central address memory) | |
| CN104243315B (en) | Device and method for uniquely enumerating the path in analytic tree | |
| CN101388030A (en) | Database and database processing methods | |
| CN110301120A (en) | Flow point class device, method and system | |
| CN102377664A (en) | TCAM (ternary content addressable memory)-based range matching device and method | |
| CN104012063A (en) | Controller for flexible and extensible flow processing in software-defined networks | |
| CN107770076A (en) | A kind of processing method of hash-collision, device and switching equipment | |
| CN103107945B (en) | A kind of system and method for fast finding IPV6 route | |
| CN103248573A (en) | Centralization management switch for OpenFlow and data processing method of centralization management switch | |
| CN106790762A (en) | Domain name analytic method and device | |
| CN111988231B (en) | Mask quintuple rule matching method and device | |
| CN105099916B (en) | Open flows route exchange device and its processing method to data message | |
| JP2003152782A (en) | System for retrieving packet destination | |
| US7739445B1 (en) | Circuit, apparatus, and method for extracting multiple matching entries from a content addressable memory (CAM) device | |
| CN101419630A (en) | Top-k item digging method and system in data flow | |
| CN101241499B (en) | Patricia tree rapid lookup method in high memory access wide | |
| CN110096458A (en) | Name data network content storage pool data retrieval method neural network based | |
| CN101534199A (en) | Character arrangement router | |
| CN110138661A (en) | Name data network content storage pool neural network based | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070808 Termination date: 20110525 |