HW2 - both A and C see that the change of the link (A, C)s...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE824 Homework 2 Due: Nov.14, 2008 1. Consider the network right. Assume that the network implements the Distance Vector routing protocol: (a) Write down the routing table of each node, (b) Assume the cost of the link between nodes A and C decreases from 7 to 1. Write down the routing table of each node at every step until routing table converges. Assume that
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: both A and C see that the change of the link (A, C)s cost at the same time and that exchanges of routing information and routing table updates are synchronous (i.e., they happen at the same time at all nodes). 2. Problem P36 in Textbook Chapter 4, P.428. 3. Problem P3 in Textbook Chapter 5, P.503....
View Full Document

This note was uploaded on 10/27/2009 for the course CSE 824 taught by Professor Xiao during the Fall '08 term at Michigan State University.

Ask a homework question - tutors are online