|
| |
| | Routing Information Protocol - Wikipedia, the free encyclopedia |
 | | The routing algorithm used in RIP, the Bellman-Ford algorithm, was first deployed in a computer network in 1969, as the initial routing algorithm of the ARPANET. | | | A version of RIP which supported the Internet Protocol (IP) was later included in the Berkeley Software Distribution (BSD) of the Unix operating system as the routed daemon, and various other vendors would implement their own implementations of the routing protocol. | | | RIPng, defined in RFC 2080, is an extension of the original protocol to support IPv6. |
|
http://en.wikipedia.org/wiki/Routing_Information_Protocol
(514 words)
|
|
| |
| | [No title] |
| | RIP is one of a class of algorithms known as "distance vector algorithms". | | | RIP was designed to work with moderate-size networks using reasonably homogeneous technology. | | | The basic algorithms described in this protocol were used in computer routing as early as 1969 in the ARPANET. |
|
http://www.ietf.org/rfc/rfc1058.txt
(12725 words)
|
|
| |
| | Routing Information Protocol (RIP) |
| | RIP and the myriad RIP-like protocols were based on the same set of algorithms that use distance vectors to mathematically compare routes to identify the best path to any given destination address. | | | RIP can count to 16, but that value is considered an error condition rather than a valid hop count. | | | For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated. |
|
http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/rip.htm
(1596 words)
|
|
| |
| | Routing Information Protocol |
| | This paper has been written as a final project in the course 'Protocols and Computer Networks'. | | | This project is about RIP - Routing Information Protocol; and may be copied freely. | | | The course was given by Dr. Debby Koren in Tel-Aviv University in the spring semester '95. |
|
http://www2.rad.com/networks/1995/rip/content.htm
(65 words)
|
|
|
