The routing metric used by RIP counts the number of routers that need to be passed to reach a destination IP network. Ultimately, RIP had been extensively deployed before the standard, written by Charles Hedrick, was passed as RIPv1 in 1988. The 4.2BSD release proved popular and became the basis for subsequent UNIX versions, which implemented RIP in the routed or gated daemon.
RIP DEFINITION SOFTWARE
The 1982 Berkley Software Distribution of the UNIX operating system implemented RIP in the routed daemon. This XNS RIP in turn became the basis for early routing protocols, such as Novell's IPX RIP, AppleTalk's Routing Table Maintenance Protocol (RTMP), and the IP RIP. As part of the Xerox Network Systems (XNS) protocol suite GWINFO transformed into the XNS Routing Information Protocol. The predecessor of RIP was the Gateway Information Protocol (GWINFO) which was developed by Xerox in the mid-1970s to route its experimental network. 1 Development of distance-vector routingĭevelopment of distance-vector routing īased on the Bellman–Ford algorithm and the Ford–Fulkerson algorithm, distance-vector routing protocols started to be implemented from 1969 onwards in data networks such as the ARPANET and CYCLADES.RIP uses the User Datagram Protocol (UDP) as its transport protocol, and is assigned the reserved port number 520.
However, it is easy to configure, because RIP does not require any parameters, unlike other protocols. In most networking environments, RIP is not the preferred choice of routing protocol, as its time to converge and scalability are poor compared to EIGRP, OSPF, or IS-IS. As networks grew in size, however, it became evident there could be a massive traffic burst every 30 seconds, even if the routers had been initialized at random times. In the early deployments, routing tables were small enough that the traffic was not significant. In RIPv1 routers broadcast updates with their routing table every 30 seconds. RIP implements the split horizon, route poisoning, and holddown mechanisms to prevent incorrect routing information from being propagated. The largest number of hops allowed for RIP is 15, which limits the size of networks that RIP can support. RIP prevents routing loops by implementing a limit on the number of hops allowed in a path from source to destination. The Routing Information Protocol ( RIP) is one of the oldest distance-vector routing protocols which employs the hop count as a routing metric.
0 kommentar(er)
