為了克服傳統(tǒng)的軟件路由查找機(jī)制的瓶頸, 高速路由器目前的查表方案是基于TCAM 的硬件路由查找。由于路由查找的最長(zhǎng)前綴匹配要求,TCAM 要解決路由表項(xiàng)的高效存儲(chǔ)和管理問(wèn)題。本文討論了目前的基于TCAM 的表項(xiàng)管理算法,對(duì)當(dāng)前研究的新進(jìn)展進(jìn)行了重點(diǎn)分析和比較,為進(jìn)一步的研究提出了新的思路。在863 重大課題“可擴(kuò)展到T 比特的高性能IPv4/v6 路由器基礎(chǔ)平臺(tái)及實(shí)驗(yàn)系統(tǒng)”中,得到很好的應(yīng)用。
關(guān)鍵詞：最長(zhǎng)前綴匹配，表項(xiàng)更新，前綴覆蓋

Algorithm Research of Managing TCAM Routing Entries Zhao Zhengrong , Li Peng , Lan Julong ( NDSC,Information Engineering University,Zhengzhou 450002,Henan ) [Abstract] Faced the bottleneck of traditional software mechanism of routing lookups,high_speed routers take the measure of hardware methods based on TCAM presently.But the request of longest_prefix matching brings out the question of efficient storage and updating.In this paper,we discuss the present updating algorithms based on TCAM,and emphasize the analysis and comparison of the emerging progress of the current research for the new direction.
[Keywords] longest_prefix match ,entries updating , prefixs_overlap