Message distribution method and device based on multiple hashes

Abstract

The invention provides a message distribution method and device based on multiple hashes. The method comprises the steps of: respectively calculating two hash results by utilizing two hash algorithms,taking a result that a spatial main table is searched by utilization of one hash result as a reference index, and taking a result that a spatial sub-table is searched by utilization of the other hashresult as an auxiliary index correction reference index. The device comprises a first calculation unit, a second calculation unit, a first searching unit, a second searching unit and a third calculation unit; the first calculation unit is used for calculating a hash result A by utilizing a hash algorithm A; the second calculation unit is used for calculating a hash result B by utilizing a hash algorithm B; the first searching unit is used for searching a hash spatial main table by utilizing the result A, so that a search result a is obtained; the second searching unit is used for searching ahash spatial sub-table by utilizing the result B, so that a search result b is obtained; and the third calculation unit is used for judging a conflict condition of the search result a, and calculatinga search destination table item index. According to the message distribution method and device based on multiple hashes provided by the invention, a double-hash search sequence is constructed by utilization of two hash functions; therefore, the conflict is effectively avoided; the distribution time is saved; and the distribution efficiency is increased.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a method and device for distributing messages based on multiple hashing. Background technique [0002] With the continuous expansion of the Internet scale and the continuous improvement of application technology, more and more services need to classify data packets in real time and quickly. For various network packet processing functions, the ability to accurately and efficiently distinguish and identify packets is the key, but the more complex the packet parsing field, the greater the processing consumption required and the lower the parsing efficiency. For this reason, many algorithms have emerged, such as hash (hash) algorithm, linear lookup table, content lookup algorithm, etc., in order to realize packet classification processing more accurately and efficiently. [0003] Hash, generally translated as "hash", and also directly transliterated as "hash", is to convert an inp...

AI Technical Summary

Problems solved by technology

[0004] However, the commonly used Hash algorithm cannot guarantee the unique correspondence between the input value and the output value, that is, a conflict occurs, resulting in a long time-consuming split filtering

Images