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!

Searchable, convenient, complete TCP/IP information.
The TCP/IP Guide

Google
Web TCP/IP Guide






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
2
3
Next Page
RIP Route Determination Algorithm and Metric
Next Topic/Section

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

RIP Operational Overview, Advantages and Limitations

On a regular basis, each router in the internetwork sends out its routing table in a special message on each of the networks to which it is connected, using UDP. Other routers receive these tables and use them to update their own tables. This is done by taking each of the routes they receive and adding an extra hop. For example, if router A receives an indication from router B that network N1 is 4 hops away, then since router A and router B are adjacent, the distance from router A to N1 is 5. After a router updates its tables, it in turn sends out this information to other routers on its local networks. Over time, routing distance information for all networks propagates over the entire internetwork.

RIP is straight-forward in operation, easy to implement, and undemanding of router processing power, which makes it attractive especially in smaller autonomous systems. There are, however, some important limitations that arise due to the simplicity of the protocol. For starters, hops are often not the best metric to use in selecting routes. There are also a number of problems that arise with the algorithm itself. These include slow convergence (delays in having all routers agree on the same routing information) and problems dealing with network link failures.

RIP includes several special features to resolve some of these issues, but others are inherent limitations of the protocol. For example, RIP only supports a maximum of 15 hops between destinations, making it unsuitable for very large autonomous systems, and this cannot be changed.

Key Concept: The Routing Information Protocol (RIP) is one of the oldest and most popular interior routing protocols. It uses a distance-vector algorithm with each router maintaining a table indicating how to reach various networks in the autonomous system and the distance to it in hops. RIP is popular because it is well-established and simple, but has a number of important limitations.



Previous Topic/Section
RIP Fundamentals and General Operation
Previous Page
Pages in Current Topic/Section
1
2
3
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.