Selection of optimal path finding algorithm for data transmition in distributed systems
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.