Proceedings ArticleDOI
A longest prefix match search engine for multi-gigabit IP processing
Masayoshi Kobayashi,Tutomu Murase,Atsushi Kuriyama +2 more
- Vol. 3, pp 1360-1364
TLDR
An IP forwarding table search engine architecture, VLMP (vertical logical operation with mask-encoded prefix-length), for routers with multi-gigabit/sec speed links is proposed and a newly developed search LSI in which the architecture is implemented.Abstract:
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.read more
Citations
More filters
Patent
Method and apparatus for the assessment and optimization of network traffic
Michael A. Lloyd,Omar C. Baldonado,Sean P. Finn,Mansour J. Karam,James G. McGuire,Herbert S. Madan +5 more
TL;DR: A system for the assessment of network performance criteria and applying this criteria to the classification of network addresses into appropriate ranges, using these ranges to consolidate performance measurements for the associated addresses, and applying these metrics toward the optimization of the network towards performance or policy objectives is described in this paper.
Proceedings ArticleDOI
Coolcams: power-efficient TCAMs for forwarding engines
F. Zane,Girija Narlikar,A. Basu +2 more
TL;DR: The proposed architectures and algorithms for making TCAM-based routing tables more power efficient are simple to implement, use commodity TCAMs, and provide worst-case power consumption guarantees (independent of routing table contents).
Journal ArticleDOI
A ternary content-addressable memory (TCAM) based on 4T static storage and including a current-race sensing scheme
TL;DR: The proposed match-line (ML) sense scheme reduces power consumption by minimizing switching activity of search-lines and limiting voltage swing of MLs and operates at a minimum supply voltage of 1.2 V.
Journal ArticleDOI
Fast updating algorithms for TCAM
Devavrat Shah,Poonam Gupta +1 more
TL;DR: This paper proposes two algorithms to manage the ternary content-addressable memory such that incremental update times remain small in the worst case.
Journal ArticleDOI
A mismatch-dependent power allocation technique for match-line sensing in content-addressable memories
Igor Arsovski,Ali Sheikholeslami +1 more
TL;DR: A match-line (ML) sensing scheme that allocates less power to match decisions involving a larger number of mismatched bits, which results in a significant CAM power reduction.
References
More filters
Proceedings ArticleDOI
Scalable high speed IP routing lookups
TL;DR: This paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths that scales very well as address and routing table sizes increase and introduces Mutating Binary Search and other optimizations that considerably reduce the average number of hashes to less than 2.
Proceedings ArticleDOI
Small forwarding tables for fast routing lookups
TL;DR: A forwarding table data structure designed for quick routing lookups, small enough to fit in the cache of a conventional general purpose processor and feasible to do a full routing lookup for each IP packet at gigabit speeds without special hardware.
Proceedings ArticleDOI
Routing lookups in hardware at memory access speeds
Pankaj Gupta,S. Lin,Nick McKeown +2 more
TL;DR: This work presents a route lookup mechanism that when implemented in a pipelined fashion in hardware, can achieve one route lookup every memory access; much faster than current commercially available routing lookup schemes.
Journal ArticleDOI
Internet routing instability
TL;DR: The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period, and reveals several unexpected trends and ill-behaved systematic properties in Internet routing.
Journal ArticleDOI
Fast address lookups using controlled prefix expansion
V. Srinivasan,George Varghese +1 more
TL;DR: The main technique, controlled prefix expansion, transforms a set of prefixes into an equivalent set with fewer prefix lengths, and optimization techniques based on dynamic programming, and local transformations of data structures to improve cache behavior are used.