Consider the following network and assume a link cost change from 1 to 60 as shown in the figure below. - = Before the link cost change, Dy(x) = 3, Dy(z) = 1, Dx( y ) = 3 and Dx(z) = 4. = At the time y detects a link change, it will compute its new distance vector. The traffic from y to z will be routed through x and x routes back to z through y, resulting in a routing loop which will last for some time. This routing loop will persist for: - Y - 60 3 Z 20
a. 16 iterations. O b. 40 iterations. C. 4 iterations. . O d. None of the above. e. 17 iterations.
Consider the following network and assume a link cost change from 1 to 60 as shown in the figure below. - = Before the l
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Consider the following network and assume a link cost change from 1 to 60 as shown in the figure below. - = Before the l
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!