课程设计RIP路由协议的设计与实现

课程设计

课程设计(论文)

RIP路由协议的设计与实现

院（系）名称电子与信息工程学院专业班级

学号

学生姓名

指导教师

起止时间：

课程设计（论文）任务及评语

院（系）：电子与信息工程学院教研室：

摘要

RIP协议是一种内部网管协议（IGP），是一种动态路由选择协议，用于自治系统（AS）内的路由信息的传递。RIP协议基于距离矢量算法（DistanceVectorAlgorithms），使用“跳数”(即metric)来衡量到达目标地址的路由距离。这种协议的路由器只关心自己周围的世界，只与自己相邻的路由器交换信息，范围限制在15跳(15度)之内，再远，它就不关心了。RIP应用于OSI网络七层模型的应用层。各厂家定义的管理距离（AD，即优先级）如下：华为定义的优先级是100，华三定义优先级是100，思科定义的是120。

随着OSPF和IS-IS的出现，许多人认为RIP已经过时了。但事实上RIP也有它自己的优点。对于小型网络，RIP就所占带宽而言开销小，易于配置、管理和实现，并且RIP还在大量使用中。但RIP也有明显的不足，即当有多个网络时会出现环路问题。为了解决环路问题，IETF提出了分割范围方法，即路由器不可以通过它得知路由的接口去宣告路由。分割范围解决了两个路由器之间的路由环路问题，但不能防止3个或多个路由器形成路由环路。触发更新是解决环路问题的另一方法，它要求路由器在链路发生变化时立即传输它的路由表。这加速了网络的聚合，但容易产生广播泛滥。总之，环路问题的解决需要消耗一定的时间和带宽。若采用RIP协议，其网络内部所经过的链路数不能超过15，这使得RIP协议不适于大型网络。

关键词：RIP协议；网络；路由器

Abstract

RIP protocol is an internal gateway protocol (IGP), which is a kind of dynamic routing protocol, which is used to transfer the routing information in the autonomous system (AS). RIP protocol based on distance vector algorithm (DistanceVectorAlgorithms), using the "hop count" (that is, metric) to measure the distance to reach the destination address of the routing distance. This protocol router only cares about the world around them, and their adjacent routers exchange information, the scope of the 15 jump (15 degrees), and then far, it does not care. Application layer of RIP applied to seven layer model of OSI network. Each manufacturer defines the management distance (AD, that is, the priority) is as follows: the priority of HUAWEI definition is 100, the definition of China three priority is 100, CISCO is defined by 120.

With the appearance of OSPF and IS-IS, many people think that RIP is out of date. But in fact RIP also has its own advantages. For small networks, RIP is small, easy to configure, manage, and implement, and RIP is still being used in a large number of uses. But RIP also has obvious shortcomings, that is, when there are multiple networks will appear loop problem. In order to solve the loop problem, IETF proposes a partition method, that is, the router can not know the route through the interface to declare the route. The split range solves the routing loop problem between the two routers, but can not prevent the 3 or more routers from forming a routing loop. Trigger update is another way to solve the loop problem, which requires the router to transmit its routing table when the link is changed. This accelerates the aggregation of the network, but it is prone to broadcast flooding. In short, the solution of the loop problem needs to consume a certain amount of time and bandwidth. If the RIP protocol is adopted, the number of links in the network can not be more than 15, which makes the RIP protocol not suitable for large networks.

Key words：RIP protocol；internal；Router