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 本文首先對現(xiàn)有的各種報文分類算法進(jìn)行了系統(tǒng)、詳細(xì)的研究,并對各種算法的查找性能和存儲空間需求進(jìn)行了分析比較,分析總結(jié)出當(dāng)前報文分類領(lǐng)域面臨的三個問題。
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概念的基礎(chǔ)上介紹了元空間算法的原理和算法流程,該算法是目前適應(yīng)于大規(guī)模規(guī)則庫且支持快速更新的多域報文分類算法。
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協(xié)議驅(qū)動程序?qū)崿F(xiàn)報文捕獲、以對bpf過濾器改進(jìn)和增強后的kpf為報文過濾器,以增加了規(guī)則更新能力的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下的報文分類算法,本文引入了規(guī)則子集的概念,并利用該概念使多維報文分類可以利用現(xiàn)有的一維快速ip路由查找算法,提出了可適用于ipv6的分域查找算法,該算法在最壞情況下只需要7次訪存。