A Comparison of Hashing Schemes for Address Lookup in Computer Networks

15 years 3 months ago

Download www.cse.wustl.edu

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.

R. Jain

Real-time Traffic

Address Lookup | Computer Networks | Hashing Schemes |

posted by rajain

» Characteristics of Destination Address Locality in Computer Networks A Comparison of Cachi...

» Advanced Hash Algorithms with Key Bits Duplication for IP Address Lookup

» Ternary CAM Compaction for IP Address Lookup

» A Low Power Lookup Technique for MultiHashing Network Applications

» A novel reconfigurable hardware architecture for IP address lookup

» Range Tries for scalable address lookup

» Scalable High Speed IP Routing Lookups

» Congestion Control for Distributed Hash Tables

Post Info
More Details (n/a)

Added	31 Jan 2009
Updated	31 Jan 2009
Type	Journal
Year	1992
Where	IEEE Transactions on Communications
Authors	R. Jain

Comments (0)

	System Level Modeling of IEEE 802.16e Mobile WiMAX Networks: Key Issues 453 views
	Congestion Control using Multilevel Explicit Congestion Notification 448 views
	Adaptive Multilevel Early Congestion Notification 420 views
	LED: Load Early Detection: A Congestion Control Algorithm based on Router Traffic Load 314 views
	Geometric Broadcast Protocol for Heterogeneous Wireless Networks 402 views

Sciweavers

A Comparison of Hashing Schemes for Address Lookup in Computer Networks

Address Lookup | Computer Networks | Hashing Schemes |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers