Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/20314| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Spasov, Dejan | en_US |
| dc.contributor.author | Gushev, Marjan | en_US |
| dc.date.accessioned | 2022-07-04T09:48:16Z | - |
| dc.date.available | 2022-07-04T09:48:16Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/20314 | - |
| dc.description.abstract | In 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.publisher | Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia | en_US |
| dc.title | Distance Vector Routing | en_US |
| dc.type | Proceeding article | en_US |
| dc.relation.conference | CIIT 2012 | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 9CiiT-55.pdf | 242.4 kB | Adobe PDF | View/Open |
Page view(s)
49
checked on Apr 22, 2024
Download(s)
4
checked on Apr 22, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.