| A TCAM-based Two-dimensional Prefix Packet Classification Algorithm |
| |
| 引用本文： | 王志恒,刘刚,白英彩. A TCAM-based Two-dimensional Prefix Packet Classification Algorithm[J]. 东华大学学报(英文版), 2004, 21(1) |
| |
| 作者姓名： | 王志恒 刘刚 白英彩 |
| |
| 作者单位： | Department of Computer Science & Engineering，Shanghai Jiaotong University，Shanghai，200030，Department of Computer Science & Engineering，Donghua University，Shanghai，200051，Department of Computer Science & Engineering，Shanghai Jiaotong University，Shanghai，200030 |
| |
| 基金项目： | Foundation item: supported by Intel Corporation (No. 9078) |
| |
| 摘 要： | Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based 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-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.
|
A TCAM-based Two-dimensional Prefix Packet Classification Algorithm |
| |
| WANG Zhi-heng,LIU Gang BAI Ying-cai. A TCAM-based Two-dimensional Prefix Packet Classification Algorithm[J]. Journal of Donghua University, 2004, 21(1) |
| |
| Authors: | WANG Zhi-heng LIU Gang BAI Ying-cai |
| |
| Affiliation: | 1. Department of Computer Science & Engineering, Shanghai Jiaotong University, Shanghai, 200030
2. Department of Computer Science & Engineering, Donghua University, Shanghai, 200051 |
| |
| Abstract: | Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based 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-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity. |
| |
| Keywords: | Ternary Content Addressable Memory (TCAM ) packet classification algorithm twodimensional prefix packet classification |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
