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

Abstract

Veliki rast i razvoj računalnih mreža te razmjena velike količine podataka naglašava potrebu za korištenjem kvalitetnih mrežnih protokola. Temeljni zadatak modernih mrežnih protokola je osiguravanje sigurne i pouzdane komunikacije između računala i procesa, sprečavanje neželjenog pristupa informacijama te pronalaženje optimalnog (najkraćeg) puta kroz mrežu. Osnovni cilj izrade ovog rada je usporedba i prikaz mogućnosti korištenja Distance Vector i Link State protokola usmjeravanja. U radu je ukratko prikazan razvoj protokola usmjeravanja te je napravljena njihova podjela i analiza mogućnosti primjene. Detaljno su opisani Belmann-Fordov, DUAL (Diffusing Update ALgorithm) i Dijkstrin algoritam pronalaženja najkraćeg puta u mreži, koji su osnova za kreiranje kvalitetnih tablica usmjeravanja. Prikazan je postupak povezivanja nekoliko lokalnih mreža i konfiguriranje usmjernika različitim protokolima usmjeravanja. Usporedbom brzine konvergencije tablica usmjeravanja u realnom okruženju provjerene su mogućnosti primjene Distance Vector i Link State protokola u manjim i srednje velikim mrežama.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