EE 281 Lecture Notes - Lecture 11: Complete Graph, Border Gateway Protocol, Regional Internet Registry
Document Summary
A node n"s distance vector is a list of costs from n that each other node in the graph. Each cost is considered to be an estimate as it may be based on incomplete data. Eventually, the algorithm converges and the costs become true least-cost values. In the dv algorithm, a node sends its distance vector to its neighboring nodes. A node also keeps a distance vector table. This is a set of distance vectors that it has received from its neighbors. Initially, a node knows only of its neighbors and the cost to each neighbor. The distance vector is a set of (node, cost) tuples, with the cost being the cost of the direct link to the neighbor. Send a copy of the distance vector to each neighbor. Suppose that a node n receives and saves a distance vector from another node, m. it then does a node-by-node comparison of all the nodes in both vectors.
