• Home
  • Search
  • New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2
  • Cite Icon10
  • https://doi.org/10.1109/icc.2007.332Copy DOI Icon

New Parallel Shortest Path Searching Algorithm based on Dynamically Reconfigurable Processor DAPDNA-2

  • Jun 1, 2007
  • H Ishikawa +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper proposes a parallel shortest path-searching algorithm and implements it on a newly structured parallel reconfigurable processor, DAPDNA-2 (IPFlex Inc). Routing determines the shortest paths from the source to the ultimate destination through intermediate nodes. In open shortest path first (OSPF), Dijkstra's shortest path algorithm, which is the conventional one, finds the shortest paths from the source on a program counter-based processor. The calculation time for Dijkstra's algorithm is O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) when the number of nodes is N. When the network scale is large, calculation time required by Dijkstra's algorithm increases rapidly. It's very difficult to compute Dijkstra's algorithm in parallel because of the need for previous calculation results, so Dijkstra's algorithm is unsuitable for parallel processors. Our proposed scheme finds the shortest paths using a simultaneous multi-path search method. In contrast with Dijkstra's algorithm, several nodes can be determined at one time. Moreover, we partition the network into different groups (network groups) and find the all-node pair's shortest path in each group using a pipeline operation. Networks can be abstracted, and the shortest paths in very large networks can be found easily. The proposed scheme can decrease calculation time from O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) to O(N) using a pipeline operation on DAPDNA-2. Our simulations show that the proposed algorithm uses 99.6% less calculation time than Dijkstra's algorithm. The proposed algorithm can be applied to the very large Internet network designs of the future.

Similar Papers
  • Conference Article
  • Citations9

A Fuzzy QOS Routing Algorithm for Communication Networks

  • Jan 01, 2006
  • M Yaghmaei +2
  • Research Article
  • Citations31

A theorem on the expected complexity of dijkstra's shortest path algorithm

  • Sep 01, 1985
  • Journal of Algorithms
  • Kohei Noshita
  • Research Article
  • Citations588

Faster algorithms for the shortest path problem

  • Apr 01, 1990
  • Journal of the ACM
  • Ravindra K Ahuja +3
  • Conference Article
  • Citations23

T: A Heuristic Search Based Path Planning Algorithm for Temporal Logic Specifications

  • May 01, 2020
  • Danish Khalidi +2
  • Conference Article
  • Citations64

Enhancing Contact Graph Routing for Delay Tolerant Space Networking

  • Dec 01, 2011
  • J Segui +2
  • Research Article
  • Citations7

An O( mlog log D) algorithm for shortest paths

  • May 01, 1983
  • Discrete Applied Mathematics
  • Rolf G Karlsson +1
  • Conference Article
  • Citations6

A GIS-based Network Analysis for Truck Vehicles in Baghdad's City Road Network

  • Jun 09, 2022
  • Khaldoon T Falih +2
  • Research Article

不規則四面体分割されたモデル空間への最短経路波線追跡法の適用

  • Jan 01, 2005
  • BUTSURI-TANSA(Geophysical Exploration)
  • Makoto Hoshino
  • Conference Article
  • Citations4

NPASA: A Noble Path Selection Algorithm

  • Oct 01, 2008
  • P Calduwel Newton +4
  • Conference Article
  • Citations11

Energy efficient routing algorithm on the target tracking in Wireless Sensor Network

  • Dec 01, 2015
  • Mrunali Umale +1
  • Conference Article
  • Citations42

A Fast Vessel Centerline Extraction Algorithm for Catheter Simulation

  • Jun 01, 2007
  • Proceedings - IEEE Symposium on Computer-Based Medical Systems
  • Jan Egger +3
  • Conference Article
  • Citations1

Lowest measure paths: a Survivable Signaling Network design approach

  • Oct 11, 1992
  • J Pisano
  • Conference Article
  • Citations1

Ray-based Simulations of Received Signals from Ground Penetrating Radar

  • Oct 01, 2006
  • Jianzhong Zhang +2
  • Book Chapter
  • Citations3

Energetic Path Finding across Massive Terrain Data

  • Jan 01, 2009
  • Andrew Tsui +1
  • Book Chapter

Report of the Session on Network Flow, Assignment and Travelling Salesman Problems

  • Jan 01, 1979
  • Annals of Discrete Mathematics
  • Guy De Ghellinck +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.