Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
IEEE/ACM Transactions on Networking (TON)
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
IEEE Transactions on Computers
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
Hardware-based IP routing using partitioned lookup table
IEEE/ACM Transactions on Networking (TON)
V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Benchmark
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)
Fast binary and multiway prefix searches for packet forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Tree Bitmap for IP Lookup and Update
ICN '07 Proceedings of the Sixth International Conference on Networking
A longest prefix first search tree for IP lookup
Computer Networks: The International Journal of Computer and Telecommunications Networking
IP address lookup for internet routers using balanced binary search with prefix vector
IEEE Transactions on Communications
Priority Tries for IP Address Lookup
IEEE Transactions on Computers
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
A new hierarchical packet classification algorithm
Computer Networks: The International Journal of Computer and Telecommunications Networking
A high-throughput and high-capacity IPv6 routing lookup system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions. Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree. This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.