前缀
计算机科学
特里亚
布线(电子设计自动化)
并行计算
路由表
IPv6
算法
树(集合论)
压缩(物理)
数据结构
数学
路由协议
计算机网络
操作系统
复合材料
哲学
数学分析
互联网
语言学
材料科学
作者
Yan Pan,Zhonghe Wei,Jianxiu Zhao,Min Guo
标识
DOI:10.1109/icinfa.2017.8079078
摘要
The balance of searching time and storage space is a problem in routing lookup. The algorithm has solved it to some extent. It is based on IPv6 prefix distribution and adopts different approaches to divide and compress different prefixes. The prefixes that can be divided exactly are concentrated compression. Other prefixes that can't be divided exactly are handled with multi-branch tree method. According to the experiment, this method not only improves the efficiency of routing lookup by parallel computing, but also reduces the space and the frequency of accessing RAM. And it reduces the difficulty of software design and the pressure of hardware.
科研通智能强力驱动
Strongly Powered by AbleSci AI