MRA*: Parallel and Distributed Path in Large-Scale Graph Using MapReduce-A* Based Approach

In this paper, we present a contribution for the Single Source Shortest Path Problem (SSSPP) in large-scale graph with A* algorithm. A* is one of the most efficient graph traversal algorithm because it is driven by a heuristic which determines the optimal path. A* approach is not efficient when the graph is too large to be processed due to exponential time complexity. We propose a MapReduce-based approach called MRA*: MapReduce-A* which consists to combine the A* algorithm with MapReduce paradigm to compute the shortest path in parallel and distributed environment. We perform experiments in a Hadoop multi-node cluster and our results prove that the proposed approach outperforms A* algorithm and reduces significantly the computational time.

[1]  Tag Gon Kim,et al.  Parallel and Distributed Framework for Standalone Monte Carlo Simulation using MapReduce , 2015 .

[2]  Sabeur Aridhi,et al.  A MapReduce-based approach for shortest path problem in large-scale networks , 2015, Eng. Appl. Artif. Intell..

[3]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[4]  Mohammad Ibrahim Khan,et al.  MetaG: a graph-based metagenomic gene analysis for big DNA data , 2016, Network Modeling Analysis in Health Informatics and Bioinformatics.

[5]  Yen-Yoo You,et al.  The Effects of Emotion and Communication on Job Involvement , 2015 .

[6]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[7]  Mahadev Satyanarayanan,et al.  Scale and performance in a distributed file system , 1988, TOCS.

[8]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[9]  Steven J. Plimpton,et al.  MapReduce in MPI for Large-scale graph algorithms , 2011, Parallel Comput..

[10]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[11]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[12]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Sabeur Aridhi,et al.  Density-based data partitioning strategy to approximate large-scale subgraph mining , 2012, Inf. Syst..

[15]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[16]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[17]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[18]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[19]  Howard Gobioff,et al.  The Google file system , 2003, SOSP '03.

[20]  Rui Yang,et al.  Path Optimization Study for Vehicles Evacuation based on Dijkstra Algorithm , 2014 .