prikaz prve stranice dokumenta Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta
  Download
PDF 4.24 MB
master's thesis
Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta
Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences, 2020. urn:nbn:hr:119:651536
Miletić, Nikolina
University of Zagreb
Faculty of Transport and Traffic Sciences
Division of Transport
Department of Information and Communications Traffic

Institutional repository: Faculty of Transport and Traffic Sciences

Cite this document

Miletić, N. (2020). Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta (Master's thesis). Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences. Retrieved from https://urn.nsk.hr/urn:nbn:hr:119:651536

Miletić, Nikolina. "Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta." Master's thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, 2020. https://urn.nsk.hr/urn:nbn:hr:119:651536

Miletić, Nikolina. "Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta." Master's thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, 2020. https://urn.nsk.hr/urn:nbn:hr:119:651536

Miletić, N. (2020). 'Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta', Master's thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, accessed 11 June 2024, https://urn.nsk.hr/urn:nbn:hr:119:651536

Miletić N. Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta [Master's thesis]. Zagreb: University of Zagreb, Faculty of Transport and Traffic Sciences; 2020 [cited 2024 June 11] Available at: https://urn.nsk.hr/urn:nbn:hr:119:651536

N. Miletić, "Usmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta", Master's thesis, University of Zagreb, Faculty of Transport and Traffic Sciences, Zagreb, 2020. Available at: https://urn.nsk.hr/urn:nbn:hr:119:651536

Metadata
TitleUsmjeravanje u mrežama s komutacijom paketa temeljeno na modelu najkraćeg puta
Title (english)Shortest Path Routing in Packet Switch Networks
AuthorNikolina Miletić
MentorŠtefica Mrvelj (mentor)
Committee memberMarko Matulin (predsjednik povjerenstva)
Committee memberIvan Forenbacher (član povjerenstva)
Committee memberZvonko Kavran (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Transport and Traffic Sciences
(Division of Transport)
(Department of Information and Communications Traffic)
Zagreb
Defense date and country2020-09-24, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Traffic and Transport Technology
Postal and Telecommunications Traffic
Abstract
S obzirom na to da je način prijenosa podatka u komunikacijskim mrežama paketskim modom obilježje današnjih novih mreža, u radu su analizirane značajke paketskih mreža i razvijenih metoda usmjeravanja u njima. Naglasak je na skupu usmjerivačkih algoritama koji se temelje na modelu najkraćeg puta iz razloga što su ti algoritmi zastupljeniji u primjeni. U radu je prikazan proces usmjeravanja u mreži s komutacijom paketa te je objašnjena ulogu čvorova u procesu usmjeravanja s obzirom na njihov položaj u mreži. Nadalje, prikazane su značajke algoritama usmjeravanja koji se temelje na najkraćem putu (Dijkstra, Floyd-Warshall i Bellman-Ford) i načinjena je njihova usporedba. Usmjeravanje temeljeno na modelu najkraćeg puta zapravo određuje minimalni trošak između izvorišta i odredišta, a taj trošak se ogleda u kašnjenju paketa na putu. Korištenjem navedenih algoritam određeni su najkraći putovi za zadanu neopterećenu i opterećenu mrežu, koja se sastoji od 10 čvorova i 13 spojnica. Također su za opterećenu i neopterećenu mrežu određene performanse mreže (kašnjenje na putu i vjerojatnost blokiranja najkraćeg/ prioritetnog puta).
Abstract (english)
Considering that data transfer mode in packet mode communication networks is a feature of today's new networks, this paper analyzes the charactristics of packet networks and the developed routing methods in them. The emphasis is on a set of routing algorithms based on the shortest path model for the reason that these algorithms are more prevalent in application. Furthermore, the most important features of each shortest path-based routing algorithm are mentioned (Dijkstra, Floyd-Warshall and Bellamn-Ford) and a comparasion of them was made. Shortest path-based routing actually determines the minimum cost between source and destination, and that cost is reflected in the delay of the package on the way. Using the above algorithms, the shortest paths for a given unloaded and loaded network are determined, which consists of 10 nodes and 13 links. Network performance is also determined for a loaded and unloaded network (delay on the road and probability of blocking the shortest/ priority path).
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:119:651536
Study programmeTitle: Traffic and Transport; specializations in: Road Traffic and Transport, Railway Traffic and Transport, Water Traffic and Transport, Air Traffic and Transport, Postal Traffic, Information and Communication Traffic, Urban Traffic and Transport
Course: Road Traffic and Transport
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka prometa (magistar/magistra inženjer/inženjerka prometa)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2020-10-20 14:19:55