Question

(a) Consider the Distance Vector Routing algorithm in a network of 1000 nodes. Each node has 19 lines to other nodes. If the delay values are between 0 and 249ms, and the delay vectors are exchanged 3 times per second. How much data rate per (full duplex) line is taken by the routing algorithm? (b) Consider Distance Vector Routing for the following three-node network where the link labels indicate the associated links costs and the nodes are marked as x, y, and z. Derive and explain how many iterations are needed to stabilize the cost from z to x, when the cost of link (y,x) changes from 7 to 100. (c) Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z. (d) Recall the count-to-infinity problem in Distance Vector Routing. Propose an approach to solve the count-to-infinity problem, when the delay along a link is considered as the link cost, and the delay is in range [1,3].

          (a) Consider the Distance Vector Routing algorithm in a network of 1000 nodes. Each node has 19 lines to other nodes. If the delay values are between 0 and 249ms, and the delay vectors are exchanged 3 times per second. How much data rate per (full duplex) line is taken by the routing algorithm?

(b) Consider Distance Vector Routing for the following three-node network where the link labels indicate the associated links costs and the nodes are marked as x, y, and z. Derive and explain how many iterations are needed to stabilize the cost from z to x, when the cost of link (y,x) changes from 7 to 100.

(c) Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z.

(d) Recall the count-to-infinity problem in Distance Vector Routing. Propose an approach to solve the count-to-infinity problem, when the delay along a link is considered as the link cost, and the delay is in range [1,3].

(a) Consider the Distance Vector Routing algorithm in a network of 1000 nodes. Each node has 19 lines to other nodes. If the delay values are between 0 and 249ms, and the delay vectors are exchanged 3 times per second. How much data rate per (full duplex) line is taken by the routing algorithm?

(b) Consider Distance Vector Routing for the following three-node network where the link labels indicate the associated links costs and the nodes are marked as x, y, and z. Derive and explain how many iterations are needed to stabilize the cost from z to x, when the cost of link (y,x) changes from 7 to 100.

(c) Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z.

(d) Recall the count-to-infinity problem in Distance Vector Routing. Propose an approach to solve the count-to-infinity problem, when the delay along a link is considered as the link cost, and the delay is in range [1,3].

Added by Glenda P.

Question

Please give Ace some feedback