一种采用按值分支树的多维流分类算法

Download: PDF (664 KB)
Export: BibTeX | EndNote (RIS)

Abstract In order to solve problems of modular algorithm, a multi-dimensional packet classification algorithm that uses trees divided by value is presented in this paper. It supports increment of rule’s dimension and scale. Moreover, it can deal with prefix match and range match. The simulation result shows that the algorithm is scalable and practical for large-scale rules.

Key words： Trees divided by value Multi-dimensional packet classification Range match Prefix match

Received: 19 April 2003

PACS:

TN919.2

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors



	Yao Xing-miao
	Hu Guang-min
	Li Le-min

Cite this article:

Yao Xing-miao,Hu Guang-min,Li Le-min. A Multi-dimensional Packet Classification Algorithm with Trees Divided by Value[J]. , 2004, 26(9): 1413-1419 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2004/V26/I9/1413

[1]	DAI Zibin, LIU Hangtian. Efficient Range Matching Method Based on Bloom Filter and Ternary Content Addressable Memory[J]. JEIT, 2016, 38(8): 1872-1879.