A Comparison of Hashing Schemes for Address Lookup in Computer Networks
R. Jain
TL;DR
This paper evaluates various hashing functions for address lookup in computer networks, providing performance guidelines based on empirical analysis of different schemes using address reference traces.
Contribution
It offers a comparative analysis of multiple hashing schemes and practical guidelines for selecting hash sizes to optimize address lookup performance.
Findings
CRC polynomials and Fletcher checksum show high efficiency
Hash size directly impacts lookup performance
Guidelines help in choosing appropriate hash functions and sizes
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.