Paper Info
Title
A performance analysis framework for routing lookup in scalable routers
Abstract
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.
Year
Venue
Keywords
2009
ICOIN
hop-by-hop adaptive routing,source oblivious routing,scalable router,scalable routers,queueing theory,telecommunication transmission lines,delays,overheads,traditional routers,routing lookup,average delay,performance analysis framework,different routing lookup scheme,telecommunication network routing,source adaptive routing,hop-by-hop oblivious routing,adaptive routing
Field
DocType
ISBN
Link-state routing protocol,Dynamic Source Routing,Hierarchical routing,Computer science,Static routing,Policy-based routing,Enhanced Interior Gateway Routing Protocol,Routing domain,Computer network,Distributed computing,Routing protocol
Conference
978-89-960761-3-1
Citations 
PageRank 
References 
0
0.34
21
Authors
4
Name
Order
Citations
PageRank
Zhenhua Liu11729.49
Xiaoping Zhang2276.83
Youjian Zhao327332.53
Ruisheng Wang401.01