1. 路由信息协议(RIP):
RIP 代表路由信息协议,其中距离矢量路由协议用于数据/数据包传输。在路由信息协议 (RIP) 中,最大跳数为 15,因为它可以防止从源到目的地的路由循环。使用水平分割、路由中毒和抑制等机制来防止不正确或错误的路由信息。 Sally Floyd 和 Van Jacobson [1994] 建议,如果计时器没有轻微的随机化,计时器就会同步超时。与其他路由协议相比,RIP(路由信息协议)性能较差且限制规模,即小型网络。使用 RIP 的主要优点是它使用 UDP(用户数据报协议)。
2. 开放最短路径优先(OSPF):
OSPF 代表开放最短路径优先,它使用链路状态路由算法。使用路由器中可用的链路状态信息,它构建拓扑,其中拓扑确定路由决策的路由表。它支持可变长度子网掩码和无类别域间路由寻址模型。由于它使用 Dijkstra 算法,因此它计算每条路线的最短路径树。 OSPF(开放最短路径优先)的主要优点是它自己处理错误检测,并使用多播寻址在广播域中进行路由。
RIP 和 OSPF 的区别
SR.NO | RIP | OSPF |
---|---|---|
1 | RIP Stands for Routing Information Protocol. | OSPF stands for Open Shortest Path First. |
2 | RIP works on Bellman Ford algorithm. | OSPF works on Dijkstra algorithm. |
3 | It is a Distance Vector protocol and it uses the distance or hops count to determine the transmission path. | It is a link state protocol and it analyzes different sources like the speed, cost and path congestion while identifying the shortest path. |
4 | It is basically use for smaller size organization. | It is basically use for larger size organization in the network. |
5 | It allows a maximum of 15 hops. | There is no such restriction on the hop count. |
6 | It is not a more intelligent dynamic routing protocol. | It is a more intelligent routing protocol than RIP. |
7 | The networks are classified as areas and tables here. | The networks are classified as areas, sub areas, autonomous systems and backbone areas here. |
8 | Its administrative distance is 120. | Its administrative distance is 110. |
9 | RIP uses UDP(User Datagram Protocol) Protocol. | OSPF works for IP(Internet Protocol) Protocol. |
10 | It calculates the metric in terms of Hop Count. | It calculates the metric in terms of bandwidth. |