hw6-sols

hw6-sols - CS 118 Spring 2008 Homework 6 Problem 1 Figure 1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 118 Spring 2008 : Homework 6 Problem 1 Figure 1: Simple network. Problem 1 Consider the network shown in Figure 1, and assume that each node initially knows the cost to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries for node z (which includes the cost of z and all of z ’ s neighbors to reach all destinations). From / Cost to u v x y z v 4 0 7 7 5 x 11 7 0 1 2 y 11 7 1 0 3 z 9 5 2 3 0 Problem 2 Consider a general topology and a synchronous version of the distance-vector algorithm. Suppose that at each iteration, a node exchanges its distance vectors with its neighbors and receives their distance vectors. Assuming that the algorithm begins with each node knowing only the costs to its immediate neighbors, what is the maximum number of iterations required since the algorithm is run for first time until it converges? Justify the answer. (hint: it’s related to the ”network diameter”, i.e. the the length of the longest path without loops between any two nodes in the network)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.

Page1 / 2

hw6-sols - CS 118 Spring 2008 Homework 6 Problem 1 Figure 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online