COMPUTER NETWORKS
CONE Lab - Network - Numerical exercises
Problem
7 (Ch. 4 of Computer Networking by J.F. Kurose and K.W.
Ross)
Consider the network fragment shown below. X has only
two attached neighbors, W and Y. W has a minimum cost path to destination
A of cost 5 and Y has a minimum cost path to A of 6. The complete paths
from W and Y to A (and between W and Y) are not shown. All link costs
in the network have strictly positive integer values.
a) Give X's
distance table (row) entries for destinations X, Y and A.
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 A as a result of executing
lines 15 and 24 of 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 A as a result of
executing lines 15 and 24 of the distance vector algorithm.
Problem
8 (Ch. 4 of Computer Networking, 2nd ed. by J.F. Kurose
and K.W. Ross)
Compute the
distance tables for X, Y and Z shown in rightmost column of Figure 4.7.
After the computation of the new distance tables, which nodes will send
which updated values to which neighbors?