A COMPARISON OF HASHING SCHEMES FOR ADDRESS LOOKUP IN COMPUTER-NETWORKS

被引:44
作者
JAIN, R
机构
[1] Digital Equipment Corporation, Littleton
关键词
D O I
10.1109/26.168785
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1570 / 1573
页数:4
相关论文
共 5 条
[1]   AN ARITHMETIC CHECKSUM FOR SERIAL TRANSMISSIONS [J].
FLETCHER, JG .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (01) :247-252
[2]   CHARACTERISTICS OF DESTINATION ADDRESS LOCALITY IN COMPUTER-NETWORKS - A COMPARISON OF CACHING SCHEMES [J].
JAIN, R .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1990, 18 (04) :243-254
[3]  
JAIN R, 1989, TR593 DEC TECH REP
[4]  
Sedgewick R, 1988, ALGORITHMS
[5]  
1982, ETHERNET LOCAL AREA, P95