A comparison of hashing schemes for address lookup in computer networks
| Autor: | Raj Jain |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Computer Science - Networking and Internet Architecture C.2.1 Computer engineering Computer science Cyclic redundancy check Hash function Folding (DSP implementation) Electrical and Electronic Engineering Fletcher's checksum TRACE (psycholinguistics) |
| Zdroj: | IEEE Transactions on Communications. 40:1570-1573 |
| ISSN: | 0090-6778 |
| DOI: | 10.1109/26.168785 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|