Chisel
Published in ACM SIGARCH Computer Architecture News • May 1, 2006
NobleIDNI6P02W63R62S31
Authors:,,
Jahangir Hasan
Srihari Cadambi
Venkatta Jakkula
Abstract
Longest Prefix Matching (LPM) is a fundamental part of various network processing tasks. Previously proposed approaches for LPM result in prohibitive cost and power dissipation (TCAMs) or in large memory requirements and long lookup latencies (tries), when considering future line-rates, table sizes ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!