Hardware-based IP routing using partitioned lookup table

Authors:
Mohammad J. Akhbarizadeh;Mehrdad Nourani
Affiliations:
Center for Integrated Circuits and Systems, The University of Texas at Dallas, Richardson, TX;Center for Integrated Circuits and Systems, The University of Texas at Dallas, Richardson, TX
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2005

Citing 15
Cited 4

Algorithms and data structures in computer engineering

Algorithms and data structures in computer engineering
Routing on longest-matching prefixes

IEEE/ACM Transactions on Networking (TON)
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
Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Content-addressable memory core cells: a survey

Integration, the VLSI Journal
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)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Communication Networks: Fundamental Concepts and Key Architectures

Communication Networks: Fundamental Concepts and Key Architectures
Fast Updating Algorithms for TCAMs

IEEE Micro
Routing Table Compaction in Ternary CAM

IEEE Micro
Algorithms for routing lookups and packet classification

Algorithms for routing lookups and packet classification
On fast address-lookup algorithms

IEEE Journal on Selected Areas in Communications
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 fast IP routing lookup architecture for multi-gigabit switching routers based on reconfigurable systems

Microprocessors & Microsystems
A proposed IP multicast hardware-routing algorithm using partitioned lookup table

TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Compress the route table stored in TCAM by using memory filter

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a search algorithm implementable by a parallel architecture based on partitioned forwarding table. This scheme effectively reduces the complexity of finding "the longest prefix match" problem to "a prefix match" problem. The main feature of this algorithm is twofold. First, it advocates intelligent partitioning of the forwarding table to enhance and parallelize the lookup operation. Second, it takes advantage of ternary CAM to achieve low lookup time. The resulting architecture has better throughput and much better update time than the traditional TCAM. Our experimental results show that such features can significantly elevate the flexibility and scalability of the next generation packet processing devices.