arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9809087cs.NI
收藏

计算机网络地址加密中散列方案的比较

A Comparison of Hashing Schemes for Address Lookup in Computer Networks

R. Jain

摘要:

使用地址引用的跟踪,我们比较了几种不同的散列函数的效率,例如循环冗余校验(CRC)多项式,Fletcher校验和,使用“异或”运算折叠地址八位组和从地址中提取位。提供了用于确定实现指定性能水平所需的哈希标记的大小的准则。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑