ExtremeWare XOS 11.3 Concepts Guide
531
25 RIP
This chapter describes the following topics:
â—Ź Overview on page 531
â—Ź Overview of RIP on page 532
â—Ź Route Redistribution on page 533
â—Ź RIP Configuration Example on page 535
This chapter assumes that you are already familiar with IP unicast routing. If not, refer to the following
publications for additional information:
● RFC 1058—Routing Information Protocol (RIP)
● RFC 1723—RIP Version 2
â—Ź Interconnections: Bridges and Routers
by Radia Perlman
ISBN 0-201-56332-0
Published by Addison-Wesley Publishing Company
Overview
The switch supports the use of two interior gateway protocols (IGPs); the Routing Information Protocol
(RIP), and the Open Shortest Path First (OSPF) protocol.
RIP is a distance-vector protocol, based on the Bellman-Ford (or distance-vector) algorithm. The
distance-vector algorithm has been in use for many years and is widely deployed and understood.
OSPF is a link-state protocol, based on the Dijkstra link-state algorithm. OSPF is a newer IGP and solves
a number of problems associated with using RIP on today’s complex networks.
NOTE
RIP and OSPF can be enabled on a single VLAN.
RIP is described in this chapter, and OSPF is described in Chapter 27, “OSPF” on page 543.
RIP Versus OSPF
The distinction between RIP and OSPF lies in the fundamental differences between distance-vector
protocols and link-state protocols. Using a distance-vector protocol, each router creates a unique routing
table from summarized information obtained from neighboring routers. Using a link-state protocol,
every router maintains an identical routing table created from information obtained from all routers in
the autonomous system (AS). Each router builds a shortest path tree, using itself as the root. The link-
state protocol ensures that updates sent to neighboring routers are acknowledged by the neighbors,
verifying that all routers have a consistent network map.
To Next Page
Loading...
Need help?
General
