TY - GEN
T1 - A prototype of a dynamically reconfigurable processor based off-loading engine for accelerating the shortest path calculation with GNU zebra
AU - Shimizu, Sho
AU - Kihara, Taku
AU - Arakawa, Yutaka
AU - Yamanaka, Naoaki
AU - Shiba, Kosuke
PY - 2008/12/1
Y1 - 2008/12/1
N2 - A hardware off-loading engine to speed up the shortest path calculation in OSPF (Open Shortest Path First) has been developed. The developed system is co-designed with both hardware and software to optimize an architecture of a router for highly functional Traffic Engineering (TE). To speed up the shortest path calculation, we employ a dynamically reconflgurable processor, IPFlex DAPDNA-2, as a hardware off- loader, and newly structured a novel high-speed parallel shortest path algorithm, called MPSA (Multi-route Parallel Search Algorithm). The proposed algorithm consists of simple processing, in which multiple paths are simultaneously searched by multiple Processor Element (PE) of DAPDNA-2. Therefore, it reduces the execution time of shortest path calculation to 2.8% compared with the popular shortest path algorithm, Dijkstra's algorithm. Our prototype works together with a famous software-based router, GNU Zebra, on commodity Linux PC. The proposed architecture and prototype system can be applied to future network sophisticated TE.
AB - A hardware off-loading engine to speed up the shortest path calculation in OSPF (Open Shortest Path First) has been developed. The developed system is co-designed with both hardware and software to optimize an architecture of a router for highly functional Traffic Engineering (TE). To speed up the shortest path calculation, we employ a dynamically reconflgurable processor, IPFlex DAPDNA-2, as a hardware off- loader, and newly structured a novel high-speed parallel shortest path algorithm, called MPSA (Multi-route Parallel Search Algorithm). The proposed algorithm consists of simple processing, in which multiple paths are simultaneously searched by multiple Processor Element (PE) of DAPDNA-2. Therefore, it reduces the execution time of shortest path calculation to 2.8% compared with the popular shortest path algorithm, Dijkstra's algorithm. Our prototype works together with a famous software-based router, GNU Zebra, on commodity Linux PC. The proposed architecture and prototype system can be applied to future network sophisticated TE.
UR - http://www.scopus.com/inward/record.url?scp=60649110484&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=60649110484&partnerID=8YFLogxK
U2 - 10.1109/HSPR.2008.4734433
DO - 10.1109/HSPR.2008.4734433
M3 - Conference contribution
AN - SCOPUS:60649110484
SN - 9781424419821
T3 - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
SP - 131
EP - 136
BT - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
T2 - 2008 International Conference on High Performance Switching and Routing, HPSR 2008
Y2 - 15 May 2008 through 17 May 2008
ER -