Content deleted Content added
→Development of distance-vector routing: I argue that BGP is not a distance-vector protocol. Does anyone agree/disagree? Also I don't want to make an official change as I am unsure and I can't find a comment function in wikipedia |
mv material from Interior gateway protocol |
||
Line 10:
The term ''distance vector'' refers to the fact that the protocol manipulates ''vectors'' ([[Array data structure|arrays]]) of distances to other nodes in the network. The distance vector algorithm was the original [[ARPANET]] routing algorithm and was implemented more widely in [[local area networks]] with the [[Routing Information Protocol]] (RIP).
==Overview==
Distance-vector routing protocols use the [[Bellman–Ford algorithm]]. In these protocols, each router does not possess information about the full [[network topology]]. It advertises its distance value (DV) calculated to other routers and receives similar advertisements from other routers unless changes are done in the local network or by neighbours (routers). Using these routing advertisements each router populates its routing table. In the next advertisement cycle, a router advertises updated information from its routing table. This process continues until the routing tables of each router [[Convergence (routing)|converge]] to stable values.
Some of these protocols have the disadvantage of slow convergence.
Examples of distance-vector routing protocols:
* [[Routing Information Protocol]] (RIP)
* [[Routing Information Protocol#RIP version 2|Routing Information Protocol Version 2]] (RIPv2)
* [[Routing Information Protocol#RIPng|Routing Information Protocol Next Generation]] (RIPng), an extension of RIP version 2 with support for [[IPv6]]
* [[Interior Gateway Routing Protocol]] (IGRP)
==Methodology==
| |||