A Comparison of Hashing Schemes for Address Lookup in Computer Networks
arXiv:cs/9809087 · doi:10.1109/26.168785
Abstract
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, folding of address octets using the exclusive-or operation and bit extraction from the address. Guidelines are provided for determining the size of the hashmark required to achieve a specified level of performance.