This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4050-515 Friday Activity --- Week 5 Consider the simple topology given below. Suppose the destination network is attached to segment E. The cost of reaching E from routers A, B & C are A B C 3B 2D 3B (hop count, next hop) Now the B-D link fails. Complete the following table for successive distance vector table entries for destination E . A B C 3B 2D 3B 3B INF 3B Now use split horizon and complete the table A B C 3B 2D 3B 3B INF 3B Does split horizon help in the "count to infinity" problem? What is the suggested solution? C A B D E ...
View Full Document
This homework help was uploaded on 04/21/2008 for the course VNSA 515 taught by Professor Mishra during the Spring '08 term at RIT.
- Spring '08