首页> 外文会议>International Conference on High Performance Switching and Routing >A prototype of a dynamically reconfigurable processor based off-loading engine for accelerating the shortest path calculation with GNU zebra
【24h】

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

机译:基于动态可重构处理器的基于OFF装载引擎的原型,用于加速GNU斑马最短路径计算

获取原文

摘要

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, 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.
机译:已经开发出硬件废料引擎,以加快OSPF(首先打开最短路径)中的最短路径计算。开发系统与硬件和软件共同设计,以优化用于高效交通工程(TE)的路由器的架构。为了加快最短的路径计算,我们采用动态可重新配置的处理器IPFlex DAPDNA-2,作为硬件废料仪,新结构化的新颖高速并行最短路径算法,称为MPSA(多路由并行搜索算法) 。所提出的算法包括简单的处理,其中多个处理器元素(PE)的DAPDNA-2同时搜索多个路径。因此,与流行的最短路径算法,Dijkstra算法相比,它将最短路径计算的执行时间降低到2.8%。我们的原型与商品Linux PC上的着名软件路由器,GNU Zebra一起工作。建议的体系结构和原型系统可以应用于未来的网络复杂TE。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号