Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Ubiquitous Networking

UNet 2017: Ubiquitous Networking pp 390–401Cite as

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10542))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Plimpton, S.J., Devine, K.D.: MapReduce in MPI for large-scale graph algorithms. Parallel Comput. 37, 610–632 (2011). doi:10.1016/j.parco.2011.02.004

    Article  Google Scholar 

  2. Chen, Y.-Z., Shen, S.-F., Chen, T., Yang, R.: Path optimization study for vehicles evacuation based on Dijkstra algorithm. Procedia Eng., 159–165 (2014). 2013 International Conference on Performance-Based Fire and Fire Protection Engineering (ICPFFPE 2013), Wuhan

    Google Scholar 

  3. Welcome to apache hadoop. http://hadoop.apache.org/

  4. Aridhi, S., d’Orazio, L., Maddouri, M., Mephu Nguifo, E.: Density-based data partitioning strategy to approximate large-scale subgraph mining. Inf. Syst. 48, 213–223 (2015)

    Article  Google Scholar 

  5. Aridhi, S., Lacomme, P., Ren, L., Vincent, B.: A MapReduce-based approach for shortest path problem in large-scale networks. Eng. Appl. Artif. Intell. 41, 151–165 (2015)

    Article  Google Scholar 

  6. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129–174 (1993)

    MATH  MathSciNet  Google Scholar 

  8. Chowdhury, L., Khan, M.I., Deb, K., Kamal, S.: MetaG: a graph-based metagenomic gene analysis for big DNA data. Netw. Model. Anal. Health Inform. Bioinform. 5(1), 27 (2016)

    Article  Google Scholar 

  9. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)

    Article  Google Scholar 

  10. Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of a*. J. ACM (JACM) 32(3), 505–536 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  13. Ghemawat, S., Gobioff, H., Leung, S.T.: The Google file system. In: ACM SIGOPS Operating Systems Review, vol. 37, pp. 29–43. ACM

    Google Scholar 

  14. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for a*: efficient point-to-point shortest path algorithms. In: Proceedings of the Meeting on Algorithm Engineering and Experiments, pp. 129–143. Society for Industrial and Applied Mathematics (2006)

    Google Scholar 

  15. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1967)

    Article  Google Scholar 

  16. Howard, J.H., Kazar, M.L., Menees, S.G., Nichols, D.A., Satyanarayanan, M., Sidebotham, R.N., West, M.J.: Scale and performance in a distributed file system. ACM Trans. Comput. Syst. 6(1), 51–81 (1988)

    Article  Google Scholar 

  17. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., Żytkow, J. (eds.) PKDD 2000. LNCS, vol. 1910, pp. 13–23. Springer, Heidelberg (2000). doi:10.1007/3-540-45372-5_2

    Chapter  Google Scholar 

  18. Ira, P.: Bi-directional search. Mach. Intell. 6(127–140), 13 (1971)

    MATH  Google Scholar 

  19. Kim, B.S., Kim, T.G., Song, H.S.: Parallel and distributed framework for standalone Monte Carlo simulation using MapReduce. Indian J. Sci. Technol. 8(25), 1 (2015)

    Article  Google Scholar 

  20. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co., Inc., Boston (1984)

    Google Scholar 

  21. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We would like to thank Pr Tarik Nahhal, Pr Brahim Aghezzaf and Pr Abdeltif Elbyed for their useful remarks about this work.

Author information

Authors and Affiliations

  1. Laboratoire Informatique, Modélisation des Systèmes et Aide à la Décision (LIMSAD), Faculty of Sciences of Casablanca, Hassan II University, Km 8 Route d’El Jadida, B.P 5366, 20100, Maarif, Casablanca, Morocco

    Wilfried Yves Hamilton Adoni, Tarik Nahhal, Brahim Aghezzaf & Abdeltif Elbyed

Authors
  1. Wilfried Yves Hamilton Adoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tarik Nahhal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Brahim Aghezzaf
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdeltif Elbyed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tarik Nahhal .

Editor information

Editors and Affiliations

  1. ENSEM, Hassan II University of Casablanca, Casablanca, Morocco

    Essaid Sabir

  2. Universidad Carlos III de Madrid, Madrid, Spain

    Ana García Armada

  3. International University of Rabat, Morocco, and University of Leeds, UK, Leeds, United Kingdom

    Mounir Ghogho

  4. CentraleSupélec LANEAS, Gif-sur-Yvette, France

    Mérouane Debbah

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Adoni, W.Y.H., Nahhal, T., Aghezzaf, B., Elbyed, A. (2017). MRA*: Parallel and Distributed Path in Large-Scale Graph Using MapReduce-A* Based Approach. In: Sabir, E., García Armada, A., Ghogho, M., Debbah, M. (eds) Ubiquitous Networking. UNet 2017. Lecture Notes in Computer Science(), vol 10542. Springer, Cham. https://doi.org/10.1007/978-3-319-68179-5_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68179-5_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68178-8

  • Online ISBN: 978-3-319-68179-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation