Power-efficient TCAM partitioning for IP lookups with incremental updates

研究成果: Conference article

6 引文 斯高帕斯(Scopus)

摘要

Ternary Content-Addressable Memories (TCAMs) provide a fast mechanism for IP lookups and a simple management for route updates. The high power consumption problem can be resolved by providing a TCAM partitioning technique that selectively addresses smaller portions of a TCAM. This paper proposes a 2-level TCAM architecture using prefix comparison rule to partition the routing table into a number of buckets of possibly equal sizes. The 2-level architecture results in a 2-step lookup process. The first step determines which bucket is used to search the input IP. The second step only searches the IP in the determined bucket from the first step. The prefix partitioning algorithm provides an incremental update. Experiments show that the proposed algorithm has lower power consumption than the existing TCAM partitioning algorithms.

原文English
頁(從 - 到)531-540
頁數10
期刊Lecture Notes in Computer Science
3391
出版狀態Published - 2005 九月 9
事件International Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
持續時間: 2005 一月 312005 二月 2

    指紋

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

引用此