Selection of optimal path finding algorithm for data transmission in Distributed Systems
Computer Science & Engineering
I and my co-authors (if any) authorize the use of the Paper in accordance with the Creative Commons CC BY license
First published on this website: 30.10.2018 - 23:13
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.
Keywords
References
Pradesh M. Modified Dijkstra’s Algorithm for Dense Graphs / Madhua Pradesh., 2016.
Krianto S. O. Bellman Ford algorithm in Routing Information Protocol / Sulaiman Oris Krianto., 2017.
Full text
Comments
Dear Authors,
Your paper has been accepted!
We are glad to inform you that your conference paper has been accepted to participate in the 8th International Joint Youth Science Forum «Litteris et Artibus» & 13th International Conference «Young Scientists Towards the Challenges of Modern Technology», particularly in "Computer Science & Engineering" conference (November 22-24, 2018, Lviv, Ukraine)! Your paper will be published in digital proceedings with ISSN and DOI on the website https://openreviewhub.org/lea-2018.
Please, answer the following participation questions:
• Are you going to take part in the conference in person?
• Do you require official invitation letter from Lviv Polytechnic? (The invitation letter will be scanned and sent to your e-mail).
Presentation delivery regulations:
Conference participants will present their work on posters. Content and design of posters is arbitrary, but it should include the basic provisions of your paper: author names, title, main points, equations, figures etc. as well as exclude solid color, gradient or other costly to print backgrounds. The poster's upper part may include some information about your organization (title and logo, brief contact information).
Selected papers will be presented orally.
We also ask you to cover the conference fee till November 16, 2018:
Conference fees include online paper publication and organizational expenses. Cost of accommodation, meals and social program are not included. Total fee per paper (conference fee will be collected for the author of the highest degree and/or affiliation; maximum number of paper co-authors is 5).
Please note, that invitation will be sent and proceedings will be implemented only after 100% payment fee.
If you need help with accommodation, please send a request to the Secretary. Invitations to lunch will be available for purchase at the registration desk.
The conference fee’s payment details:
Account details for payment of the participation fee from Ukraine participants:
Одержувач: Первинна профспілкова організація студентів та аспірантів Національного університету «Львівська політехніка»
Банк: Акціонерний банк «Південний»
МФО: 328209
код ЄДРПОУ: 20846213
Номер рахунку: 26004010050168
Призначення платежу: П.І.Б, оргвнесок за участь у конференції «LEA-2018»
Account details for payment of the participation fee by international participants:
SWIFT: INGBPLPW
IBAN: PL 95 2130 0004 2001 0549 2152 0001
Register adress:
Fundacja na Rzecz Młodych Naukowców
ul. Polna 50, 00-644 Warsaw
Correspondence address:
Fundacja na Rzecz Młodych Naukowców ul. Wiślicka 5 m 90, 02-114 Warsaw
The full Forum’s program will be published on the https://openreviewhub.org/lea-2018 before November 19, 2018.
Looking forward to receiving your poster! See you in Lviv soon!
You shouldn’t pay the conference fee because of you are from Lviv Polytechnic National University.
Best regards,
Nataliia Veretennikova,
Computer Science & Engineering Secretary