Title :
A comparison of hashing schemes for address lookup in computer networks
Author_Institution :
Digital Equipment Corp., Littleton, MA, USA
fDate :
10/1/1992 12:00:00 AM
Abstract :
Using a trace of address references, the author compares the efficiency of several different hashing functions such as cyclic redundancy checking 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 hash masks required to achieve a specified level of performance
Keywords :
computer networks; file organisation; table lookup; Fletcher checksum; address lookup; bit extraction; computer networks; cyclic redundancy checking polynomials; exclusive-OR operation; folding of address octets; hash masks; hashing functions; hashing schemes; Bridges; Computer networks; Cyclic redundancy check; Databases; Entropy; Guidelines; Helium; Intelligent networks; Local area networks; Polynomials;
Journal_Title :
Communications, IEEE Transactions on
