A Comparison of Hashing Schemes for Address Lookup in Computer Networks
<|reference_start|>A Comparison of Hashing Schemes for Address Lookup in Computer Networks: 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.<|reference_end|>
@article{jain1998a,
    title={A Comparison of Hashing Schemes for Address Lookup in Computer Networks},
    author={R. Jain},
    journal={IEEE Transactions on Communications, Vol. 40, No. 3, October 1992,
  pp. 1570-1573},
    year={1998},
    doi={10.1109/26.168785},
    archivePrefix={arXiv},
    eprint={cs/9809087},
    primaryClass={cs.NI}
}