Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: http://hdl.handle.net/20.500.12188/20314
DC FieldValueLanguage
dc.contributor.authorSpasov, Dejanen_US
dc.contributor.authorGushev, Marjanen_US
dc.date.accessioned2022-07-04T09:48:16Z-
dc.date.available2022-07-04T09:48:16Z-
dc.date.issued2012-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/20314-
dc.description.abstractIn this paper we give an overview of the distance vector routing strategies. We will compare two widely known routing protocols based on distance vector routing algorithms, is EIGRP and RIP, and we will propose few improvements to the RIP protocol. We believe that these improvements will provide faster convergence and better scalability in large networks.en_US
dc.publisherFaculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedoniaen_US
dc.titleDistance Vector Routingen_US
dc.typeProceeding articleen_US
dc.relation.conferenceCIIT 2012en_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers
Files in This Item:
File Опис SizeFormat 
9CiiT-55.pdf242.4 kBAdobe PDFView/Open
Прикажи едноставен запис

Page view(s)

85
checked on 3.5.2025

Download(s)

26
checked on 3.5.2025

Google ScholarTM

Проверете


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.