A Longest Prefix Match Search Engine For Multi-Gigabit IP Processing
نویسندگان
چکیده
We propose an IP forwarding table search engine architecture, VLMP (Vertical Logical operation with Maskencoded Prefix-length), for routers with multi-gigabit/sec speed links. We discuss the existing approaches and the requirements for search engines, and go on to propose VLMP search engine architecture that expands upon a Content Addressable Memory (CAM) and can perform wire-speed packet processing of an OC192 (9.6 Gb/s) link. In this architecture, prefixes can be stored in arbitrary order, while existing ternary CAMs require prefixes to be stored in the order of their lengths. Also presented is a newly developed search LSI in which the architecture is implemented.
منابع مشابه
Power-Saving Hybrid CAMs for Parallel IP lookups
IP lookup with the longest prefix match is a core function of Internet routers. Partitioned Ternary Content Addressable Memory (TCAM)-based search engines have been widely used for parallel lookups despite power inefficiency. In this paper, to achieve a higher throughput and power-efficient IP lookup, we introduce hybrid CAM (HCAM) architecture with SRAM. In our approach, we break a prefix into...
متن کاملIP-Address Lookup Using Hardware Pipelining
Fast IP address lookup mechanism is a major design issue for the next generation routers. The existing scheme performs the IP address lookup by hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this article, we claim that with a little extra memory, it is able to further reduce the lookup time...
متن کاملAn IP packet forwarding technique based on partitioned lookup table
In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of finding “the longest prefix match” problem to “the first prefix match” problem.
متن کاملRouting Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets per second per port. Using the “rule-of-thumb” that it takes roughly 1000 packets per second for every 106 bits per second of line rate, an OC-192 line requires routing lookups per second; well above current router capab...
متن کامل10B-1 Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets per second per port. Using the “rule-of-thumb” that it takes roughly 1000 packets per second for every 106 bits per second of line rate, an OC-192 line requires routing lookups per second; well above current router capab...
متن کامل