Summary of the main steps Node X receives Distance Vectors (DVs) from its neighbors Node X recalculates its routing table - Note: the routing table includes all the destinations, and for each destination the best cost and next hop 1. Put X as the source 2. Put the neighbors of X 3. Put the cost from X to each of his neighbors. Get these values from X table 4. For each destination Y : a) Add Y to the figure b) Add the cost from each neighbor - get each value from the table appropriate neighbor c) Calculate the cost from X to Y, going via each neighbor (di=d1+d2) d) Chose the minimum of the calculated costs, and use it as the cost from X to Y in the routing table of X(cost(X,Y)=min{di})