R. Jain, "A Comparison of Hashing Schemes for Address Lookup in Computer Networks," IEEE Transactions on Communications, Vol. 40, No. 3, October 1992, pp. 1570-1573.
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.
Complete paper in Adobe Acrobat (278,383 Bytes)
A more detailed version of the paper is available in a DEC Technical Report