CN102014070A

CN102014070A - Method for improving hardware message classification rule matching efficiency through software

Info

Publication number: CN102014070A
Application number: CN2010105977560A
Authority: CN
Inventors: 贺志强; 万伟; 刘兴彬; 王泼; 朱春屹; 连仲维
Original assignee: TIANJIN SUGON COMPUTER INDUSTRY Co Ltd
Current assignee: Dawning Network Technology Co ltd
Priority date: 2010-12-17
Filing date: 2010-12-17
Publication date: 2011-04-13
Anticipated expiration: 2030-12-17
Also published as: CN102014070B

Abstract

The invention provides a method for improving hardware message classification rule matching efficiency through software. Through combination of software and hardware and the hash table storage rule, the software maintains the message classification rules, adjusts collision in the hash table and puts the new rules on the head of the collision chain when the rules are added or deleted, thus easily finding the most common rules and improving the rule matching efficiency.

Description

A kind of method that improves hardware message classification rule match efficient by software

Technical field

The present invention relates to the network data management field, be specifically related to a kind of method that improves hardware message classification rule match efficient by software.

Background technology

In hardware message classification system, storage for message rule, general most common form is that the mode of order array is stored, newly be configured to message classification rule in the hardware and be put into the end of rule list, yet because new rule of adding generally is the most frequently used at that time, along with the increase of regular capacity, this machine-processed matching efficiency can reduce.

In hardware message classification system, according to service needed, need frequent to the message classification rule increase, operation such as deletion, because in the original system, regular capacity is not very big, the mode of general all employings order array is stored, this storage is for the low capacity rule, to searching, increase, delete influence is not very big, but along with capacity increases, the drawback of this mechanism--efficient is low just slowly to come out.

In traditional ordinal number prescription formula storage, when increasing a rule, according to dope vector, increase rule at the end of array, when one of deletion is regular, scans this array and navigate to this rule position, delete this rule then, and follow-up rule is all moved forward a position.But along with business demand, regular capacity is increasing, and this efficient will be more and more lower.

Realize matched rule efficiently, general fashion is that the strictly all rules array is formed an array indexing, all up-to-date rule is placed on the foremost of whole array pointer, as increasing rule or deletion rule newly at every turn, the index of regulation rule guarantees the foremost of up-to-date rule in array.But increase along with regular capacity, the shortcoming of matching efficiency difference has appearred in the prior art scheme, because need quick matched rule for the message on the High Speed Network, and in this scheme, search a rule and need the too normal time, basically need to search whole regular array list, just complexity is the scale of O (n), could matched rule.

Summary of the invention

The objective of the invention is to solve the shortcoming of above-mentioned prior art scheme, by the mode of conflict chain is set,, design a hash function according to the characteristics of rule, guarantee that as far as possible each regular hash counts uniqueness and conflict minimizes, like this, when rule of needs coupling, only need to calculate this regular hash number, just can be in the hash position and the hash collision position find this rule, data in hardware are arrived, and when needing matched rule, have guaranteed the efficient of coupling.When increasing, during deletion rule, only need adjusting the relevant position and get final product according to hash number and hash conflict chained list.

A kind of method by software raising hardware message classification rule match efficient, it is characterized in that: step is as follows:

A, in host memory region of memory of application, wherein a part is used for storage rule, another part is used for storing the hash table;

B, by interface library, be that each rule generates hash keyword, and rule added in host memory rule list and the hardware rule list according to the hash keyword;

C, increase or during deletion rule, interface function is searched the position at the hash keyword place of this rule correspondence by the hash function, searches whether there is conflict, if there is not conflict, directly this rule is put in rule list and the rule conflict chain when needs; If there is conflict, then this rule is dosed a position of conflict chain place chained list;

D, interface library upgrade the storage rule in the host memory, after storage rule upgrades and finishes in the host memory, again according to adjusted rule list, upgrade the rule list of hardware end;

E, when the packets need rule match, by the hash function, search the rule in the hardware, according to the hash keyword, at hash key position and collision position matched rule.

The present invention creates a hash function according to the characteristic of rule, and is that each rule generates a hash number, by the hash number, rule is scattered in the array, when several rules have identical hash when counting, just there is conflict between them, searches concrete rule according to conflict relationship.Search so a regular efficient than sequential storage at the array efficiency height, simultaneously, because up-to-date rule is always on the head of conflict chain, matching efficiency is also the highest.

Description of drawings

Fig. 1 is a work schematic diagram of the present invention

Embodiment

The present invention searches characteristics fast by the hash table, sets up the hash table of a rule in Installed System Memory, realizes the efficient coupling of hardware message classification by the hash table.

Concrete scheme is as follows:

(1) region of memory of application in host memory, wherein in this piece region of memory, a part of storage rule, part storage hash table.

(2),, and rule is added in main frame rule list and the hardware rule list according to the hash number for each rule generates the hash number by interface library.

(3) when needs increase, deletion rule, interface function is by the hash function, and the hash that searches this rule correspondence counts the position at place, searches whether to have conflict, and if there is no conflict is directly put this rule in rule list and the rule conflict chain into; If there is conflict, then this rule is added to a position of conflict chain place chained list.

(4) influence the hardware message classification in order to prevent in the process of operation rules, interface library at first upgrades the storage rule of host side, after having upgraded the host side rule, again according to adjusted rule list, upgrades the rule list of hardware end.

(5) when the packets need matched rule, by the hash function, search the rule in the hardware, according to the hash number, put and the collision position matched rule in the hash numerical digit.

The present invention uses in the network security private server of dawn production, proves can realize big capacity rule is managed, and has improved regular matching efficiency.

Claims

1. one kind is improved the method for hardware message classification rule match efficient by software, and it is characterized in that: step is as follows: