Rapid storage method of routing table entry

Abstract

The invention provides a rapid storage method of a routing table entry. A 256tire tree structure is used for configuring the routing table entry, the height of the 256tire tree is four, and all the four nodes comprise 256 index table entries from 0 to 255, wherein the routing table entry directly pointed by the index table entry of the root node with the index value of 255 indicates a default route; the index table entry of the second node with the index value of 255 refers to the routing table entry which should be returned in case that the second nodes behind the matched root nodes are not matched during matching; the index table entry of the third node with the index value of 255 refers to the routing table entry which should be returned in case that the root nodes and the second nodes are matched and the third nodes are not matched during matching; and the index table entry of the fourth node with the index value of 255 refers to the routing table entry which should be returned in case that the root nodes, the second nodes and the third nodes are matched and the fourth nodes are not matched. The rapid storage method provided by the invention ensures the rapid routing searching and improves the routing searching efficiency, thereby the forwarding performance of a router is improved and the memory space is saved.

Description

【Technical field】 [0001] The invention relates to a communication technology, in particular to a method for storing routing table items, which not only makes routing lookup very fast, improves the efficiency of routing lookup, thereby improves the forwarding performance of routers, but also saves memory space. 【Background technique】 [0002] Due to the rapid development of the Internet, the increase in the number of network users, the application of multimedia networks is becoming more and more extensive, and the network traffic is showing an explosive growth trend. If the Internet wants to continue to provide better services, it is required that the core routers can forward more than several million packets per second, and the fast route lookup technology becomes the bottleneck of router packet forwarding. Therefore, how to realize the search and update of the high-speed routing table is a difficult point of research. [0003] 1. First understand a few concepts: [0004] ...

AI Technical Summary

Problems solved by technology

[0034] However, the applicant did not find a routing method using the 256Trie tree algorithm in the public literature. It is understood that some companies also use the 256Trie tree algorithm in their current routing algorithms, but they need to create a lot of nodes, which will excessively use the memory space, and the software The algorithm implementation is complex and does not support classless routing, so it is not widely used

Images