EIGRP

Routing Protocols and Concepts

Objectives
Describe the background and history of
Enhanced Interior Gateway Routing Protocol
(EIGRP).
Examine the basic EIGRP configuration
commands and identify their purposes.
Calculate the composite metric used by
EIGRP.
Describe the concepts and operation of DUAL.
Describe the uses of additional configuration
commands in EIGRP.

Introduction

EIGRP
Roots of EIGRP: IGRP
-Developed in 1985 to overcome
RIPv1s limited hop count
-Distance vector routing protocol
-Metrics used by IGRP
bandwidth (used by default)
Delay (used by default)
reliability
load

-Discontinued support starting

with IOS 12.2(13)T & 12.2(R1s4)S

EIGRP
EIGRP Message Format
EIGRP Header
Data link frame header - contains source and destination
MAC address
IP packet header - contains source & destination IP address
EIGRP packet header - contains AS number
Type/Length/Field - data portion of EIGRP message

EIGRP
EIGRP packet header
contains
Opcode field
Autonomous System
number

EIGRP Parameters
contains
Weights
Hold time

EIGRP

TLV: IP internal contains

Metric field
Subnet mask field
Destination field

TLV: IP external contains

Fields used when external
routes are imported into
EIGRP routing process

EIGRP
Protocol Dependent
Modules (PDM)
EIGRP uses PDM to route
several different protocols i.e.
IP, IPX & AppleTalk
PDMs are responsible for the
specific routing task for each
network layer protocol

EIGRP
Reliable Transport
Protocol (RTP)

Purpose of RTP
Used by EIGRP to transmit and receive
EIGRP packets

Characteristics of RTP
Involves both reliable & unreliable delivery
of EIGRP packet
Reliable delivery requires
acknowledgment from destination
Unreliable delivery does not require an
acknowledgement from destination
Packets can be sent
Unicast
Multicast
Using address 224.0.0.10

EIGRP
EIGRPs 5 Packet Types
Hello packets
Used to discover & form adjacencies with
neighbors

EIGRP
Update packets
Used to propagate
routing information

Acknowledgement
packets
Used to acknowledge
receipt of update,
query & reply packets

EIGRP
Query & Reply
packets
Used by DUAL for
searching for networks
Query packets
-Can use
Unicast
Multicast

Reply packet
-Use only
unicast

EIGRP
Purpose of Hello Protocol
To discover & establish adjacencies with
neighbor routers

Characteristics of hello protocol

Time interval for sending hello packet

Most networks it is every 5 seconds

-Holdtime
Multipoint non broadcast multi-access networks
Unicast
This
every 60 seconds
is the maximum
time
router should wait before
declaring a neighbor down
Default holdtime
3 times hello interval

EIGRP
EIGRP Bounded Updates
EIGRP only sends update when there is a change
in route status
Partial update
A partial update includes only the route information
that has changed the whole routing table is NOT sent

Bounded update
When a route changes, only those devices that are
impacted will be notified of the change

EIGRPs use of partial bounded updates

minimizes use of bandwidth

EIGRP
Diffusing Update Algorithm (DUAL)
Purpose
EIGRPs primary method for preventing routing
loops

Advantage of using DUAL

Provides for fast convergence time by keeping a
list of loop-free backup routes

EIGRP
Administrative Distance (AD)
Defined as the trustworthiness of the
source route

EIGRP default administrative distances

Summary routes = 5
Internal routes = 90
Imported routes = 170

EIGRP
Authentication
EIGRP can
Encrypt routing information
Authenticate routing information

EIGRP
Network Topology
Topology used is the same as previous
chapters with the addition of an ISP
router

EIGRP
EIGRP will
automatically
summarize routes
at classful
boundaries

Basic EIGRP Configuration

Autonomous System (AS) & Process IDs
This is a collection of networks under the
control of a single authority (reference RFC
1930)
AS Numbers are assigned by IANA
Entities needing AS numbers
ISP
Internet Backbone prodiers
Institutions connecting to other institutions using
AS numbers

Basic EIGRP Configuration

EIGRP autonomous
system number
actually functions as
a process ID
Process ID
represents an
instance of the
routing protocol
running on a router
Example
Router(config)#router

Basic EIGRP Configuration

The router eigrp command
The global command that enables eigrp
is
router eigrp autonomous-system
-All routers in the EIGRP routing domain must use
the same process ID number (autonomous-

system number)

Basic EIGRP Configuration

The Network Command
Functions of the network
command
Enables interfaces to transmit &
receive EIGRP updates
Includes network or subnet in
EIGRP updates

Example
Router(config-router)#network
network-address

Basic EIGRP Configuration

The network Command with a Wildcard Mask
-This option is used when you want to configure EIGRP to
advertise specific subnets
-Example
Router(config-router)#network network-address

[wildcard-mask]

Basic EIGRP Configuration

Verifying EIGRP
EIGRP routers must establish
adjacencies with their neighbors before
any updates can be sent or received
Command used to view neighbor table
and verify that EIGRP has established
adjacencies with neighbors is
show ip eigrp neighbors

EIGRP
The show ip
protocols command
is also used to verify
that EIGRP is
enabled

Basic EIGRP Configuration

Examining the
Routing Table

The show ip route

command is also used to
verify EIGRP
EIGRP routes are denoted
in a routing table by the
letter D
By default , EIGRP
automatically summarizes
routes at major network
boundary

Basic EIGRP Configuration

Introducing the Null0 Summary Route
Null0 is not a physical interface
In the routing table summary routes are sourced
from Null0
Reason: routes are used for advertisement purposes

EIGRP will automatically include a null0 summary

route as child route when 2 conditions are met
At least one subnet is learned via EIGRP
Automatic summarization is enabled

Basic EIGRP Configuration

R3s routing table
shows that the
172.16.0.0/16
network is
automatically
summarized by
R1 & R3

EIGRP Metric Calculation

EIGRP Composite Metric & the K
Values
EIGRP uses the following values in its
composite metric
-Bandwidth, delay, reliability, and load

The composite metric used by EIGRP

formula used has values K1 K5
K1 & K3
=1
all other K values = 0

EIGRP Metric Calculation

Use the sh ip protocols command to
verify the K values

EIGRP Metric Calculation

EIGRP Metrics
Use the show
interfaces
command to
view metrics
EIGRP Metrics
Bandwidth
EIGRP uses a
static bandwidth
to calculate
metric

EIGRP Metric Calculation

EIGRP Metrics
Delay is the defined as the measure of
time it takes for a packet to traverse a
route
-it is a static value based on link type to which
interface is connected

EIGRP Metric Calculation

Reliability (not a default EIGRP metric)
-A measure of the likelihood that a link will
fail
-Measure dynamically & expressed as a
fraction of 255
the higher the fraction the better the
reliability

Load (not a default EIGRP metric)

A number that reflects how much traffic is
using a link
Number is determined dynamically and is
expressed as a fraction of 255
The lower the fraction the less the load on the

EIGRP Metric Calculation

Using the Bandwidth Command
Modifying the interface bandwidth
-Use the bandwidth command
-Example
Router(config-if)#bandwidth kilobits

Verifying bandwidth
Use the show interface command

Note bandwidth command

does not change the
links physical
bandwidth

EIGRP Metric Calculation

The EIGRP metric can be determined by
examining the
bandwidth delay

EIGRP Metric Calculation

EIGRP uses the lowest bandwidth (BW)in its
metric calculation
Calculated BW = reference BW / lowest
BW(kbps)
Delay EIGRP uses the cumulative sum of
all outgoing interfaces
Calculated Delay = the sum of outgoing interface
delays

EIGRP Metric = calculated BW + calculated

delay

EIGRP Metric Calculation

DUAL Concepts
The Diffusing Update Algorithm (DUAL) is
used to prevent looping

DUAL Concepts
Successor
The best least
cost route to a
destination found in
the routing table

Feasible
distance
The lowest
calculated metric
along a path to a
destination network

DUAL Concepts
Feasible Successors, Feasibility Condition & Reported
Distance
Feasible Successor

-This is a loop
free backup
route to same
destination as
successor
route

DUAL Concepts
Feasible Successors, Feasibility Condition & Reported Distance

Reported
distance (RD)
-The metric that
a router reports to
a neighbor about
its own cost to
that network

DUAL Concepts
Feasibility
Condition
(FC)
-Met when a
neighbors RD
is less than the
local routers
FD to the same
destination
network

DUAL Concepts
Topology Table:
Successor & Feasible
Successor
EIGRP Topology table
Viewed using the show
ip eigrp topology
command
Contents of table include:

all successor routes

all feasible successor
routes

DUAL Concepts
EIGRP
Topology
Table
dissected

DUAL Concepts
Topology Table:
No Feasible
Successor
A feasible successor may
not be present because
the feasibility condition
may not be met
-In other words, the
reported distance of
the neighbor is
greater than or equal
to the current feasible
distance

DUAL Concepts
Finite Sate Machine (FSM)
An abstract machine that defines a set of possible
states something can go through, what event
causes those states and what events result form
those states
FSMs are used to describe how a device,
computer program, or routing algorithm will react to
a set of input events

DUAL Concepts
DUAL FSM
Selects a best
loop-free path to a
destination
Selects alternate
routes by using
information in
EIGRP tables

DUAL Concepts
Finite State Machines (FSM)
To examine output from EIGRPs finite
state machine us the debug eigrp fsm
command

More EIGRP Configurations

The Null0 Summary Route
By default, EIGRP uses the Null0 interface to
discard any packets that match the parent
route but do not match any of the child routes
EIGRP automatically includes a null0
summary route as a child route whenever
both of the following conditions exist
One or subnets exists that was learned via EIGRP
Automatic summarization is enabled

More EIGRP Configurations

The Null0 Summary Route

More EIGRP Configurations

Disabling Automatic Summarization
The auto-summary command permits
EIGRP to automatically summarize at major
network boundaries
The no auto-summary command is used
to disable automatic summarization
This causes all EIGRP neighbors to send updates that
will not be automatically summarized
this will cause changes to appear in both
-routing tables
-topology tables

More EIGRP Configurations

Manual Summarization
Manual summarization can include
supernets
Reason: EIGRP is a classless routing
protocol & include subnet mask in update

Command used to configure manual

summarization
Router(config-if)#ip summary-address eigrp
as-number network-address subnet-mask

More EIGRP Configurations

Configuring a summary route in EIGRP

More EIGRP Configurations

EIGRP Default Routes
quad zero static default route
-Can be used with any currently supported routing
protocol
-Is usually configured on a router that is connected
a network outside the EIGRP domain

EIGRP & the Quad zero static default

route
Requires the use of the redistribute static
command to disseminate default route in EIGRP
updates

More EIGRP Configurations

Fine-Tuning EIGRP
EIGRP bandwidth utilization
-By default, EIGRP uses only up to 50% of
interface bandwidth for EIGRP information
-The command to change the percentage
of bandwidth used by EIGRP is

Router(config-if)#ip bandwidth-percent
eigrp asnumber percent

More EIGRP Configurations

Configuring Hello Intervals and Hold Times
-Hello intervals and hold times are
configurable on a per-interface basis
-The command to configure hello interval is

Router(config-if)#ip hello-interval eigrp asnumber seconds

Changing the hello interval also requires

changing the hold time to a value greater
than or equal to the hello interval
-The command to configure hold time value is
Router(config-if)#ip hold-time eigrp asnumber seconds

Summary
Background & History
EIGRP is a derivative of IGRP
EIGRP is a Cisco proprietary distance vector
routing protocol released in 1994

EIGRP terms and characteristics

EIGPR uses RTP to transmit & receive
EIGRP packets
EIGRP has 5 packet type:
Hello packets
Update packets
Acknowledgement packets
Query packets

Summary
EIGRP terms and characteristics
EIGRP uses a hello protocol
Purpose of hello protocol is to discover & establish
adjacencies
EIGRP routing updates
Aperiodic
Partial and bounded
Fast convergence

Summary
EIGRP commands
The following commands are used for EIGRP
configuration
RtrA(config)#router eigrp [autonomous-system #]
RtrA(config-router)#network network-number
The following commands can be used to verify EIGRP
Show ip protocols
Show ip eigrp neighbors
Show ip route

Summary
EIGRP metrics include
Bandwidth (default)
Delay (default)
Reliability
Load

Summary
DUAL
Purpose of DUAL
To prevent routing loops
Successor
Primary route to a destination
Feasible successor
Backup route to a destination
Feasible distance
Lowest calculated metric to a destination
Reported distance
The distance towards a destination as advertised
by an upstream neighbor

Summary
Choosing the best route
After router has received all updates from directly
connected neighbors, it can calculate its DUAL
1st metric is calculated for each route
2nd route with lowest metric is designated
successor & is placed in routing table
3rd feasible successor is found
Criteria for feasible successor: it must have
lower reported distance to the destination
than the installed routes feasible distance
Feasible routes are maintained in topology
table

Summary
Automatic summarization
On by default
Summarizes routes on classful boundary
Summarization can be disabled using the following
command
RtrA(config-if)#no auto-summary

Link-State Routing Protocols

Routing Protocols and Concepts

Objectives
Describe the basic features & concepts
of link-state routing protocols.
List the benefits and requirements of
link-state routing protocols.

Introduction

Link-State Routing
Link state routing protocols
-Also known as shortest path first algorithms

-These protocols built around

Dijkstras
SPF

Link-State Routing
Dikjstras algorithm also known as the
shortest path first (SPF) algorithm

Link-State Routing
The shortest path to a destination is not
necessarily the path with the least
number of hops

Link-State Routing
Link-State Routing Process
How routers using Link State Routing Protocols reach
convergence

-Each routers learns about its own directly connected

networks
-Link state routers exchange hello packet to meet other
directly
connected link state routers.
-Each router builds its own Link State Packet (LSP) which
includes information about neighbors such as neighbor ID,
link type, & bandwidth.
-After the LSP is created the router floods it to all neighbors
who then store the information and then forward it until all
routers have the same information.
-Once all the routers have received all the LSPs, the routers
then construct a topological map of the network which is used
to determine the best routes to a destination

Link-State Routing
Directly Connected
Networks
Link
This is an interface on a
router
Link state
This is the information
about the state of the
links

Link-State Routing
Sending Hello Packets to Neighbors
Link state routing protocols use a hello
protocol
Purpose of a hello protocol:
-To discover neighbors (that use the
same
link state routing protocol) on
its link

Link-State Routing
Sending Hello Packets to
Neighbors
Connected interfaces that are using
the same link state routing protocols
will exchange hello packets.
Once routers learn it has neighbors
they form an adjacency
-2 adjacent neighbors will
exchange hello packets
-These packets will serve as a
keep alive function

Link-State Routing
Building the Link State Packet
Each router builds its own
Link State Packet (LSP)
Contents of LSP:
-State of each directly
connected link
-Includes information
about neighbors such as
neighbor ID, link type, &
bandwidth.

Link-State Routing
Flooding LSPs to Neighbors
Once LSP are created they are
forwarded out to neighbors.
-After receiving the LSP the neighbor continues to
forward it throughout routing area.

Link-State Routing
LSPs are sent out under the following
conditions
-Initial router start up or routing
process
-When there is a change in topology

Link-State Routing
Constructing a link state data base
Routers use a database to construct a
topology map of the network

Link-State Routing

Link-State Routing
Shortest Path First (SPF) Tree
Building a portion of the SPF tree
Process begins by examining R2s LSP
information
-R1 ignores 1st LSP
Reason: R1 already knows its
connected to R2

Link-State Routing
Building a portion of the SPF tree
-R1 uses 2nd LSP
Reason: R1 can create a link from R2 to R5.
is added to R1s SPF tree

This information

Link-State Routing
Building a portion of the SPF tree
-R1 uses 3rd LSP
Reason: R1 learns that R2 is connected to
10.5.0.0/16.
This link is added to R1s SPF tree.

Link-State Routing
Determining the shortest path
The shortest path to a destination
determined by adding the costs & finding
the lowest cost

Link-State Routing
Once the SPF algorithm has determined
the shortest path routes, these routes
are placed in the routing table.

Link-State Routing Protocols

Advantages of a Link-State Routing Protocol

Routing
protocol

Builds
Topological
map

Router can
independently
determine the
shortest path to
every network.

Convergence

A periodic/
event driven
routing updates

Use
of
LSP

Distance
vector

No

No

Slow

Generally No

No

Link State

Yes

Yes

Fast

Generally Yes

Yes

Link-State Routing Protocols

Requirements for using a link state routing
protocol
Memory requirements
Typically link state routing protocols use
more memory
Processing Requirements
More CPU processing is required of link
state routing protocols
Bandwidth Requirements
Initial startup of link state routing protocols
can consume lots of bandwidth

Link-State Routing Protocols

2 link state routing protocols used for
routing IP
-Open Shortest Path First (OSPF)
-Intermediate System-Intermediate
System (IS-IS)

Summary
Link State Routing protocols are also
known as Shortest Path First protocols
Summarizing the link state process
-Routers 1ST learn of directly connected networks
-Routers then say hello to neighbors
-Routers then build link state packets
-Routers then flood LSPs to all neighbors
-Routers use LSP database to build a network topology
map & calculate the best path to each destination

Summary
Link
An interface on the router
Link State
Information about an interface such as
-IP address
-Subnet mask
-Type of network
-Cost associated with link
-Neighboring routers on the link

Summary
Link State Packets
After initial flooding, additional LSP are
sent out when a change in topology
occurs
Examples of link state routing protocols
-Open shortest path first
-IS-IS

OSPF

Objectives
Describe the background and basic features
of OSPF
Identify and apply the basic OSPF
configuration commands
Describe, modify and calculate the metric
used by OSPF
Describe the Designated Router/Backup
Designated Router (DR/BDR) election process
in multiaccess networks
Describe the uses of additional configuration
commands in OSPF

Introduction

Introduction to OSPF
Background of OSPF
Began in 1987
1989 OSPFv1 released in RFC 1131
This version was experimental & never
deployed
1991 OSPFv2 released in RFC 1247
1998 OSPFv2 updated in RFC 2328
1999 OSPFv3 published in RFC 2740

Introduction to OSPF
OSPF Message
Encapsulation
OSPF packet type
There exist 5 types
OSPF packet header
Contains - Router ID and
area ID and Type code
for OSPF packet type
IP packet header
Contains - Source IP
address, Destination IP
address, & Protocol field set to
89

Introduction to OSPF
OSPF Message Encapsulation
Data link frame header
Contains - Source MAC address and
Destination
MAC address

Introduction to OSPF
OSPF Packet Types

Introduction to OSPF
Hello Protocol
OSPF Hello Packet

Purpose of Hello Packet

Discover OSPF neighbors & establish adjacencies

Advertise guidelines on which routers must agree to become
neighbors
Used by multi-access networks to elect a designated router and
a backup designated router

Introduction to OSPF
Hello Packets continued
Contents of a Hello Packet
router ID of transmitting router

OSPF Hello Intervals

Usually multicast (224.0.0.5)
Sent every 30 seconds for NBMA segments

OSPF Dead Intervals

This is the time that must transpire
before the neighbor is considered
down
Default time is 4 times
the hello interval

Introduction to OSPF
Hello protocol packets contain information
that is used in electing
-Designated Router (DR)
DR is responsible for updating all other OSPF
routers
-Backup Designated Router (BDR)
This router takes over DRs responsibilities if
DR fails

Introduction to OSPF
OSPF Link-state Updates

Purpose of a Link State Update (LSU)

Used to deliver link state advertisements

Purpose of a Link State Advertisement (LSA)

Contains information about neighbors &

path costs

Introduction to OSPF
OSPF Algorithm
OSPF routers build &
maintain link-state
database containing LSA
received from other
routers
Information found in
database is utilized upon
execution of Dijkstra SPF
algorithm
SPF algorithm used to
create SPF tree
SPF tree used to populate
routing table

Introduction to OSPF
Administrative Distance
Default Administrative Distance for
OSPF is 110

Introduction to OSPF
OSPF Authentication
Purpose is to encrypt & authenticate routing
information
This is an interface specific configuration
Routers will only accept routing information from
other routers that have been configured with the
same password or authentication information

Basic OSPF Configuration

Lab Topology
Topology used for this chapter
Discontiguous IP addressing scheme
Since OSPF is a classless routing protocol
the subnet mask is configured in

Basic OSPF Configuration

The router ospf command
To enable OSPF on a router use the
following command
R1(config)#router ospf process-id
Process id
A locally significant number between 1
and 65535
-this means it does not have to match
other OSPF
routers

Basic OSPF Configuration

OSPF network command
-Requires entering: network address

wildcard mask - the inverse of

the subnet
mask

area-id - area-id refers to

the OSPF area.
OSPF area is a
group of routers that
share link
state information
-Example: Router(configrouter)#network network-address
wildcard-ask area area-id

Basic OSPF Configuration

Router ID
This is an IP address used to identify a
router
3 criteria for deriving the router ID
Use IP address configured with OSPF router-id
command
-Takes precedence over loopback and physical
interface addresses

If router-id command not used then router

chooses highest IP address of any loopback
interfaces
If no loopback interfaces are configured then the
highest IP address on any active interface is
used

Basic OSPF Configuration

OSPF Router ID
Commands used to verify current router
ID
Show ip protocols
Show ip ospf
Show ip ospf interface

Basic OSPF Configuration

OSPF Router ID
Router ID & Loopback addresses
-Highest loopback address will be used as
router ID if router-id command isnt used
-Advantage of using loopback address
the loopback interface cannot fail OSPF
stability

The OSPF router-id command

Introduced in IOS 12.0
Command syntax
Router(config)#router ospfprocess-id
Router(config-router)#router-idip-address

Basic OSPF Configuration

Verifying OSPF
Use the show ip ospf command to verify
& trouble shoot OSPF networks
Command will display the following:
Neighbor adjacency

-No adjacency indicated by Neighboring routers Router ID is not displayed

A state of full is not displayed

-Consequence of no adjacencyNo link state information exchanged

Inaccurate SPF trees & routing tables

Basic OSPF Configuration

Verifying OSPF - Additional Commands

Command

Description

Show ip protocols

Displays OSPF process ID,

router ID, networks router is
advertising & administrative
distance

Show ip ospf

Displays OSPF process ID,

router ID, OSPF area information
& the last time SPF algorithm
calculated

Show ip ospf interface

Displays hello interval and dead

interval

Basic OSPF Configuration

Examining the routing table
Use the show ip route command to
display the routing table
-An O at the beginning of a route
indicates that the router source is OSPF
-Note OSPF does not automatically
summarize at major network boundaries

OSPF Metric
OSPF uses cost as the metric for
determining the best route
-The best route will have the lowest cost
-Cost is based on bandwidth of an interface
Cost is calculated using the formula

108 / bandwidth
-Reference bandwidth
defaults to 100Mbps
can be modified using
auto-cost reference-bandwidth command

OSPF Metric
COST of an OSPF route
Is the accumulated value from one router
to the next

OSPF Metric
Usually the actual speed of a link is
different than the default bandwidth

This makes it imperative that the

bandwidth value reflects links actual speed
Reason: so routing table has best path
information

The show interface command will

display interfaces bandwidth

-Most serial link default to 1.544Mbps

Basic OSPF Configuration

Modifying the Cost of a link
Both sides of a serial link should be
configured with the same bandwidth

Commands used to modify bandwidth

value
Bandwidth command

Example: Router(config-if)#bandwidthbandwidthkbps

ip ospf cost command allows you to directly

specify interface cost
-Example:R1(config)#interface serial 0/0/0

R1(config-if)#ip ospf cost 1562

Basic OSPF Configuration

Modifying the Cost of the link
Difference between bandwidth command
& the ip ospf cost command
Ip ospf cost command
Sets cost to a specific value

Bandwidth command
Link cost is calculated

OSPF and Multiaccess

Networks

Challenges in Multiaccess Networks

OSPF defines five network types:
Point-to-point
Broadcast Multiaccess
Nonbroadcast Multiaccess (NBMA)
Point-to-multipoint
Virtual links

OSPF in Multiaccess Networks

2 challenges presented by multiaccess
networks
Multiple adjacencies
Extensive LSA flooding

OSPF in Multiaccess Networks

Extensive flooding of LSAs
For every LSA sent out there must be an
acknowledgement of receipt sent back to
transmitting router.
consequence: lots of bandwidth
consumed and chaotic traffic

OSPF in Multiaccess Networks

Solution to LSA
flooding issue is the
use of
Designated router
(DR)
Backup designated
router (BDR)

DR & BDR selection

Routers are elected to
send & receive LSA

Sending & Receiving

OSPF in Multiaccess Networks

DR/BDR Election Process
DR/BDR elections DO NOT occur in
point to point networks

OSPF in Multiaccess Networks

DR/BDR elections will take place on
multiaccess networks as shown below

OSPF in Multiaccess Networks

Criteria for getting elected

DR/BDR
1. DR: Router with the highest
OSPF interface priority.
. 2. BDR: Router with the
second highest OSPF
interface priority.
. 3. If OSPF interface priorities
are equal, the
. highest router ID is used to
break the tie.

OSPF in Multiaccess Networks

Timing of DR/BDR Election
Occurs as soon as 1st router has its interface
enabled on multiaccess network
When a DR is elected it remains as the DR until
one of the following occurs
-The DR fails.
-The OSPF process on the DR fails.
-The multiaccess interface on the DR fails.

OSPF in Multiaccess Networks

Manipulating the election process
-If you want to influence the election of DR
& BDR then do one of the following
Boot up the DR first, followed by the BDR, and
then boot all other routers,

OR
Shut down the interface on all routers, followed
by a no shutdown on the DR, then the BDR,
and then all other routers.

OSPF in Multiaccess Networks

OSPF Interface Priority
Manipulating the DR/BDR election
process continued
Use the ip ospf priority interface command.
Example:Router(config-if)#ip ospf priority
{0 - 255}
Priority number range 0 to 255
0 means the router cannot become the DR or BDR
1 is the default priority value

More OSPF
Configuration
Redistributing an OSPF Default Route
Topology includes a link to ISP
Router connected to ISP
Called an autonomous system border router
Used to propagate a default route
Example of static default route
R1(config)#ip route 0.0.0.0 0.0.0.0 loopback 1
Requires the use of the default-information
originate command
Example of default-information originate command
R1(config-router)#default-information originate

More OSPF Configuration

Fine-Tuning OSPF
Since link speeds are
getting faster it may
be necessary to
change reference
bandwidth values
Do this using the
auto-cost referencebandwidth command
Example:

More OSPF Configuration

Fine-Tuning OSPF

Modifying OSPF timers

Reason to modify timers

Faster detection of network failures

Manually modifying Hello & Dead intervals

Router(config-if)#ip ospf hello-interval
seconds
Router(config-if)#ip ospf deadinterval seconds

Point to be made
Hello & Dead intervals must be the same
between neighbors

Summary
RFC 2328 describes OSPF link state
concepts and operations
OSPF Characteristics
A commonly deployed link state routing
protocol
Employs DRs & BDRs on multi-access
networks
DRs & BDRs are elected
DR & BDRs are used to transmit and receive
LSAs

Uses 5 packet types:

1: HELLO
2: DATABASE DESCRIPTION

Summary
OSPF Characteristics
Metric = cost
Lowest cost = best path

Configuration
Enable OSPF on a router using the
following command
R1(config)#router ospf process-id

use the network command to define which

interfaces will participate in a given OSPF
process
Router(config-router)#network network-address

Summary
Verifying OSPF configuration
Use the following commands
show ip protocol
show ip route
show ip ospf interface
show ip ospf neighbor