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 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) = __________note: enter integer numbers only

Distance vector routing algorithm: It is known as dynamic algorithm. This algorithm is mainly used…

Answered: Consider the network fragment shown…

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

Related questions

Concept explainers

Question

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,
D_X(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:
D_X(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;
D_W(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:
D_Y(X) = .__________
After the routing protocol converges, the distance vector of W to destination X will be updated to;
D_W(X) = __________

note: enter integer numbers only

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions