A performance analysis framework for routing lookup in scalable routers

Scalable router, as an effective way to rapidly improve the performance of routers, has received increasingly attention from both academe and industry. However, the routing lookup in scalable routers is different from that in traditional routers and lack of research. In this paper, we present the first systematic study on this topic. We first discuss routing lookup in scalable routers and provide a performance analysis framework for routing lookup delay based on queueing theory. Furthermore, we provide four different routing lookup schemes (Source Oblivious Routing, Hop-by-hop Oblivious Routing, Source Adaptive Routing and Hop-by-hop Adaptive Routing) and analyze their average delays and overheads under the framework. Finally we provide simulation results.