Please Whitelist This Site?

I know everyone hates ads. But please understand that I am providing premium content for free that takes hundreds of hours of time to research and write. I don't want to go to a pay-only model like some sites, but when more and more people block ads, I end up working for free. And I have a family to support, just like you. :)

If you like The TCP/IP Guide, please consider the download version. It's priced very economically and you can read all of it in a convenient format without ads.

If you want to use this site for free, I'd be grateful if you could add the site to the whitelist for Adblock. To do so, just open the Adblock menu and select "Disable on tcpipguide.com". Or go to the Tools menu and select "Adblock Plus Preferences...". Then click "Add Filter..." at the bottom, and add this string: "@@||tcpipguide.com^$document". Then just click OK.

Thanks for your understanding!

Sincerely, Charles Kozierok
Author and Publisher, The TCP/IP Guide


NOTE: Using software to mass-download the site degrades the server and is prohibited.
If you want to read The TCP/IP Guide offline, please consider licensing it. Thank you.

The Book is Here... and Now On Sale!

Get The TCP/IP Guide for your own computer.
The TCP/IP Guide

Custom Search







Table Of Contents  The TCP/IP Guide
 9  TCP/IP Lower-Layer (Interface, Internet and Transport) Protocols (OSI Layers 2, 3 and 4)
      9  TCP/IP Internet Layer (OSI Network Layer) Protocols
           9  TCP/IP Routing Protocols (Gateway Protocols)
                9  TCP/IP Interior Routing Protocols (RIP, OSPF, GGP, HELLO, IGRP, EIGRP)
                     9  TCP/IP Routing Information Protocol (RIP, RIP-2 and RIPng)
                          9  RIP Fundamentals and General Operation

Previous Topic/Section
RIP Fundamentals and General Operation
Previous Page
Pages in Current Topic/Section
1
23
Next Page
RIP Route Determination Algorithm and Metric
Next Topic/Section

RIP Overview, History, Standards and Versions
(Page 1 of 3)

The Routing Information Protocol (RIP) has been the most popular interior routing protocol in the TCP/IP suite for many years. The history of the protocol and how it came to achieve prominence is a rather interesting one. Unlike many of the other important protocols in the TCP/IP suite, RIP was not first developed formally using the RFC standardization process. Rather, it evolved as a de facto industry standard and only became an Internet standard later on.

Early History of RIP

The history of RIP shares some commonality with that of another networking heavyweight: Ethernet. Like the formidable LAN technology, RIP's roots go back to that computing pioneer, Xerox's Palo Alto Research Center (PARC). At the same time that Ethernet was being developed for tying together local area networks, PARC created a higher layer protocol to run on Ethernet called the Xerox PARC Universal Protocol (PUP). PUP required a routing protocol, so Xerox created a protocol called the Gateway Information Protocol (GWINFO). This was later renamed the Routing Information Protocol and used as part of the Xerox Network System (XNS) protocol suite.

RIP entered the mainstream when developers at the University of California at Berkeley adapted it for use in the Berkeley Standard Distribution (BSD) of the UNIX operating system. RIP first appeared in BSD version 4.2 in 1982, where it was implemented as the UNIX program routed (pronounced “route-dee”, not “rout-ed”—the “d” stands for daemon, a common UNIX term for a server process.)

BSD was (and still is) a very popular operating system, especially for machines connected to the early Internet. As a result, RIP was widely deployed and became the industry standard for internal routing protocols. It was used both for TCP/IP and also other protocol suites. In fact, a number of other routing protocols, such as the RTP protocol in the AppleTalk suite, were based on this early version of RIP.

RIP Standardization

For a while, the BSD implementation of routed was actually considered the standard for the protocol itself. However, this was not a formally defined standard, and this meant there was no formal definition of how exactly it functioned. This lead to slight differences in various implementations of the protocol over time. To resolve potential interoperability issues between implementations, the IETF formally specified RIP in the Internet standard RFC 1058, Routing Information Protocol, published in June 1988. This RFC was based directly on the BSD routed program. This original version of RIP is now also sometimes called RIP version 1 or RIP-1 to differentiate it from later versions.

RIP's popularity was due in large part to its inclusion in BSD; this was in turn a result of the relative simplicity of the protocol. RIP uses the distance-vector algorithm (also called the Bellman-Ford algorithm after two of its inventors) to determine routes. Each router maintains a routing table containing entries for various networks or hosts in the internetwork. Each entry contains two primary pieces of information: the address of the network or host, and the distance to it, measured in hops, which is simply the number of routers that a datagram must pass through to get to its destination.


Previous Topic/Section
RIP Fundamentals and General Operation
Previous Page
Pages in Current Topic/Section
1
23
Next Page
RIP Route Determination Algorithm and Metric
Next Topic/Section

If you find The TCP/IP Guide useful, please consider making a small Paypal donation to help the site, using one of the buttons below. You can also donate a custom amount using the far right button (not less than $1 please, or PayPal gets most/all of your money!) In lieu of a larger donation, you may wish to consider purchasing a download license of The TCP/IP Guide. Thanks for your support!
Donate $2
Donate $5
Donate $10
Donate $20
Donate $30
Donate: $



Home - Table Of Contents - Contact Us

The TCP/IP Guide (http://www.TCPIPGuide.com)
Version 3.0 - Version Date: September 20, 2005

© Copyright 2001-2005 Charles M. Kozierok. All Rights Reserved.
Not responsible for any loss resulting from the use of this site.