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
 Spring '08
 CHU
 Networking, Graph Theory, Shortest path problem, Kevin Deggelman, shortest cost path, shortest path cost, node exchanges distance

Click to edit the document details