A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Networking and Internet Architecture
2016-11-15 v1
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 performance.
Cite
@article{arxiv.cs/9809087,
title = {A Comparison of Hashing Schemes for Address Lookup in Computer Networks},
author = {R. Jain},
journal= {arXiv preprint arXiv:cs/9809087},
year = {2016}
}