Answer Happy

From the following statements, select only correct statement(s) about distance vector and link-state routing algorithms. A. The bandwidth required in the link-state routing protocol is more than distance-vector protocol and the link-state requires a global view of the network. B. Since link-state routing algorithms converge slower, they are susceptible to more loops in the network. OC. Open Shortest Path First (OSPF) is the best example of distance-vector algorithm and is widely used in current networks. D. The change in a route state is propagated faster in the network in the case of link-state algorithm whereas the distance-vector is only better in case of a positive change in the network (i.e., the cost of the link becomes better). E. If a link changes in the network from 'better' to 'worse' (or cheaper to expensive), the distance-vector algorithm reacts to this change immediately and the new alternative route (if any) is propagated across the network very fast. OF. Link state converges slower than distance-vector algorithm because of the larger table size of the link-state algorithm.