An IPv6 routing lookup algorithm based on subsection intensive compression and multi-branch tree

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 com...

Full description

Saved in:
Bibliographic Details
Published in2017 IEEE International Conference on Information and Automation (ICIA) pp. 1168 - 1172
Main Authors Yan Pan, Zhonghe Wei, Jianxiu Zhao, Min Guo
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2017
Subjects
Algorithm design and analysis
Hardware
Internet
IP networks
IPv6
multi-branch tree
Random access memory
Routing
routing lookup
Software algorithms
Subsection intensive compression
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/ICInfA.2017.8079078