Abstract
Network search engines based on ternary CAMs (content addressable memories) are widely used in routers. However, due to the parallel search nature of TCAMs, power consumption becomes a critical issue. We propose an architecture that partitions the lookup table into multiple TCAM chips, based on the individual TCAM cell status, and achieves lower power figures
Translated title of the contribution | A low-power network search engine based on statistical partitioning |
---|---|
Original language | English |
Title of host publication | IEEE Workshop on High Performance Switching and Routing, Phoenix AZ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 264 - 268 |
Number of pages | 5 |
ISBN (Print) | 0780383753 |
DOIs | |
Publication status | Published - 2004 |
Event | IEEE Workshop on High Performance Switching and Routing - Duration: 1 Apr 2004 → … |
Conference
Conference | IEEE Workshop on High Performance Switching and Routing |
---|---|
Period | 1/04/04 → … |
Bibliographical note
Conference Proceedings/Title of Journal: IEEE Workshop on High Performance Switching and RoutingConference Organiser: IEEE
Rose publication type: Conference contribution
Terms of use: Copyright © 2004 IEEE. Reprinted from IEEE Workshop on High Performance Switching and Routing, 2004 (HPSR04).
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.