FAST UPDATE ALGORITHM FOR TCAM-BASED ROUTING LOOKUPS

Introduction　　 The higher bandwidth need requires fastercommunication links and faster network router.The central bottlenecks in router are link speeds,switching and routing lookups. Readily availablesolutions exist for the first two factors:for exam-ple,fiber- optic cables can provide faster links.Switching was well studied and the good solutionslike fast busses and crossbar switches were devel-oped1,2 ] .Thus the major remaining bottleneck isfast routing lookups. Fast forwarding engines,…

FAST UPDATE ALGORITHM FOR TCAM-BASED ROUTING LOOKUPS

Routing technology has been forced to evolve towards higher capacity and per port packet processing speed. The ability to achieve high forwarding speed is due to either software or hardware technology. TCAM (Ternary Content Addressable Memory) provides a performance advantage over other software or hardware search algorithms, often resulting in an order of magnitude reduction of search time. But slow updates may affect the performance of TCAM based routing lookup. So the key is to design a table management algorithm, which supports high speed updates in TCAMs. This paper presented three table management algorithms, and then compared their performance. Finally, the optimal one after comparing was given.