A Fast IP Lookup Scheme for Longest-Matching Prefix
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A Fast and Updatable IP Address Lookup Scheme
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A Scalable and Small Forwarding Table for Fast IP Address Lookups
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Simultaneous Multithreading-Based Routers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
Aligned prefix caching based on singleton information
Computer Networks and ISDN Systems
A longest prefix first search tree for IP lookup
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updatable Address Set
IEEE Transactions on Computers
High-speed IP address lookup using balanced multi-way trees
Computer Communications
Aligned prefix caching based on singleton information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Flashlook: 100-Gbps hash-tuned route lookup architecture
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
A heuristic and hybrid hash-based approach to fast lookup
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
A distributed architecture of the indirect IP lookup scheme for high-speed routers
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
IC design of IPv6 routing lookup for high speed networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Hardware-based IP lookup using n-way set associative memory and LPM comparator
SAMOS'06 Proceedings of the 6th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
A fast string search algorithm for deep packet classification
Computer Communications
FlashTrie: beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.08 |
One of the pertinent design issues for new generation IP routers is the route-lookup mechanism. For each incoming IP packet, the IP routing is required to perform a longest-prefix matching on the route lookup in order to determine the packet's next hop. This study presents a fast unicast route-lookup mechanism that only needs tiny SRAM and can be implemented using a hardware pipeline. The forwarding table, based on the proposed scheme, is small enough to fit into a faster SRAM with low cost. For example, a large routing table with 40000 routing entries can be compacted into a forwarding table of 450-470 kbytes costing less than US$30. Most route lookups need only one memory access; no lookup needs more than three memory accesses. When implemented using a hardware pipeline, the proposed mechanism can achieve one routing lookup every memory access. With current 10-ns SRAMs, this mechanism furnishes approximately 100×106 routing lookups/s, which is much faster than any current commercially available routing-lookup scheme