【摘要】：提出一種新的偏移編碼特里樹(OET)的IP尋址算法,即采用OET表示一組IP前綴規(guī)則,以減少其存儲(chǔ)空間需求。OET的每個(gè)節(jié)點(diǎn)僅維護(hù)1個(gè)下一跳步位圖和1個(gè)偏移值,不需要孩子指針和下一跳步指針,從而提高了IP尋址性能。采用實(shí)際IP前綴規(guī)則集進(jìn)行實(shí)驗(yàn)評(píng)估,與樹位圖特里樹相比,對(duì)于實(shí)際IPv4和IPv6前綴規(guī)則集,OET在存儲(chǔ)空間開銷上分別減少60%~76%和55%~63%,是一種存儲(chǔ)高效的數(shù)據(jù)結(jié)構(gòu),整個(gè)OET可存儲(chǔ)在片上存儲(chǔ)器中,能實(shí)現(xiàn)高速的IP地址查找,滿足虛擬路由器和軟件路由器的可擴(kuò)展性要求。
[Abstract]:In this paper, a new IP addressing algorithm for offset coded tree-tree (OET) is proposed, in which a set of IP prefix rules are represented by OET to reduce the storage space requirement. Each node of OET only maintains one next step bitmap and one offset. No child pointers and next step pointers are required to improve IP addressing performance. The actual IP prefix rule set is used for experimental evaluation. Compared with the tree-bitmap tree-tree, for the actual IPv4 and IPv6 prefix rule sets, the OET reduces the storage space overhead by 6076% and 550.63%, respectively. It is a data structure with high storage efficiency. The whole OET can be stored in on-chip memory, which can realize high-speed IP address search and meet the scalability requirements of virtual routers and software routers.
【作者單位】： 廣東東軟學(xué)院計(jì)算機(jī)科學(xué)與技術(shù)系;
【基金】：國(guó)家自然科學(xué)基金(31501227)
【分類號(hào)】：TP393.07

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 鄂玲;快速更改IP來保護(hù)安全[J];網(wǎng)絡(luò)與信息;2003年04期

2 朱;IP軟件大有可為[J];中國(guó)計(jì)算機(jī)用戶;1998年21期

3 姜建;何q，

本文編號(hào)：2389552