TY - GEN

T1 - New parallel shortest path searching algorithm based on dynamically reconfigurable processor DAPDNA-2

AU - Ishikawa, Hiroyuki

AU - Shimizu, Sho

AU - Arakawa, Yutaka

AU - Yamanaka, Naoaki

AU - Shiba, Kosuke

PY - 2007

Y1 - 2007

N2 - 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(N2) 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(N2) 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.

AB - 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(N2) 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(N2) 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.

UR - http://www.scopus.com/inward/record.url?scp=38549174316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38549174316&partnerID=8YFLogxK

U2 - 10.1109/ICC.2007.332

DO - 10.1109/ICC.2007.332

M3 - Conference contribution

AN - SCOPUS:38549174316

SN - 1424403537

SN - 9781424403530

T3 - IEEE International Conference on Communications

SP - 1997

EP - 2002

BT - 2007 IEEE International Conference on Communications, ICC'07

T2 - 2007 IEEE International Conference on Communications, ICC'07

Y2 - 24 June 2007 through 28 June 2007

ER -