A Comparison of Hashing Schemes for Address Lookup in Computer Networks

Raj Jain

doi:10.1109/26.168785

A Comparison of Hashing Schemes for Address Lookup in Computer Networks

Raj Jain

Department of Computer Science & Engineering

Research output: Contribution to journal › Article › peer-review

76 Scopus citations

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 hash masks required to achieve a specified level of performance.

Original language	English
Pages (from-to)	1570-1573
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	40
Issue number	10
DOIs	https://doi.org/10.1109/26.168785
State	Published - Oct 1992

Access to Document

10.1109/26.168785

Cite this

@article{8910189cc10b4f36bd99ca6d6de2aa14,

title = "A Comparison of Hashing Schemes for Address Lookup in Computer Networks",

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 hash masks required to achieve a specified level of performance.",

author = "Raj Jain",

year = "1992",

month = oct,

doi = "10.1109/26.168785",

language = "English",

volume = "40",

pages = "1570--1573",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

number = "10",

}

TY - JOUR

T1 - A Comparison of Hashing Schemes for Address Lookup in Computer Networks

AU - Jain, Raj

PY - 1992/10

Y1 - 1992/10

N2 - 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 hash masks required to achieve a specified level of performance.

AB - 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 hash masks required to achieve a specified level of performance.

UR - https://www.scopus.com/pages/publications/0026933085

U2 - 10.1109/26.168785

DO - 10.1109/26.168785

M3 - Article

AN - SCOPUS:0026933085

SN - 0090-6778

VL - 40

SP - 1570

EP - 1573

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 10

ER -

A Comparison of Hashing Schemes for Address Lookup in Computer Networks

Abstract

Access to Document

Other files and links

Fingerprint

Cite this