Article

A New TCAM Architecture for Managing ACL in Routers.

IEICE Transactions 01/2010; 93-B:3004-3012. DOI:10.1587/transcom.E93.B.3004
Source: DBLP

ABSTRACT A New TCAM Architecture for Managing ACL in Routers

0 0
 · 
0 Bookmarks
 · 
113 Views
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Boolean logic minimization is being increasingly applied to new applications which demands very fast and frequent minimization services. These applications typically offer very limited computing and memory resources rendering the traditional logic minimizers ineffective. We present a new approximate logic minimization algorithm based on ternary trie. We compare its performance with Espresso-II and ROCM logic minimizers for routing table compaction and demonstrate that it is 100 to 1000 times faster and can run with a data memory as little as 16KB. It is also found that proposed approach can support up to 25000 incremental updates per seconds positioning itself as an ideal on-chip logic minimization algorithm.
    Computer Aided Design, 2004. ICCAD-2004. IEEE/ACM International Conference on; 12/2004
  • IEEE Trans. Computers. 01/2008; 57:902-915.
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Boolean logic minimization is being applied increasingly to a new variety of applications that demand very fast and frequent minimization services. These applications typically have access to very limited computing and memory resources, rendering the traditional logic minimizers ineffective. We present a new approximate logic minimization algorithm based on ternary trie. We compare its performance with Espresso-II and ROCM logic minimizers for routing table compaction and demonstrate that it is 100 to 1000 times faster and can execute with a data memory as little as 16 KB. We also found that the proposed approach can support up to 25000 incremental updates per second. We also compare its performance for compaction of the routing access control list and demonstrate that the proposed approach is highly suitable for minimizing large access control lists containing several thousand entries. Therefore, the algorithm is ideal for on-chip logic minimization.
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10/2007; · 1.22 Impact Factor

Full-text (2 Sources)

View
19 Downloads
Available from
Aug 4, 2013