.png){kind=icon}
.png){kind=icon}
Return
Packet Classification Using Dynamically Generated Decision Trees
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2013.227.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Binary search on levels (BSOL) is a decision-tree algorithm for packet classification with superior speed performance. However, the most decision-tree-based algorithms, like BSOL, may suffer from a memory explosion problem caused by filter replications. In this work, we improve the storage performance of BSOL by employing a scheme, replication control. Our scheme dynamically generates multiple decision trees to eliminate filter replications in BSOL. The experimental results show that the new scheme achieves better performance than the existing decision-tree-based algorithms.
Keywords:
Packet classification
firewalls
QoS
packet forwarding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K