To detect the DoS in networks by applying association rules mining techniques, we propose that association rules and frequent itemsets can be employed to find DoS pattern in packet streams which describe traffic and u...To detect the DoS in networks by applying association rules mining techniques, we propose that association rules and frequent itemsets can be employed to find DoS pattern in packet streams which describe traffic and user behaviors. The method extracts information from the log analysis of submitted packets using the algorithm which depends on the definition of the intrusion. Large itemsets were extracted to represent the super facts to build the association analysis for the intrusion. Network data files were analysed for experiments. The analysis and experimental results are encouraging with better performance as packet frequency number increases.展开更多
Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyz...Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.展开更多
文摘To detect the DoS in networks by applying association rules mining techniques, we propose that association rules and frequent itemsets can be employed to find DoS pattern in packet streams which describe traffic and user behaviors. The method extracts information from the log analysis of submitted packets using the algorithm which depends on the definition of the intrusion. Large itemsets were extracted to represent the super facts to build the association analysis for the intrusion. Network data files were analysed for experiments. The analysis and experimental results are encouraging with better performance as packet frequency number increases.
基金Foundation item: supported by Intel Corporation (No. 9078)
文摘Packet classification (PC) has become the main method to support the quality of service and security of network application. And two-dimeusioual prefix packet classification (PPC) is the popular one. This paper analyzes the problem of ruler conflict, and then presents a TCAM-based two-dimensional PPC algorithm. This algorithm makes use of the parallelism of TCAM to lookup the longest prefix in one instruction cycle. Then it uses a memory image and associated data structures to eliminate the conflicts between rulers, and performs a fast two-dimeusional PPC. Compared with other algorithms, this algorithm has the least time complexity and less space complexity.
