Fast routing table lookup using CAMs

McAuley, A.; Francis, Paul

doi:10.1109/infcom.1993.253403

Cited by 241 publications

(89 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some papers have proposed compression methods for solving this problem [8]- [13].Compression methods usually suffer from update overhead. Besides methods that work based on trie, other methods are also proposed that some of them use hash tables [14] while some others use CAMs (Content Addressable Memories) or TCAMs (Tertiary CAMs) for solving the LPM problem [15][16][17]. Some of these methods are not fast enough and some others consume lots of memory and those ones which have good speed and memory consumption suffer from heavy update overhead.…”

Section: E Related Workmentioning

confidence: 99%

Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup

Tahir¹,

Ahmed²

2015

ijacsa

View full text Add to dashboard Cite

Abstract-For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new dynamic data structure for fast IP address lookup. This novel data structure is a dynamic mixture of trees and tries which is called TreeCombined Trie or simply TC-Trie. Binary sorted trees are more advantageous than tries for representing a sparse population while multibit tries have better performance than trees when a population is dense. TC-trie combines advantages of binary sorted trees and multibit tries to achieve maximum compression of the forwarding information. Dynamic reconfiguration of TCtrie, made it capable of customizing itself along the time and scaling to support more prefixes or longer IPv6 prefixes. TC-trie provides a smooth transition from current large IPv4 databases to the large IPv6 databases of the future Internet.

show abstract

Section: E Related Workmentioning

confidence: 99%

Tree-Combined Trie: A Compressed Data Structure for Fast IP Address Lookup

Tahir¹,

Ahmed²

2015

ijacsa

View full text Add to dashboard Cite

show abstract

“…Nowadays, more hardware architects than ever look into CAM for high performance table lookup tasks [4] [5] [6]. A specifically interesting type of CAM, called Ternary CAM (TCAM) can store don't-care values in addition to 0's and 1's.…”

Section: A Prior Workmentioning

confidence: 99%

“…Analytically, the overall search time of RCAM architecture is given by: t rcam search 2t rcam block + t encoder (5) where, t rcam block is the delay of the RCAM block (n × w cells) and t encoder is the delay of a regular n-input encoder logic. The analytical expression for the overall search time of a conventional TCAM architecture is given by: t tcam search t tcam block + t priority encoder (6) where, t tcam block is the delay of the TCAM block (n × w cells) and t priority encoder is the delay of a n-input priority encoder logic.…”

Section: A Search Timementioning

confidence: 99%

A Reconfigurable CAM Architecture for Network Search Engines

Nourani

Vijayasarathi

Balsara

2006

2006 International Conference on Computer Design

View full text Add to dashboard Cite

“…These LUE essentially consists of Content Addressable Memories (CAM) which are well known and commonly used in routing and switching applications. One of the early work in this area is [8].…”

Section: Control Memory Access Acceleratormentioning

confidence: 99%