# hw4 - A B C D E 4 2 2 1 1 3 2 1 2 1 1 1(2 Consider a...

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

1) Routers in the following network use distance vector routing. When the system is first powered up, a router’s routing table only contains the distance estimates to its neighbors. The distances to non-neighbors are set to infinity. To simplify the discussion, we assume all updates are sent and received at the same time. When two paths having the same distance, the router will randomly select one. (a) Write down the routing tables of all five nodes when the system is powered up. (b) Show the routing tables of all five nodes after 1, 2, 3 table updates.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A B C D E 4 2 2 1 1 3 2 1 2 1 1 1 (2) Consider a network with the following topology. Assume the link metrics of both directions are the same. Unless indicated otherwise, link weights are 1. Use Dijkistra’s shortest path algorithm to find the spanning tree which contains all paths from router A to the rest of the routers in the network. Show the results of the first four steps of the algorithm. A B C D E F H G 3 4 2 2 3...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw4 - A B C D E 4 2 2 1 1 3 2 1 2 1 1 1(2 Consider a...

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

View Full Document
Ask a homework question - tutors are online