A prototype of a dynamically reconfigurable processor based off-loading engine for accelerating the shortest path calculation with GNU zebra

S. Shimizu, T. Kihara, Y. Arakawa, N. Yamanaka, K. Shiba
{"title":"A prototype of a dynamically reconfigurable processor based off-loading engine for accelerating the shortest path calculation with GNU zebra","authors":"S. Shimizu, T. Kihara, Y. Arakawa, N. Yamanaka, K. Shiba","doi":"10.1109/HSPR.2008.4734433","DOIUrl":null,"url":null,"abstract":"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 reconfigurable 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, Dijkstrapsilas 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.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

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 reconfigurable 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, Dijkstrapsilas 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个基于动态可重构处理器的卸载引擎的原型,用GNU zebra加速最短路径计算
为了提高OSPF(开放最短路径优先)中最短路径的计算速度,设计了一个硬件卸载引擎。该系统通过硬件和软件的协同设计,优化了路由器的架构,为高功能流量工程(TE)服务。为了加快最短路径的计算速度,我们采用动态可重构处理器IPFlex DAPDNA-2作为硬件卸载器,并构造了一种新的高速并行最短路径算法,称为MPSA (Multi-route parallel Search algorithm)。该算法处理简单,由DAPDNA-2的多个处理器元素(PE)同时搜索多条路径。因此,与流行的最短路径算法Dijkstrapsilas算法相比,它将最短路径计算的执行时间减少到2.8%。我们的原型与著名的基于软件的路由器GNU Zebra一起在商用Linux PC上工作。所提出的架构和原型系统可应用于未来的网络复杂TE。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic workload profiling and task allocation in packet processing systems A distributed and scalable MPLS architecture for next generation routers Distributed PC based routers: Bottleneck analysis and architecture proposal Efficient broadcasting in interface switching wireless networks Quick-Start and XCP on a network processor: Implementation issues and performance evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1