Longest prefix match and updates in range tries
Paper i proceeding, 2011
In this paper, we describe an IP-Lookup method for network routing. We extend the basic Range Trie data-structure to support Longest Prefix Match (LPM) and incremental updates. Range Tries improve on the existing Range Trees allowing shorter comparisons than the address width. In so doing, Range Tries scale better their lookup latency and memory requirements with the wider upcoming IPv6 addresses. However, as in Range Trees, a Range Trie does not inherently support LPM, while incremental updates have a performance and memory overhead. We describe the additions required to the basic Range Trie structure and its hardware design in order to store and dynamically update prefixes for supporting LPM. The proposed approach is prototyped in a Virtex4 FPGA and synthesized for 90-nm ASICs. Range Trie is evaluated using Internet Routing Tables and traces of updates. Supporting LPM roughly doubles the memory size of the basic Range Trie, which is still half compared to the second best related work. The proposed design performs one lookup per cycle and one prefix update every four cycles.
Longest prefix matches
Incremental updates
Memory overheads
Lookups
Plant extracts
Application specific integrated circuits
Network architecture
Computer architecture
Memory size
Lookup latency
Four cycles
Trie structures
IP lookup
Hardware design
Internet routing
Internet protocols
Memory requirements
Författare
Ioannis Sourdis
Chalmers, Data- och informationsteknik, Datorteknik
S. H. Katamaneni
TU Delft
Proceedings - 22nd IEEE International Conference on Application-Specific Systems, Architectures and Processors, Santa Monica, 11-14 September 2011
1063-6862 (ISSN)
51-58978-145771292-0 (ISBN)
Ämneskategorier
Datorteknik
Styrkeområden
Informations- och kommunikationsteknik
DOI
10.1109/ASAP.2011.6043236
ISBN
978-145771292-0