Routing Table Decomposition in Line Cards with Different Capacity

Abstract

Researchers in routing table decomposition have got many achievements but never considered the situation of line card with different capacity. Generally, decomposed storage algorithm pursues storing uniformity in order to enhance the utilization of storage. In line cards with different capacity, measuring the uniformity needs a new standard. Proposed Routing Table Decomposition of Line Cards with Different Capacity, namely RELI, decomposes the binary route tree created by all route entries to group the whole route table, making the stored saturation of line cards even and converging to a threshold value. It helps to decompose the routing table into line cards with different capacity uniformly, control the number of items in line cards, and reduce the number of locating route as possible. Furthermore, RELI algorithm can also decompose and store routing table into line cards with same capacity.