Knowledge checks


What’s a “good” path?



What is the definition of a “good” path for a routing protocol? Chose the best single answer.




 

That's Correct!

That's Incorrect. Try Again

1/5

Dijkstra’s link-state routing algorithm.



Consider Dijkstra’s link-state routing algorithm that is computing a least-cost path from node a to other nodes b, c, d, e,  f.  Which of the following statements is true.  (Refer to Section 5.2 in the text for notation.)




 

That's Correct!

That's Incorrect. Try Again

2/5

What type of routing?



Match the name of a general approach to routing with characteristics of that approach.



Question List:
Answer List:
  1. An iterative process of computation, exchange of informatoin with neighbors. Routers may initially only know link costs to directly-attached neighbors.

  2. All routers have complete topology, and link cost information.

  3. Routing changes quickly over time.

  4. Routes change slowly over time.


 

That's Correct!

That's Incorrect. Try Again

3/5

Dijkstra’s link-state routing algorithm (Part 1).



Consider the graph shown below and the use of Dijkstra’s algorithm to compute a least cost path from a to all destinations.  Suppose that nodes b and d have already been added to N’. What is the next node to be added to N' (refer to the text for an explanation of notation).

[Note: You can find more examples of problems similar to this here.]




 

That's Correct!

That's Incorrect. Try Again

4/5

Dijkstra’s link-state routing algorithm (Part 2).



Consider the graph shown below and the use of Dijkstra’s algorithm to compute a least cost path from a to all destinations.  Suppose that nodes b and d have already been added to N’. What is the path cost to the next node to be added to N' (refer to the text for an explanation of notation).


[Note: You can find more examples of problems similar to this here.]




 

That's Correct!

That's Incorrect. Try Again

5/5

We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.

Copyright © 2010-2021 J.F. Kurose, K.W. Ross
Comments welcome and appreciated: kurose@cs.umass.edu