A Comparison of Hashing Schemes for Address Lookup in Computer Networks

Details A Comparison of Hashing Schemes for Address Lookup in Computer Networks A Comparison of Hashing Schemes for Address Lookup in Computer Networks

1998-09-24

arxiv.org/abs/cs/9809087v1

IEEE Transactions on Communications, Vol. 40, No. 3, October 1992, pp. 1570-1573

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Comparison of Hashing Schemes for Address Lookup in Computer Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Comparison of Hashing Schemes for Address Lookup in Computer Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Comparison of Hashing Schemes for Address Lookup in Computer Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708948