2002 · 91 citations · 11 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksDigital CommunicationContent-addressable StorageInternet RoutingRoutingRouting ArchitectureContent Addressable NetworksContent-addressable MemoryContent-addressable Memory (Cam)Longest Prefix MatchingLongest-match RuleNetwork PrefixesPacket ProcessingSearch Architecture
We propose an IP forwarding table search engine architecture, VLMP (vertical logical operation with mask-encoded 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 OC-192 (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.
11
Scalable high speed IP routing lookups
Marcel Waldvogel, George Varghese, Jon Turner et al. · 1997 · 663 citations · Full text
Small forwarding tables for fast routing lookups
Mikael Degermark, Andrej Brodnik, Svante Carlsson et al. · 1997 · 591 citations · Full text
Routing lookups in hardware at memory access speeds
Pravir Singh Gupta, Steven Lin, Nick McKeown · 2002 · 487 citations