东华大学学报（英文版）2004，Vol.21Issue(1)：39-45,7.
A TCAM-based Two-dimensional Prefix Packet Classification Algorithm
A TCAM-based Two-dimensional Prefix Packet Classification Algorithm
摘要
Abstract
Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimensional prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAMbased two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimensional PPC.Compared with other algorithms, this algorithm has the least time complexity and less space complexity.关键词
Ternary Content Addressable Memory( TCAM )/packet classification algorithm/two -dimensional pre fix packet classificationKey words
Ternary Content Addressable Memory( TCAM )/packet classification algorithm/two -dimensional pre fix packet classification分类
信息技术与安全科学引用本文复制引用
王志恒,刘刚,白英彩..A TCAM-based Two-dimensional Prefix Packet Classification Algorithm[J].东华大学学报（英文版）,2004,21(1):39-45,7.基金项目
supported by Intel(R) Corporation (No. 9078) （R）
