Implementation And Performance Optimization Of Fast Routing Recursion Method

Router plays an important role on the Internet, which constitute the core of IP networks. With the explosive growth of information, performance requirements for routers are gradually improving. Route iteration is an important function in routing system, but the traditional route iteration iteration uses a timer mechanism, which generages a delay. The purpose of this project is to design and implement a new method for fast routing iterations.Based on the current development route iteration, an analysis of traditional timer iterative method is taken. Demands are therefor formulated according to the inherent deficiencies of this method. With analysis of a routing system, combined with deep study of the routing management module and iterations associated BGP and static routing protocols, a fast route iteration implementation is introduced. It is based on real-time iterations, to avoid delay treatment; Neighbors are abstracted and two-stage storage is available, which increase reuse rate of data structures. Radix tree is used to improve the efficiency of lookup for data. However, the scheme in the case of data recovery and routing flapping may exacerbate routing oscillation, for which corresponding optimization is also made.After testing, the results consistent with the design idea, recursive route can be real-time processed, the iterative efficiency has increased dramatically. The results can also be optimized to avoid the routing oscillation caused by routing iteration itself.