Methods and system for efficient route lookup

摘要

A method and system for performing a route lookup in a routing system, including a plurality of routes places a bound on the number of accesses to the memory necessary to perform a route lookup and guarantees the minimal amount of memory to achieve a particular bound. For each node the memory required to meet a bound on the depth of the tree rooted at that node is computed, given the distribution of routes in the network. A route can be added or deleted which changes the topology and hence the memory required to meet the bound, but not all nodes need to recalculate their costs, and an incremental algorithm minimizes the overall costs of performing a route topology change and the subsequent lookup