当前位置:主页 > 管理论文 > 移动网络论文 >

一种基于偏移编码特里树的高效IP寻址算法

发布时间:2018-12-22 08:17
【摘要】:提出一种新的偏移编码特里树(OET)的IP寻址算法,即采用OET表示一组IP前缀规则,以减少其存储空间需求。OET的每个节点仅维护1个下一跳步位图和1个偏移值,不需要孩子指针和下一跳步指针,从而提高了IP寻址性能。采用实际IP前缀规则集进行实验评估,与树位图特里树相比,对于实际IPv4和IPv6前缀规则集,OET在存储空间开销上分别减少60%~76%和55%~63%,是一种存储高效的数据结构,整个OET可存储在片上存储器中,能实现高速的IP地址查找,满足虚拟路由器和软件路由器的可扩展性要求。
[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.
【作者单位】: 广东东软学院计算机科学与技术系;
【基金】:国家自然科学基金(31501227)
【分类号】:TP393.07

【相似文献】

相关期刊论文 前10条

1 鄂玲;快速更改IP来保护安全[J];网络与信息;2003年04期

2 朱;IP软件大有可为[J];中国计算机用户;1998年21期

3 姜建;何q,

本文编号:2389552


资料下载
论文发表

本文链接:https://www.wllwen.com/guanlilunwen/ydhl/2389552.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户b76f0***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com