A B-Tree Algorithm for Partitioned Index Based on CIDR List in High-End Router

To solve the problem of the route match delay in CIDR lists in high-end route devices, with the analysis of several commonly used binary tree index algorithm, the balanced binary tree index algorithm based on the prefix length of Hash address is mainly analyzed. A new index B-Tree algorithm that satisfies the requirements of CIDR list is introduced. The key of the algorithm is to dividing index the CIDR list storage structure, i.e. based on the non-increasing capacity of CIDR list, Multi-tree storage structure for its optimization. Optimized storage structure is a five layers one. Since the leaf node on fifth layer only includes one or two IP addresses, the condition for fast IP address by the index algorithm is satisfied. From the simulated experiment, the new algorithm realizes the aim of fast IP address search.