![]() ![]() OSPF allows for a logical definition of networks where routers can be divided into areas.This is because routing changes are propagated instantaneously and not periodically. Updates are only sent in case routing changes occur instead of periodically. This ensures less process resource consumption on routers that do not listen to OSPF packets. ![]() OSPF uses IP multicast to send link-state updates.The intelligent use of VLSM is very useful in IP address allocation.With OSPF, there is no limitation on the hop count.OSPF, on the other hand, addresses most of the issues previously presented: RIP2 is not a big improvement over RIP (now called RIP1) because it still has the limitations of hop counts and slow convergence which are essential in large networks. RIP2 addresses the issues of VLSM, authentication, and multicast routing updates. With the introduction of classless routing and the intelligent use of aggregation and summarization, RIP networks have fallen behind.Įnhancements were introduced in a new version of RIP called RIP2. There is no concept of areas or boundaries. The path with the lowest hop count to the destination is always preferred even if the longer path has a better aggregate link bandwidth and less delays. Routing decisions are based on hop counts. RIP has no concept of network delays and link costs. ![]() This is inappropriate in large environments and could cause routing inconsistencies.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |