A Comparison of Hashing Schemes for Address Lookup in Computer Networks

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.

• Type: Journal
• Year: 1992
• Where: IEEE Transactions on Communications
• Authors: R. Jain
• Keywords: Address Lookup, Computer Networks, Hashing Schemes