Chapter 5
Exercises
Ion Turcanu: [email protected]
Note: the slides used in this course are adapted from the original slides
Computer Networking: A
created by Jim Kurose and Keith Rose:
https://gaia.cs.umass.edu/kurose_ross/ppt.htm
Top-Down Approach
7th edition
All material copyright 1996-2020 Jim Kurose, Keith Ross
J.F Kurose and K.W. Ross, All Rights Reserved Pearson/Addison Wesley, 2016
Introduction: 1-1
Exercise 1 – Dijkstra's Link State Algorithm
Consider the 6-node network shown below, with the given link costs. 11101000
Consider the completed table below, which calculates the shortest distance to all nodes from Y: and 11011011 00100100
= 11000011 10001111
Introduction: 1-2
Exercise 1 – Dijkstra's Link State Algorithm (1/2)
For link X, what is the cost associated with this link? If the
answer can't be determined given the information,
respond with 'n/a’10000
The prior node in the path to W is Y, and we know the shortest distance of both W (5) and Y (0).
So, 5 - 0 = 5 which is X.
Introduction: 1-3
Exercise 1 – Dijkstra's Link State Algorithm (2/2)
For link Y, what is the cost associated with this link? If the
answer can't be determined given the information,
respond with 'n/a'
Because the link is never used, we cannot determine the value of Y, so the answer is n/a.
Introduction: 1-4
Exercise 2 – Dijkstra's Link State Algorithm (1/3)
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 and answer the following
questions
What is the shortest distance to node w and what node
is its predecessor? Write your answer as n,p
The minimum distance from node u to node w is 6, and
node w's predecessor is node u.
The full answer was: 6,u
Introduction: 1-5
Exercise 2 – Dijkstra's Link State Algorithm (2/3)
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 and answer the following
questions
What is the shortest distance to node x and what node
is its predecessor? Write your answer as n,p
The minimum distance from node u to node x is 3, and
node x's predecessor is node u. The full answer was: 3,u
Introduction: 1-6
Exercise 2 – Dijkstra's Link State Algorithm (3/3)
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 and answer the following
questions
What is the shortest distance to node z and what node
is its predecessor? Write your answer as n,p
The minimum distance from node u to node z is 8, and
node z's predecessor is node w. The full answer was: 8,w
Introduction: 1-7
Exercise 1 – Bellman Ford Distance Vector Algorithm
Consider the 6-node network shown below, with the given link costs:
When the algorithm converges, what are the distance vectors from router 'X' to all routers?
Write your answer as u,v,w,x,y:
When the algorithm converges, router X has distance
vectors (u,v,w,x,y) = (11,9,4,0,3)
Introduction: 1-8
Exercise 1 – Bellman Ford Distance Vector Algorithm
Consider the 6-node network shown below, with the given link costs:
What are the initial distance vectors for router 'V'? Write your answer as u,v,w,x,y and
if a distance is ∞, write 'x'
The initial distance vectors of router V are: (u,v,w,x,y)
= (3,0,4,9,x) where x is ∞
Introduction: 1-9
Exercise 1 – Bellman Ford Distance Vector Algorithm
Consider the 6-node network shown below, with the given link costs:
The phrase 'Good news travels fast' is very applicable to distance vector routing when
link costs decrease; what is the name of the problem that can occur when link costs
increase?
It is called the 'Count to Infinity' problem.
Introduction: 1-10
