Browse Prior Art Database

Routing Information Protocol (RFC1058) Disclosure Number: IPCOM000001865D
Original Publication Date: 1988-Jun-01
Included in the Prior Art Database: 2000-Sep-12
Document File: 28 page(s) / 86K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

C.L. Hedrick: AUTHOR


This memo describes one protocol in a series of routing protocols based on the Bellman-Ford (or distance vector) algorithm. This algorithm has been used for routing computations in computer networks since the early days of the ARPANET. The particular packet formats and protocol described here are based on the program "routed", which is included with the Berkeley distribution of Unix. It has become a de facto standard for exchange of routing information among gateways and hosts. It is implemented for this purpose by most commercial vendors of IP gateways. Note, however, that many of these vendors have their own protocols which are used among their own gateways.

This text was extracted from a ASCII Text document.
This is the abbreviated version, containing approximately 3% of the total text.

Network Working Group C. Hedrick

Request for Comments: 1058 Rutgers University

June 1988

Routing Information Protocol

Status of this Memo

This RFC describes an existing protocol for exchanging routing

information among gateways and other hosts. It is intended to be

used as a basis for developing gateway software for use in the

Internet community. Distribution of this memo is unlimited.

Table of Contents

1. Introduction 2

1.1. Limitations of the protocol 4

1.2. Organization of this document 4

2. Distance Vector Algorithms 5

2.1. Dealing with changes in topology 11

2.2. Preventing instability 12

2.2.1. Split horizon 14

2.2.2. Triggered updates 15

3. Specifications for the protocol 16

3.1. Message formats 18

3.2. Addressing considerations 20

3.3. Timers 23

3.4. Input processing 24

3.4.1. Request 25

3.4.2. Response 26

3.5. Output Processing 28

3.6. Compatibility 31

4. Control functions 31


This memo is intended to do the following things:

- Document a protocol and algorithms that are currently in

wide use for routing, but which have never been formally


- Specify some improvements in the algorithms which will

improve stability of the routes in large networks. These

improvements do not introduce any incompatibility with

existing implementations. They are to be incorporated into

all implementations of this protocol.

- Suggest some optional features to allow greater

configurability and control. These features were developed

specifically to solve problems that have shown up in actual

use by the NSFnet community. However, they should have more

general utility.

The Routing Information Protocol (RIP) described here is loosely

based on the program "routed", distributed with the 4.3 Berkeley

Software Distribution. However, there are several other

implementations of what is supposed to be the same protocol.

Unfortunately, these various implementations disagree in various