background image
OSI Layer 3: Routed and Routing Protocols
63
router answers, different paths are taken. After the intermediate steps are
taken, two final actions can occur. If route information is eventually found,
the route is added to the route table and an update is sent. If the responses
from the adjacent routers do not contain any route information, the route is
removed from the topology and route tables. After the route table is updated,
the new information is sent to all adjacent routers via a multicast.
Open Shortest Path First (OSPF)
Open Shortest Path First (OSPF) is a link-state routing protocol. OSPF dif-
fers from IGRP and Enhanced IGRP because it is a pure link-state routing
technology. It is an open standard routing protocol, which means that it was
not developed solely by Cisco. OSPF was designed and developed by the
Internet Engineering Task Force (IETF) to provide a scalable, quickly con-
verging, and efficient routing protocol that could be used by all routing
equipment. Complete details for OSPF are found in RFC2328.
OSPF is an enhancement over RIP that provides a scalable routing solu-
tion. It supports several features that RIP does not--for example, VLSM and
route summarization are supported.
The hop count was eliminated with OSPF, thus giving it limitless reach-
ability. RIP was limited to 16 hops. Because of the algorithm used to calcu-
late and advertise routes, network convergence is fast with OSPF. OSPF is
like EIGRP because it sends route updates only when changes occur in the
network. A formal neighbor relationship is established with all adjacent
OSPF routers.
Areas are used within OSPF to define a group of routers and networks
belonging to the same OSPF session. Links connect routers, and the infor-
mation about each link is defined by its link state. On each broadcast or
multi-access network segment, two routers must be assigned the responsibil-
ities of designated router (DR) and backup designated router (BDR).
Like EIGRP, OSPF maintains three databases: adjacency, topology, and
route. The adjacency database is similar to the neighbor database used by
EIGRP. It contains all information about OSPF neighbors and the links con-
necting them. The topology database maintains all route information. The
best routes from the topology database are placed in the route database or
route table.
Copyright ©2000 SYBEX , Inc., Alameda, CA
www.sybex.com