Power-efficient TCAM partitioning for IP lookups with incremental updates

Research output: Contribution to journalConference article

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)531-540
Number of pages10
JournalLecture Notes in Computer Science
Volume3391
Publication statusPublished - 2005 Sep 9
EventInternational Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
Duration: 2005 Jan 312005 Feb 2

Fingerprint

Associative storage
Ternary
Partitioning
Update
Prefix
Power Consumption
Electric power utilization
Memory architecture
High Power
Table
Routing
Partition
Experiment
Experiments

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{38e0765972ff459f88fe28b2dfa1a1c9,
title = "Power-efficient TCAM partitioning for IP lookups with incremental updates",
abstract = "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.",
author = "Yeim-Kuan Chang",
year = "2005",
month = "9",
day = "9",
language = "English",
volume = "3391",
pages = "531--540",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Power-efficient TCAM partitioning for IP lookups with incremental updates. / Chang, Yeim-Kuan.

In: Lecture Notes in Computer Science, Vol. 3391, 09.09.2005, p. 531-540.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Power-efficient TCAM partitioning for IP lookups with incremental updates

AU - Chang, Yeim-Kuan

PY - 2005/9/9

Y1 - 2005/9/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=24144449886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144449886&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:24144449886

VL - 3391

SP - 531

EP - 540

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -