Consider the network fragment shown below. X W x Y X has only two attached neighbours, W and Y, with link costs as C(X,Y)=50, C(X,W)=2, C(Y,W)=2. • W has a minimum-cost path to destination U (not shown) of 7, and Y has a minimum-cost path to U of 6. The complete paths from W and Y to U are not shown. • All links in the network have strictly positive integer values. The network runs a distance vector routing algorithm (without poisoned reverse). Answer the following questions: A. What is the distance vector of X to destination U, Dx(U)= | to; B. Suppose the link cost between X and Y decreases to 2. In response to the link cost change, the distance vector of X to destination U is updated to: Dx(U) = C. Suppose the link cost between W and X increases to 60 (link (X,Y) still has cost of C(X,Y)=50). Immediately after this cost increase, the distance vector of W to destination X will be updated Dw(X) = Node W will then send routing updates to all its neighbours about this change. After receiving W's routing update, Y will update its distance vector for destination X to: Dy(x) = After the routing protocol converges, the distance vector of W to destination X will be updated to; Dw(X) =

Consider the network fragment shown below. X W x Y X has only two attached neighbours, W and Y, with link costs as C(X,Y)=50, C(X,W)=2, C(Y,W)=2. • W has a minimum-cost path to destination U (not shown) of 7, and Y has a minimum-cost path to U of 6. The complete paths from W and Y to U are not shown. • All links in the network have strictly positive integer values. The network runs a distance vector routing algorithm (without poisoned reverse). Answer the following questions: A. What is the distance vector of X to destination U, Dx(U)= | to; B. Suppose the link cost between X and Y decreases to 2. In response to the link cost change, the distance vector of X to destination U is updated to: Dx(U) = C. Suppose the link cost between W and X increases to 60 (link (X,Y) still has cost of C(X,Y)=50). Immediately after this cost increase, the distance vector of W to destination X will be updated Dw(X) = Node W will then send routing updates to all its neighbours about this change. After receiving W's routing update, Y will update its distance vector for destination X to: Dy(x) = After the routing protocol converges, the distance vector of W to destination X will be updated to; Dw(X) =

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the network fragment shown below. X has only two attached neighbours, W and Y, with link costs as C(X,Y)=50, C(X,W)=8, C(Y,W)=4. W has a minimum-cost path to destination U (not shown) of 20, and Y has a minimum-cost path to U of 30. The complete paths from W and Y to U are not shown. All links in the network have strictly positive integer values. The network runs a distance vector routing algorithm (without poisoned reverse). Answer the following questions: What is the distance vector of X to destination U,DX(U)= ________ Suppose the link cost between X and Y decreases to 2.In response to the link cost change, the distance vector of X to destination U is updated to:DX(U) = _________ Suppose the link cost between W and X increases to 60 (link (X,Y) still has cost of C(X,Y)=50).Immediately after this cost increase, the distance vector of W to destination X will be updated to;DW(X) = __________Node W will then send routing updates to all its neighbours about this…
Look at this network fragment. w and y are x's only neighbors. W's minimum-cost path to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
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
Consider the subnet of Fig. 5-13(a). Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4). The measured delays to B, D, and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the expected delay. В 2 4 3 A D 1 5 6. E 8 (a) Fig. 5-13(a) 3.
Consider the subnet in Fig. 3.11.5. Distance vector routing is used and the following vectors have just come in to router C: from B (5, 0, 8, 12, 6, 2); from D(16, 12, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F D
P7. Examine the network fragment below. w and y are x's only neighbours. W's minimum-cost route to u (not illustrated) is 5, while y's is 6. The pathways from w and y to u and between them are not indicated. All network link costs are positive integers. 2, Give x's distance vector to w, y, and u.
The graph abstruction of a network with a set of routers {s, v, w, x, y, z} is given in figure 1. The link costs are given in the figure. Using Dijkstra's link state algorithm suppose you want to find the shortest path from router 's' to all the other routers. Write the order in which the shortest path is found from router 's' to all the other routers. [The shortest path found in the first iteration should come first in the order and the shortest path found in the last iteration should come last in the order]
The graph abstruction of a network with a set of routers {s, v, w, x, y, z} is given in figure 1. The link costs are given in the figure. Using Dijkstra's link state algorithm suppose you want to find the shortest path from router 's' to all the other routers. Write the order in which the shortest path is found from router 's' to all the other routers. [The shortest path found in the first iteration should come first in the order and the shortest path found in the last iteration should come last in the order] 3 V W 8 9. S 7 6 5.
P7. Consider the network fragment shown below. x has only two attached neighbors, w and y. w has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have strictly positive integer values. a) Give x’s distance vector for destinations w, y, and u. b) Give a link-cost change for either c(x,w) or c(x,y) such that x will inform its neighbors of a new minimum‐cost path to u as a result of executing the distance‐vector algorithm. c) Give a link‐cost change for either c(x,w) or c(x,y) such that x will not inform its neighbors of a new minimum‐cost path to u as a result of executing the distance‐vector algorithm.
P7. Consider the network fragment shown below. x has only two attached neighbors, w and y. W has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have strictly positive integer values. 2, Give x's distance vector for destinations w, y, and u.
12. Consider the network shown below with the current measured delays between two nodes. A B 3 5 8 E F a. List all possible simple paths between C and D; simple paths are those that do not repeat a node (i.e., no loops). b. Which path provides the shortest delay?
8. Consider the 6-node network shown below, with the given link costs. Using Dijkstra's algorithm, find the least cost path from source node U to all other destinations: u 8 9 6 6 V X 9 W 6 D Z a. What is the shortest distance to node w and what node is its predecessor? Write your answer as n,p b. What is the shortest distance to node v and what node is its predecessor? Write your answer as n,p c. What is the shortest distance to node y and what node is its predecessor? Write your answer as n,p