{"id":26981,"date":"2026-09-27T20:02:12","date_gmt":"2026-09-27T18:02:12","guid":{"rendered":"https:\/\/www.itspy.cz\/thesis\/optimization-of-the-routing-process-by-finding-paths-ingraph-structures-using-machine-learning\/"},"modified":"2026-09-27T20:04:54","modified_gmt":"2026-09-27T18:04:54","slug":"optimization-of-the-routing-process-by-finding-paths-ingraph-structures-using-machine-learning","status":"publish","type":"thesis","link":"https:\/\/www.itspy.cz\/en\/thesis\/optimization-of-the-routing-process-by-finding-paths-ingraph-structures-using-machine-learning\/","title":{"rendered":"Optimization of the Routing Process by Finding Paths in\nGraph Structures, using Machine Learning"},"content":{"rendered":"<p>Prepojenos\u0165 dne\u0161n\u00e9ho sveta vedie k st\u00e1le v\u00e4\u010d\u0161ej d\u00f4le\u017eitosti<br \/>\npo\u010d\u00edta\u010dov\u00fdch siet\u00ed. Pre zlep\u0161enie kvality komunik\u00e1cie v<br \/>\npo\u010d\u00edta\u010dov\u00fdch sie\u0165ach, ve\u013ek\u00e9 mno\u017estvo v\u00fdskumn\u00edkov zameriava<br \/>\nsvoju pr\u00e1cu na po\u010d\u00edta\u010dov\u00e9 siete. Jedn\u00fdm smerom v\u00fdskumu v<br \/>\npo\u010d\u00edta\u010dov\u00fdch sie\u0165ach je vyu\u017eitie strojov\u00e9ho u\u010denia v<br \/>\nsmerovacom procese. T\u00e1to pr\u00e1ca sa venuje anal\u00fdze<br \/>\nexistuj\u00facich pr\u00edstupov k vyu\u017eitiu strojov\u00e9ho u\u010denia v<br \/>\nsmerovacom procese a experiment\u00e1lne vyhodnocuje niektor\u00e9 z<br \/>\ndan\u00fdch navrhovan\u00fdch pr\u00edstupov, konkr\u00e9tne v\u00fdber cesty pre<br \/>\nsmerovanie d\u00e1t a predikciu v\u00e1h pridelen\u00fdch jednotliv\u00fdm<br \/>\nlink\u00e1m. T\u00e1to pr\u00e1ca taktie\u017e navrhuje nov\u00fd smerovac\u00ed pr\u00edstup,<br \/>\nktor\u00fd kombinuje oba predch\u00e1dzaj\u00face pr\u00edstupy do jedn\u00e9ho<br \/>\nsmerovacieho pr\u00edstupu. Pokia\u013e vieme, tak\u00fdto pr\u00edstup nebol<br \/>\nnavrhnut\u00fd v \u017eiadnom predch\u00e1dzaj\u00facom v\u00fdskume v \u010dase p\u00edsania<br \/>\ntejto pr\u00e1ce. V\u0161etky tri pr\u00edstupy s\u00fa v tejto pr\u00e1ci<br \/>\nexperiment\u00e1lne vyhodnocovan\u00e9 a porovn\u00e1van\u00e9 medzi sebou ako<br \/>\naj s tradi\u010dnej\u0161\u00edm pr\u00edstupom vyu\u017e\u00edvaj\u00facim SPF algoritmus.<\/p>\n","protected":false},"featured_media":26726,"template":"","meta":{"_acf_changed":false,"_links_to":"","_links_to_target":""},"university":[467,181],"thesis-year":[466],"class_list":["post-26981","thesis","type-thesis","status-publish","has-post-thumbnail","hentry","thesis-year-466"],"acf":{"autor":"Juraj Jur\u010di\u0161in","portret":"","vedouci":"doc. Ing. Peter Feci\u013eak, PhD."},"_links":{"self":[{"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/thesis\/26981","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/thesis"}],"about":[{"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/types\/thesis"}],"version-history":[{"count":1,"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/thesis\/26981\/revisions"}],"predecessor-version":[{"id":27036,"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/thesis\/26981\/revisions\/27036"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/media\/26726"}],"wp:attachment":[{"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/media?parent=26981"}],"wp:term":[{"taxonomy":"university","embeddable":true,"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/university?post=26981"},{"taxonomy":"thesis-year","embeddable":true,"href":"https:\/\/www.itspy.cz\/en\/wp-json\/wp\/v2\/thesis-year?post=26981"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}