A rule grouping technique for weight-based TCAM coprocessors [packet classification application]

Hao Che; Yong Wang; Zhijun Wang

doi:10.1109/CONECT.2003.1231474

A rule grouping technique for weight-based TCAM coprocessors [packet classification application]

Hao Che, Yong Wang, Zhijun Wang

Genetics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Scopus citations

Abstract

A crucial issue associated with a TCAM (ternary content addressable memory) coprocessor with weights is that no more rules can be enforced if the weights are exhausted. In this paper, the problem is identified and a rule grouping technique is proposed to solve the problem. The technique allows a virtually unlimited number of rules with arbitrary rule structures to be enforced. It requires no special hardware support and can be readily implemented in a fully programmable network processor and a weight-based TCAM coprocessor.

Original language	English (US)
Title of host publication	Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	32-37
Number of pages	6
ISBN (Electronic)	076952012X, 9780769520124
DOIs	https://doi.org/10.1109/CONECT.2003.1231474
State	Published - 2003
Event	11th Symposium on High Performance Interconnects, HOTI 2003 - Stanford, United States Duration: Aug 20 2003 → Aug 22 2003

Publication series

Name	Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003

Conference

Conference	11th Symposium on High Performance Interconnects, HOTI 2003
Country/Territory	United States
City	Stanford
Period	8/20/03 → 8/22/03

Keywords

Associative memory
Clocks
Computer science
Coprocessors
Hardware
Yarn

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture

Access to Document

10.1109/CONECT.2003.1231474

Cite this

Che, H., Wang, Y., & Wang, Z. (2003). A rule grouping technique for weight-based TCAM coprocessors [packet classification application]. In Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003 (pp. 32-37). [1231474] (Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CONECT.2003.1231474

A rule grouping technique for weight-based TCAM coprocessors [packet classification application]. / Che, Hao; Wang, Yong; Wang, Zhijun.

Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 32-37 1231474 (Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Che, H, Wang, Y & Wang, Z 2003, A rule grouping technique for weight-based TCAM coprocessors [packet classification application]. in Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003., 1231474, Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003, Institute of Electrical and Electronics Engineers Inc., pp. 32-37, 11th Symposium on High Performance Interconnects, HOTI 2003, Stanford, United States, 8/20/03. https://doi.org/10.1109/CONECT.2003.1231474

Che H, Wang Y, Wang Z. A rule grouping technique for weight-based TCAM coprocessors [packet classification application]. In Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 32-37. 1231474. (Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003). doi: 10.1109/CONECT.2003.1231474

@inproceedings{f6db83b04a9c480c9a5ce3408ff8f3b1,

title = "A rule grouping technique for weight-based TCAM coprocessors [packet classification application]",

abstract = "A crucial issue associated with a TCAM (ternary content addressable memory) coprocessor with weights is that no more rules can be enforced if the weights are exhausted. In this paper, the problem is identified and a rule grouping technique is proposed to solve the problem. The technique allows a virtually unlimited number of rules with arbitrary rule structures to be enforced. It requires no special hardware support and can be readily implemented in a fully programmable network processor and a weight-based TCAM coprocessor.",

keywords = "Associative memory, Clocks, Computer science, Coprocessors, Hardware, Yarn",

author = "Hao Che and Yong Wang and Zhijun Wang",

note = "Publisher Copyright: {\textcopyright} 2003 IEEE. Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; 11th Symposium on High Performance Interconnects, HOTI 2003 ; Conference date: 20-08-2003 Through 22-08-2003",

year = "2003",

doi = "10.1109/CONECT.2003.1231474",

language = "English (US)",

series = "Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "32--37",

booktitle = "Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003",

}

TY - GEN

T1 - A rule grouping technique for weight-based TCAM coprocessors [packet classification application]

AU - Che, Hao

AU - Wang, Yong

AU - Wang, Zhijun

PY - 2003

Y1 - 2003

N2 - A crucial issue associated with a TCAM (ternary content addressable memory) coprocessor with weights is that no more rules can be enforced if the weights are exhausted. In this paper, the problem is identified and a rule grouping technique is proposed to solve the problem. The technique allows a virtually unlimited number of rules with arbitrary rule structures to be enforced. It requires no special hardware support and can be readily implemented in a fully programmable network processor and a weight-based TCAM coprocessor.

AB - A crucial issue associated with a TCAM (ternary content addressable memory) coprocessor with weights is that no more rules can be enforced if the weights are exhausted. In this paper, the problem is identified and a rule grouping technique is proposed to solve the problem. The technique allows a virtually unlimited number of rules with arbitrary rule structures to be enforced. It requires no special hardware support and can be readily implemented in a fully programmable network processor and a weight-based TCAM coprocessor.

KW - Associative memory

KW - Clocks

KW - Computer science

KW - Coprocessors

KW - Hardware

KW - Yarn

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

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

U2 - 10.1109/CONECT.2003.1231474

DO - 10.1109/CONECT.2003.1231474

M3 - Conference contribution

AN - SCOPUS:42149111533

T3 - Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003

SP - 32

EP - 37

BT - Proceedings - 11th Symposium on High Performance Interconnects, HOTI 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 11th Symposium on High Performance Interconnects, HOTI 2003

Y2 - 20 August 2003 through 22 August 2003

ER -

A rule grouping technique for weight-based TCAM coprocessors [packet classification application]

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this