Real-time dynamic decomposition storage method for routing table and route data forwarding method

Abstract

The invention discloses a real-time dynamic decomposition storage method for a routing table and a route data forwarding method. The storage method comprises the steps of acquiring a unit prefix of a newly arrived route, comparing the unit prefix with unit prefixes stored on line cards, and if one of the unit prefixes on the line cards is the same as the unit prefix of the route, then storing the newly arrived route into the corresponding line card; and if none of the unit prefixes on the line cards is the same as the unit prefix, storing the newly arrived route to a line card with the minimum storage capacity based on the route storage capacity of each line card. The invention is advantageous in that arrived route entries are stored into respective line cards through dynamic decomposition based on different unit prefixes and the load balance of the line cards is achieved; and meanwhile, the design allows the routes arriving at any time to achieve dynamic decomposition storage, and is high in random capability, better adapted to the changing process of a route table from unknown to known, and is high in real-time property.

Description

technical field [0001] The invention relates to the communication field, in particular to a method for real-time dynamic decomposition and storage of a routing table and a routing data forwarding method. Background technique [0002] The development of Internet technology has brought great challenges to the processing capabilities of routers, and more and more researches are devoted to solving the problems of routing table storage and fast lookup. However, the routing table decomposing and storing methods proposed so far are only based on a certain algorithm to achieve routing load balancing of each line card, without considering the status of the routing table and the dynamic changes of routing entries. As the routing table is constantly updated, these static decomposition storage methods cannot well solve the problem of line card load balancing, and may even affect the processing speed of the entire routing table. Contents of the invention [0003] The present invention...

AI Technical Summary

Problems solved by technology

However, the routing table decomposition and storage methods proposed so far are only based on a certain algorithm to achieve routing load balancing of each line card, and do not consider the state of the routing table and the dynamic changes of routing items.

As the routing table is constantly updated, these static decomposition storage methods cannot solve the problem of line card load balancing well, and may even affect the processing speed of the entire routing table

Images