1. CSN
  2. All Volumes and Issues
  3. Number 905, 2018
  4. Selection of optimal path finding algorithm for data transmition in distributed systems

Selection of optimal path finding algorithm for data transmition in distributed systems

CSN.
2018;
, Number 905
: pp. 42 - 48
https://doi.org/10.23939/csn2018.905.042
Authors:
  1. Yevhenii Vavruk
  2. Z. Mozil
1
Lviv Polytechnic National University, Computer Engineering Department
2
Lviv Polytechnic National University Computer Engineering Department

Considered typical structure of the multilevel distributed system, the data transmission problems are analyzed and the graphs can be used for their solution. The criteria for choosing the optimal path search algorithm are chosen. Based on the proposed criteria, the Bellman-Ford algorithm is chosen to find the optimal path in the graph. Used principles of Dirty Flag, CSR (Compressed Sparse Row) and defined time-memory relationship parameters to increase the speed of the algorithm.

search of the optimal path
distributed system
Bellman-Ford algorithm
Dirty Flag
CSR
  1. Dolinskaya I. Optimal Path Finding in Direction, Location and Time Dependent Environments / Irina Dolinskaya. – Evanston, 2012. – 33 с. – (Northwestern University).
  2. Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs / Madhua Pradesh. – Bhopal, India, 2016. – 9 с. – (Maulana Ajad National Institute of Technology).
  3. Krianto S. Bellman Ford algorithm in Routing Information Protocol / Sulaiman Krianto. – Indonesia, 2018. – 10 с. – (Universitas Prima Indonesia).
  4. Aksak N. Vykorystannia alhorytmiv poshuku naikorotshoho shliakhu na hrafakh (Using algorithms to find the shortest path on the graphs) / Nikolay Aksak. – Kharkiv, 2004. – 10 с.
  5. Dunets R. Topolohiia kompiuternykh system (Topology of computer systems) / Roman Dunets. – Lviv, 2007. – 48 с. – (Lviv Polytechnic National University).