TY - JOUR
T1 - Enhanced prefix inclusion coding filter-encoding algorithm for packet classification with ternary content addressable memory
AU - Pao, D.
AU - Zhou, P.
AU - Liu, B.
AU - Zhang, X.
PY - 2007
Y1 - 2007
N2 - Filter encoding can effectively enhance the efficiency of ternary content addressable memory (TCAM)-based packet classification. It can minimise the range expansion problem, reduce the TCAM space requirement and improve the lookup rate for IPv6. However, additional complexity will incur inevitably in the filter table update operations. Although the average update cost of the prefix inclusion coding (PIC) scheme is very low, the worst-case update cost can be significantly higher. Major modifications to the PIC scheme to improve its update performance are presented. The new coding scheme is called PIC with segmented domain. By dividing the field value domain into multiple segments, the mapping of field values to code points can be more structural and help avoid massive code-point relocation in the event of new insertions. Moreover, the simplified codeword lookup for the address fields can be implemented with embedded SRAM rather than with TCAM. Consequently, the lookup rate of the search engine can be improved to handle the OC-768 line rate. © The Institution of Engineering and Technology 2007.
AB - Filter encoding can effectively enhance the efficiency of ternary content addressable memory (TCAM)-based packet classification. It can minimise the range expansion problem, reduce the TCAM space requirement and improve the lookup rate for IPv6. However, additional complexity will incur inevitably in the filter table update operations. Although the average update cost of the prefix inclusion coding (PIC) scheme is very low, the worst-case update cost can be significantly higher. Major modifications to the PIC scheme to improve its update performance are presented. The new coding scheme is called PIC with segmented domain. By dividing the field value domain into multiple segments, the mapping of field values to code points can be more structural and help avoid massive code-point relocation in the event of new insertions. Moreover, the simplified codeword lookup for the address fields can be implemented with embedded SRAM rather than with TCAM. Consequently, the lookup rate of the search engine can be improved to handle the OC-768 line rate. © The Institution of Engineering and Technology 2007.
UR - http://www.scopus.com/inward/record.url?scp=34548792290&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34548792290&origin=recordpage
U2 - 10.1049/iet-cdt:20060226
DO - 10.1049/iet-cdt:20060226
M3 - RGC 21 - Publication in refereed journal
SN - 1751-8601
VL - 1
SP - 572
EP - 580
JO - IET Computers and Digital Techniques
JF - IET Computers and Digital Techniques
IS - 5
ER -