Consider the network diagram below using distance vector routing, with the nodes

Question

Consider the network diagram below using distance vector routing, with the nodes a - e being
routers. The table shows the initial routing table for each of the various routers. An additional connection
is added between routers b and e with a cost of 1. List the distance vector updates that will be sent for the
system of routers to reconverge. Only list the distance vector updates, you do not need to list the entire
routing table during each iteration of updates.

(10 pts) Consider the network diagram below using distance vector routing, with the nodes a e being 5 routers. The table shows the initial routing table for each of the various routers. An additional connection is added between routers b and e with a cost of 1. List the distance vector updates that will be sent for the system of routers to reconverge. Only list the distance vector updates, you do not need to list the entire routing table during each iteration of updates. Initial Routing Table: Node (a) ID (b) D (c) D (d) D (e)

Explanation / Answer

As there is new route availabe between b and e in the graph, distances will change for below nodes.

Updated Distances

-----------------------------------------

b to e - 1

e to b - 1

c to e - 8

e to c - 8

Updated Distance Vectors.

-------------------------------------

So for node b, D(e) = 1.

For node c, D(e) = 8.

For node e, D(c) = 8 & D(b) = 1.

-----------------------------------------

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---