Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable packet classification
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Space Decomposition Techniques for Fast Layer-4 Switching
PfHSN '99 Proceedings of the IFIP TC6 WG6.1 & WG6.4 / IEEE ComSoc TC on on Gigabit Networking Sixth International Workshop on Protocols for High Speed Networks VI
Packet classification using multidimensional cutting
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
OC-3072 Packet Classification Using BDDs and Pipelined SRAMs
HOTI '01 Proceedings of the The Ninth Symposium on High Performance Interconnects
Algorithms for routing lookups and packet classification
Algorithms for routing lookups and packet classification
Packet Classification Using Extended TCAMs
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
HSM: A Fast Packet Classification Algorithm
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Algorithms for advanced packet classification with ternary CAMs
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
ClassBench: a packet classification benchmark
IEEE/ACM Transactions on Networking (TON)
Scalable packet classification using interpreting: a cross-platform multi-core solution
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
On using B+-tree for efficient processing for the boundary neighborhood problem
WSEAS TRANSACTIONS on SYSTEMS
Using policy-based MPLS management architecture to improve QoS on IP network
WSEAS Transactions on Computers
Traffic classification using en-semble learning and co-training
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
| Hi-index | 0.00 |
If we analyze real life filter sets (classifiers) and also packet classification requirements, it seems that distribution of rule scope is non-uniform and in some sub spaces is denser inside the total space of classifiers. These features guided us to add "cut point heuristic" to HiCuts, one of the most efficient algorithms and resulted in two new optimized designs for HiCuts, named B-HiCuts and Hist. Also one of the hardware based and fast solution for classification is use of TCAM memory to implement classifiers, but TCAMs are expensive and are not efficient for range fields. The third approach in this paper introduces a hybrid scheme to do a part of search on prefix fields in TCAM and then to check other fields, the search process will be traversed to RAM section in the second level. Synthetic classifiers are made by ClassBench and used to simulate and evaluate performance of proposed designs. The most specifications of proposed methods are balancing of decision trees and reducing the consumed memory for B-HiCuts and Hist and also solving range to prefix conversion and multi match classification problems in the last proposed design.