报文分类算法 meaning in Chinese
message digest algorithm (md5)
Examples
- A tcam - based two - dimensional prefix packet classification algorithm
的二维前缀报文分类算法 - In this paper , we first do a systemic , detail research on all classical packet classification algorithms and analysis the time and space request of all algorithms , then forward three questions of the packet classification
本文首先对现有的各种报文分类算法进行了系统、详细的研究，并对各种算法的查找性能和存储空间需求进行了分析比较，分析总结出当前报文分类领域面临的三个问题。 - This paper discuss the map process using the class equivalent class deeply and program to implement the three phases process . secondly , we introduce the principle and flow of the tuple space search base on the detail explaining of tuple space
接着本文在深入阐述tuplespace概念的基础上介绍了元空间算法的原理和算法流程，该算法是目前适应于大规模规则库且支持快速更新的多域报文分类算法。 - This solutions includes adopting the ndis protocol driver as packet capture module , the kpf filter as packet filter which came from the revising and improving of the bpf filter , hypercuts with rule updating ability as packet classification algorithm .
该方案包括以ndis协议驱动程序实现报文捕获、以对bpf过滤器改进和增强后的kpf为报文过滤器,以增加了规则更新能力的hypercuts算法为报文分类算法。 - Finally , we introduce the concept of the rule subset and the multiple fields packet classification algorithms can make use of the fast ip routing search algorithms base on the new concept . so we put forward the field - divided classification algorithms in the ipv6 circumstance and the new algorithms need seven times to access memory in the worse case
最后考虑ipv6下的报文分类算法，本文引入了规则子集的概念，并利用该概念使多维报文分类可以利用现有的一维快速ip路由查找算法，提出了可适用于ipv6的分域查找算法，该算法在最坏情况下只需要7次访存。