hw2 - 1, and the cost from B to C equal to 2. Suppose the...

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

View Full Document Right Arrow Icon
CS 168 Computer Networks Jannotti Homework 2 Due: 13 March 2010, 4pm Problem 1 Section 4, problems 22, 26, 32 and 43. Problem 2 Section 5, problems 2, 6, 21, and 29. Problem 3 If LSA’s can be localized to a speciFc area, and the backbone only needs to know about a few advertisements (1 per group), then why doesn’t BGP do this? What is the motivation for path-vector routing? Problem 4 Consider the simplest three-router network: a straight line. There are three routers, A, B, and C. A is connected to B, and B is connected to C. A distance vector protocol is being used, with the cost from A to B equal to
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1, and the cost from B to C equal to 2. Suppose the link from B to C fails. a. Give a sequence of routing table updates that would lead to a routing loop. b. Estimate the probability of the loop assuming updates are sent every 60 seconds (starting from whatever moment the router happens to be brought up). c. Now estimate the probability if, in addition to the above, routers send updates within 1 second if a link they are connected to goes down. d. Now estimate the probability if split horizon is used....
View Full Document

This note was uploaded on 12/03/2010 for the course CS 168 taught by Professor Jj during the Spring '10 term at Brown.

Ask a homework question - tutors are online