https://oldena.lpnu.ua/handle/ntb/51763| Title: | Selection of optimal path finding algorithm for data transmission in Distributed Systems |
| Authors: | Mozil, Zakhar Vavruk, Yevhenii |
| Affiliation: | Lviv Polytechnic National University |
| Bibliographic description (Ukraine): | Mozil Z. Selection of optimal path finding algorithm for data transmission in Distributed Systems / Zakhar Mozil, Yevhenii Vavruk // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 30–36. — (10th International academic conference “Computer science & engineering 2018”). |
| Bibliographic description (International): | Mozil Z. Selection of optimal path finding algorithm for data transmission in Distributed Systems / Zakhar Mozil, Yevhenii Vavruk // Litteris et Artibus : proceedings, 23–25 November 2018, Lviv. — Lviv : Lviv Politechnic Publishing House, 2018. — P. 30–36. — (10th International academic conference “Computer science & engineering 2018”). |
| Is part of: | Litteris et Artibus : proceedings, 2018 |
| Conference/Event: | 8th International youth science forum «Litteris et Artibus» |
| Journal/Collection: | Litteris et Artibus : proceedings |
| Issue Date: | 22-Nov-2018 |
| Publisher: | Видавництво Львівської політехніки Lviv Politechnic Publishing House |
| Place of the edition/event: | Львів Lviv |
| Temporal Coverage: | 23–25 November 2018, Lviv |
| Keywords: | shortest pathfinding problem optimal pathfinding distributed system graphs Bellman-Ford algorithm |
| Number of pages: | 7 |
| Page range: | 30-36 |
| Start page: | 30 |
| End page: | 36 |
| Abstract: | Considered typical structure of the distributed system. Also considered problem of data transmission in a multilevel distributed system. The criteria for optimal pathfinding algorithm are selected and the optimal algorithm is chosen. There is described Bellman-Ford algorithm for finding the path in the graph. |
| URI: | https://ena.lpnu.ua/handle/ntb/51763 |
| ISBN: | 978-966-941-294-2 |
| Copyright owner: | © Національний університет “Львівська політехніка”, 2018 |
| References (Ukraine): | [1] Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs / Madhua Pradesh., 2016. [2] Krianto S. O. Bellman Ford algorithm in Routing Information Protocol / Sulaiman Oris Krianto., 2017. |
| References (International): | [1] Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs, Madhua Pradesh., 2016. [2] Krianto S. O. Bellman Ford algorithm in Routing Information Protocol, Sulaiman Oris Krianto., 2017. |
| Content type: | Conference Abstract |
| Appears in Collections: | Litteris et Artibus. – 2018 р. |
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2018_Mozil_Z-Selection_of_optimal_path_finding_30-36.pdf | 69.77 kB | Adobe PDF | View/Open | |
| 2018_Mozil_Z-Selection_of_optimal_path_finding_30-36__COVER.png | 366.98 kB | image/png | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.