A B-Trees Mechanism with Congruence Classes Compress Strategy Based on Route List

摘要

In order to solve the problem of the route match delay in core router, it gives the analysis via BTree algorithm and shows that the main reason for the delay is that current route list capacity is quite finite, which causes the failure to find destination addresses. With further analysis and discussion, a compression strategy to classify IP addresses is brought forward. Through congruence classes algorithm, this strategy compresses the total number of addresses of IPV4 network number into the range of the largest routing list capacity, then uses the BTree algorithm to carry on the fast search. The feasibility of the compression process is demonstrated. Finally the emulated experiment for the route list capacity after compression is performed. It turns out that the strategy is feasible.