Professional paper

Comparison and Application of "Distance Vector“ and "Link State" Network Protocols

Ladislav Havaš orcid.org/0000-0002-5051-4486 ; Veleučilište u Varaždinu, Varaždin, Hrvatska
Damira Keček ; Veleučilište u Varaždinu, Varaždin, Hrvatska
Kristijan Knez ; Veleučilište u Varaždinu, Varaždin, Hrvatska

Abstract

Significant growth and development of computer networks and the exchange of great amount of data emphasize the need for using high quality network protocols. The basic task of modern network protocols is to provide safe and reliable communication between a computer and the process, prohibiting unwanted access to the information, and finding an optimal (the shortest) route through the network. The main goal of this paper is to compare and display application possibilities in using Distance Vector and Link State routing protocols. This paper shows the development of routing protocols in brief and there is also their classification and the analysis of application possibilities. It describes Belmann-Ford, DUAL (Diffusing Update ALgorithm) and Dijkstra algorithms for finding the shortest route through the network in details – they are the basis for creating high quality routing tables. A procedure of linking the tables of several local networks and the configuration of a router of different routing protocols are also shown. By comparing the speed of table convergence of routing in real time and in real surroundings, application possibilities of Distance Vector and Link State protocols were tested in smaller and in medium-size networks.

Keywords

Belmann-Ford; Dijkstra; Distance Vector; Link State; computer network; router

Hrčak ID:

105589

URI

https://hrcak.srce.hr/105589

Publication date:

15.6.2013.

Article data in other languages: croatian

Visits: 3.631 *