{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Homework6

# Homework6 - all nodes will know the shortest path cost of d...

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

Kevin Deggelman 803 463 734 CS 118 Homework 6 1. B C D A 2 5 1 4 23 B 5 1 8 27 C 1 3 2 11 D 1 2 2 5 10 2. The maximum number of iterations is d-1. At each iteration, a node exchanges distance tables with its neighbors. Thus, if you are node A, and your neighbor is B, all of B's neighbors will know the shortest cost path of one or two hops to you after one iteration. Let d be the “diameter” of the network - the length of the longest path without loops between any two nodes in the network. Using the reasoning above, after d - 1 iterations,
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: all nodes will know the shortest path cost of d or fewer hops to all other nodes. Since any path with greater than d hops will have loops, the algorithm will converge in at most d - 1 iterations. 3. a) eBGP b) iBGP c) eBGP d) iBGP 4. a) Yes, l will be equal to l 1 and l 2 b) No, l will not be equal to l 1 and l 2 c) No, l will not be equal to l 1 and l 2...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online