A comparison of hashing schemes for address lookup in computer networks
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 40 (10) , 1570-1573
- https://doi.org/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 performanceKeywords
All Related Versions
This publication has 2 references indexed in Scilit:
- Characteristics of destination address locality in computer networks: A comparison of caching schemesComputer Networks and ISDN Systems, 1990
- An Arithmetic Checksum for Serial TransmissionsIEEE Transactions on Communications, 1982