Computational load analysis of Dijkstra, A*, and Floyd-Warshall algorithms in mesh network

Proceedings of 2013 International Conference on Robotics, Biomimetics, Intelligent Computational Systems, ROBIONETICS 2013

Volumn , Issue , 2013, Pages 104-108

  Djojo, Michael Alexander ^a   Karyono, Kanisius ^a  

^a Universitas Multimedia Nusantara   (Indonesia)

Author keywords

a*; computional load; dijkstra; floyd warshall; shortest path

Indexed keywords

A; DIJKSTRA; EXCHANGE OF INFORMATION; FLOYD-WARSHALL; FLOYD-WARSHALL ALGORITHMS; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SIMULATED ALGORITHMS;

BIOMIMETICS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; ROBOTICS;

ALGORITHMS;

EID: 84896802006     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBIONETICS.2013.6743587     Document Type: Conference Paper

References (17)

1. Ariffin, Wan Nor Munirah, et aI., 2011, Shortest Path Technique for Switching in a Mesh Network, Universitas Malaysia Perl is, Malaysia.
2. Suherman, Eman, et aI., 2011, Simulasi Algoritma Dijkstra pada Protokol Routing Open Shortest Path, Universitas Diponegoro, Semarang, Indonesia.
3. Liu, Jingang, Yujun Liu, 2010, Application of A Algorithm in Traffic Navigational System, Information Engineering and Electronic Commerce (lEEC) 2nd International Symposium.
4. Faramroze Engineer, 2005, Fast Shortest Path Algorithms for Large Road Networks, University of Auckland, New Zealand.
5. Ruohonen, Keijo, 2008, Graph Theory, University of British Columbia, Canada.
6. Lum, J., 2001, The Importance of Switching, EE-Evaluation Engineering.
7. Misa, Thomas.I., 2010, An Interview with Edsger W. Dijkstra, Communications of The ACM.
8. Anderson, Ruth, 2010, Dijkstra's Algorithm Examples, University of Washington, USA.
9. Hart, Peter E., et aI., 1968, A Formal Basis for The Heuristic Determination of Minimum Cost Paths, IEEE Transactions of Systems Science and Cybernetics.
10. Nilsson, Nils J., 1998, Artificial Intelligence: A New Synthesis, Stanford University California, USA.
11. Weisstein, Eric, 2009, Floyd-Warshall Algorithm, Wolfram Math World.
12. Kenwood, Julian, Baxter, Richard, 2008, Dijkstras and Floyd Warshall, South African Programming Olympiad.
13. Banks, Carson, et aI., 2001, Discrete Event System Simulation, Prentice Hall.
14. Varga, Andras, 2003, What http://www.omnetpp.org/home/what-is-omnet, November 2012. is OMNeT++?, last accessed: 10
15. Weingartner, Elias, et aI., 2009, A performance comparison of recent network simulators, University Aachen, Germany.
16. Yoshii, Kazutomo, 2006, Time Stamp Counter, Argonne National Laboratory, USA.
17. Fog, Agner, 2012, Instruction tables Lists of instruction latencies, throughputs and micro-op- eration breakdowns for Intel, AMD and VIA CPUs, Copenhagen University College of Engineering.