Binary search schemes for fast IP lookups

Mehrotra, P.; Franzon, Paul D.

doi:10.1109/glocom.2002.1188551

Cited by 4 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [7] also shows that the average search length of path-compressed trie is 20 for a routing table with 47k entries. Reference [8] also point out that in the NetBSD implementation of the Patricia tree the average length of the search is 1.441og2(N). In a word, all these schemes take many memory accesses for a route update.…”

mentioning

confidence: 99%

An Efficient Hashing-Based Scheme for RIB Management

Zhao

Liu

Wang

et al. 2006

2006 First International Conference on Communications and Electronics

View full text Add to dashboard Cite

In consideration of the exact matching characteristic of RIB lookups, we explore the applicability of hashing-based approaches for RIB management and evaluate their performance. Using real routing prefixes, we compare the efficiency of six different hash approaches mentioned in some papers about IP lookups: bit extraction from the routing prefix, CRC16 (Cyclic Redundancy Checking polynomials), CRC32, Fletcher Checksum, folding of prefix octets for using the exclusive-or operation and multiplication. This is the first comprehensive study of their performance using real core routing tables. We find that extracting the least significant bits from the routing prefix is a very efficient hash approach for RIB management. Then a RIB management scheme based on this hash approach is proposed. We use separate chaining as the collision resolution strategy, while not suffering from malloc/free overhead for frequent insertion or deletion. To keep the memory storage moderate, we set the hash table sizes based on the distribution of prefix lengths because it is not expected to change significantly with time. Through simulation, we find that this scheme can achieve very fast updates and fast lookups for routing prefixes while keep the memory storage moderate.

show abstract

mentioning

confidence: 99%

An Efficient Hashing-Based Scheme for RIB Management

Zhao

Liu

Wang

et al. 2006

2006 First International Conference on Communications and Electronics

View full text Add to dashboard Cite

show abstract

“…The Sclleme in [9] Entries Size V. CONCLUSION The stage division lookup engine proposed in t h s paper has advantages: fast lookup (one memory access per lookup), fast table updates and low memory requirement. O u r design is shown for IPv4.…”

Section: Performance Analysismentioning

confidence: 98%

Pipelined architecture for fast IP lookup

Zhao

Lea

Huang

HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.

View full text Add to dashboard Cite

Abstrucf-EP lookup is a key step in IP processing and many algorithms have been proposed The challenges are speed, fast table updates, cost and power consumption. In this paper, we propose a RAM-based architecture for i P lookup. The design requirements are the following: one memory access per lookup, reasonable amount of memory requirement, and fast table updates. We show the design and its performance in the paper.

show abstract

A Novel Level-Based IPv6 Routing Lookup Algorithm

Huang

Zhao

et al. 2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Binary search schemes for fast IP lookups

Cited by 4 publications

References 12 publications

An Efficient Hashing-Based Scheme for RIB Management

An Efficient Hashing-Based Scheme for RIB Management

Pipelined architecture for fast IP lookup

A Novel Level-Based IPv6 Routing Lookup Algorithm

Contact Info

Product

Resources

About