Hierarchical trie packet classification algorithm based on expectation-maximization clustering.
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 classifi...
Main Authors: | Xia-An Bi, Junxia Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2017-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5509293?pdf=render |
Similar Items
-
ITOC: An Improved Trie-Based Algorithm for Online Packet Classification
by: Yifei Li, et al.
Published: (2021-09-01) -
PT-SPF : A high performance Patricia Trie based Stateful Packet FilterStatefule Packet FilterPT-SPF : A high performance Patricia Trie based Stateful Packet Filter
by: Chien-Yuan Chen, et al.
Published: (2005) -
PT-SPF : A high performance Patricia Trie based Stateful Packet Filter Statefule Packet Filter PT-SPF : A high performance Patricia Trie based Stateful Packet Filter
by: Chien-Yuan Chen, et al. -
PT-SPF : A high Performance Patricia Trie Based Stateful Packet Filter
by: 陳建源
Published: (2005) -
Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie
by: Junghwan Kim, et al.
Published: (2020-02-01)