DocumentCode
1193992
Title
A comparison of hashing schemes for address lookup in computer networks
Author
Jain, Raj
Author_Institution
Digital Equipment Corp., Littleton, MA, USA
Volume
40
Issue
10
fYear
1992
fDate
10/1/1992 12:00:00 AM
Firstpage
1570
Lastpage
1573
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;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.168785
Filename
168785
Link To Document