Method for storing routing hop and next skip list by routing hop

Abstract

The method comprises: appointing a second-level index for each next jump table; appointing a first-level index for each next jump maintain table corresponding to each prefix; determining a second-level index of the next jump table maintained in the next jump maintain table corresponding to each prefix; according to said prefix, the first index of the next maintain table corresponding to said prefix, the next jump table that is appointed by the first level index of the next jump index and records the second-level index of each next jump table in jump table group corresponding to said prefix, and the routing saved in a corresponding next jump table pointed by the second level index of the next jump table in each next jump maintain table, the next table is forwarded.

Description

technical field [0001] The invention relates to routing forwarding technology, more specifically, the invention relates to a routing forwarding and a method for storing the next hop table of routing forwarding. Background technique [0002] Data communication often involves routing and forwarding issues. Usually, the control plane of a data communication device (such as a router) is responsible for functions such as routing information collection, routing calculation, device management, and network management agent. The data plane (also called service plane, forwarding plane) of a data communication device (such as a router) is responsible for receiving, routing, sending, and special business processing of actual network traffic. [0003] When performing routing forwarding, the control plane is responsible for collecting routing information from other devices through protocol packets to form an optimal path information library (similar to a world map), and then form these op...

AI Technical Summary

Problems solved by technology

For a router, there are usually dozens of next hops, and at most no more than 100 or 200, but for prefixes, the current backbone routers can reach more than 200,000, which will cause the same one. The content of the next hop table may have to be copied tens of thousands of times in the FIB table

[0010] 2. Slow update

However, this method still has the following disadvantages: for different next-hop groups, although the same next-hop exists, multiple copies will be reserved in different next-hop groups, that is, different next-hop groups store one copy, and there is no real Only one copy of the public next hop is stored, and the storage space of the memory needs to be further saved

Images