高性能无冲突分组查找分类算法的研究  

Research on a High Capacity Non-conflict Grouping Package Classification Algorithm

作　　者：罗金玲[1] 刘罗仁[1] 

机构地区：[1]娄底职业技术学院

出　　处：《微计算机信息》2007年第18期230-232,共3页Control & Automation

基　　金：湖南省教育科研资金资助(05D060)

摘　　要：随着因特网的迅猛发展,信息安全、网络安全已经成为人们日益关注的焦点。本文提出了一种面向网络服务监控网关的基于用户的无冲突分组的报文分类算法。该算法是一种基于无冲突哈希和分组查找的多维查找算法,是在无冲突散列查找算法、Lakshman和Stiliadis提出的二维分类算法和iptables分类架构的基础上提出的,但该算法的平均空间性能和时间性能均优于无冲突散列查找算法和iptables分类算法。Along with Internet＇ s swirl and violent development, the information security, the network security, already became the focus which the people paid attention day by day. This article proposed one kind of users＂ non-conflict grouping package classification algorithm and the traffic limit algorithm which face the gateway of network service surveillance. It＇s a multi-finding algorithm based on non-conflict hash, classification, non-conflict, and Lakshman, Stiliadis and iptables classification structure. Also the characteristic of average space and time is better than the non-conflict hash classification algorithm and iptables classification algorithm.

关 键 词：报文分类 无冲突哈希 分组查找 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]