Hierarchical trie packet classification algorithm based on expectation-maximization clustering.

ABSTRACT: With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets

SUBMITTER: Bi XA 

PROVIDER: S-EPMC5509293 | biostudies-literature | 2017

REPOSITORIES: biostudies-literature