Location:
Search - hicuts
Search list
Description: 流算法中的一种：Packet Classification using Hierarchical Intelligent Cuttings-Internet routers that operate as firewalls, or provide a variety
of service classes, perform different operations on different
flows. A flow is defined to be all the packets sharing common
header characteristics for example a flow may be defined as
all the packets between two specific IP addresses. In order to
classify a packet, a router consults a table (or classifier) using
one or more fields from the packet header to search for the
corresponding flow. The classifier is a list of rules that identify
each flow and the actions to be performed on each. With
the increasing demands on router performance, there is a
need for algorithms that can classify packets quickly with
minimal storage requirements and allow new flows to be frequently
added and deleted. In the worst case, packet classification
is hard requiring routers to use heuristics that exploit
structure present in the classifiers. This paper presents such a
heuristic, called HiCuts, (hierarchical intelligent cutti
Platform: |
Size: 50176 |
Author: Reguse |
Hits:
Description: 流分类中的一种算法：Packet Classification Using Multidimensional Cutting-This paper introduces a classification algorithm called HyperCuts.
Like the previously best known algorithm, HiCuts,
HyperCuts is based on a decision tree structure. Unlike
HiCuts, however, in which each node in the decision tree
represents a hyperplane, each node in the HyperCuts decision
tree represents a k− dimensional hypercube. Using this
extra degree off reedom and a new set of heuristics to find
optimal hypercubes for a given amount of storage, Hyper-
Cuts can provide an order ofma gnitude improvement over
existing classification algorithms. HyperCuts uses 2 to 10
times less memory than HiCuts optimized for memory, while
the worst case search time ofH yperCuts is 50− 500 better
than that ofH iCuts optimized for speed. Compared with
another recent scheme, EGT-PC, HyperCuts uses 1.8 − 7
times less memory space while the worst case search time is
up to 5 times smaller. More importantly, unlike EGT-PC,
HyperCuts can be fully pipelined to provide one
Platform: |
Size: 216064 |
Author: Reguse |
Hits:
Description: 计算机网络包分类算法：hicuts算法，TIE的建立，仿真-hicuts algorithm
Platform: |
Size: 6144 |
Author: dominic |
Hits: