Method and equipment for processing routing table item

Abstract

The invention discloses a method and equipment for processing a routing table item. The method comprises the following steps: increasing the boundary information bit of the original boundary value of the table item so as to generate a boundary information value, wherein the original boundary value is obtained according to the internet protocol (IP) address of the routing table item; setting the mask code of the routing table item to the boundary information bit of the original boundary value so as to generate an expansion boundary value; and storing the expansion boundary value to a binary tree. In the embodiment of the invention, the IP address and mask code of the routing table item corresponding to the expansion boundary value are obtained according to the expansion boundary value stored in a binary tree, and the inclusion relations among the routing table items are obtained according to the IP address and mask code of the routing table item corresponding to the expansion boundary value and are recorded without using a ternary tree, thereby saving memory resources; and seeking and balancing operations aiming at the ternary tree do not need to be carried out, and only the seeking aiming at the binary tree is carried out, thereby improving the refresh performance on the routing table item.

Description

technical field [0001] The embodiments of the present invention relate to the field of communication technologies, and in particular, to a method and device for processing routing entries. Background technique [0002] At present, routers have an increasing need for large-capacity routing, and for large-capacity routing, range matching algorithms are usually used to store and search routing table entries. [0003] The basic idea of ​​the range matching algorithm is: convert the routing table entries in the routing table into upper boundary values ​​and lower boundary values, use binary tree to sort and store the upper boundary values ​​and lower boundary values ​​of all routing table entries, and use ternary tree Record the containment relationship between routing table entries. When a routing table item needs to be found from the routing table, a binary tree and a ternary tree need to be searched to obtain the routing table item. When the number of routing table items is ...

AI Technical Summary

Problems solved by technology

When the number of routing table items is large, using a ternary tree to record the inclusion relationship between table items will occupy a large amount of memory, resulting in a waste of memory resources; and when the number of routing table items is large, there will be many layers of the ternary tree. Both lookup and balance operations on the ternary tree will take a long time, which reduces the performance of refreshing routing table entries

Images