TELE33324 Data Network
Implementation
Chapter 17 & 18
CCNA Routing and Switching
Complete Study Guide 2nd Edition
Objectives
• Learning about two major dynamic routing
protocols:
– Enhanced IGRP (EIGRP)
– Open Shortest Path First (OSPF)
2
Classless Routing
Classless routing protocols advertise routes
by including the subnet masks:
– Classless routing protocols support variable-length
subnet masking (VLSM).
– Summary routes can be manually controlled within the
network.
– Examples of classless routing protocols:
• RIP Version 2 (RIPv2)
• EIGRP
• OSPF
• IS-IS
3
Review: Administrative Distance
Router A Router B
EIGRP
RIP Administrative
Administrative Distance=90
Distance=120
Router C Router D
Default Administrative Distance
Directly Connected: 0
Static Route: 1
RIP: 120
IGRP: 100
EIGRP: 90
OSPF: 110 4
Review: Autonomous System (AS)
IGPs: EIGRP, OSPF
EGPs: BGP
Autonomous System 1 Autonomous System 2
• An autonomous system (AS) is a collection of
networks under a common administrative
domain, i.e., all routers sharing the same
routing table are in the same AS.
• Interior Gateway Protocols (IGP) operate within
an AS, and exterior GP connects different ASs.
Distance Vector vs Link State
Distance Vector (e.g. RIPv2):
• Exchanges routing tables with neighbors
• Utilizes frequent periodic updates
Link State (e.g. OSPF):
• Provides common view of entire topology
• Calculates shortest path
• Utilizes event-triggered updates
• Can be route between AS’s
Wildcard Masks
EIGRP and OSPF use wildcards masks
instead of subnet masks.
Wildcard masks are bit-compliment of subnet
masks
– [Link] means all octets match exactly
– [Link] means that the first three match
exactly, but the last octet can be any
value
After that, you must remember your block
sizes….
Wildcard Masks
Wildcard mask is always one less than block size:
[Link]/30: wildcard mask is [Link]
[Link]/28: wildcard mask is [Link]
[Link]/27: wildcard mask is [Link]
[Link]/26: wildcard mask is [Link]
EIGRP
IP Routing IP Routing
Protocols Protocols
AppleTalk Enhanced AppleTalk
Routing Protocol IGRP Routing Protocol
IPX Routing IPX Routing
Protocols Protocols
• Enhanced Interior Gateway Routing Protocol supports:
– Rapid convergence
– Reduced bandwidth usage
– Multiple network-layer support
– Uses Diffused Update Algorithm (DUAL) to select loop-free
routes and enable fast convergence
EIGRP (cont.)
– Previously was a Cisco priority protocol (i.e.
other companies cannot do EIGRP). Cisco had
since made EIGRP a semi-open protocol.
– Supports load balancing (4 by default)
– Supports VLSM
– Maximum hop count of 255 (100 default)
– EIGRP can differentiate between internal and
external routes
EIGRP Neighbor Discovery
Before EIGRP routers can exchange routes with each
other, they must become neighbors:
Route Update
• The only time EIGRP advertises its entire
information is when it discovers a new
neighbor and forms a relationship
(“adjacency”) by exchanging Hello packets.
• When this happens, both neighbors then
advertise their complete information to one
another. After each has learned its neighbor’s
routes, only changes to the routing table will
be propagated.
Route Update (cont…)
• Subsequent route updates sent only when a
change occurs – multicast on [Link]
• Hello messages sent to neighbors every 5
seconds (60 seconds in most WANs)
EIGRP EIGRP
hello
EIGRP Terminology
Neighbor Table—IP
Next Hop Interface
Router
Topology Table—IP
Destination 1 Successor
Destination 1 Feasible Successor
Routing Table—IP
Destination 1 Successor
Note: A feasible successor is a backup route and stored in
the Topology table
EIGRP Tables
• The neighbor table and topology table are
held in Router RAM and are maintained
through the use of Hello message and update
packets.
EIGRP EIGRP
hello
To see all feasible successor routes known to a router, use the
show ip eigrp topology command
Successor Routes
• Successor route is used by EIGRP to forward
traffic to a destination
• A successor routes may be backed up by a
feasible successor route
• Successor routes are stored in both the
topology table and the routing table
Topology Table—IP
Destination 1 Successor
Destination 1 Feasible Successor
Routing Table—IP
Destination 1 Successor
Choosing Routes
IP IP
A B
64kbps
AppleTalk T1 T1 AppleTalk
IPX IPX
T1
C D
• EIGRP uses a composite metric to pick the best
path: bandwidth and delay of the line
• EIGRP can load balance across six unequal cost
paths to a remote network (4 by default)
Route Path
Assuming all default parameters, which
route will RIPv2 take between Router A
and B, and which route will EIGRP
take?
T1
(1.544 Mbps) T1
Router A Router B
56 kbps
10BaseT
100BaseT
100BaseT
Configuring EIGRP for IP
To start an EIGRP session on a router, use the
router eigrp command followed by the
autonomous system number of your network
Token
A
AS=10 C Ring
B [Link]
[Link] [Link]
[Link]
Enable EIGRP Router(config)#router eigrp 10
Router(config-router)#network [Link]
Assign networks Router(config-router)#network [Link]
Verifying EIGRP Operation
Router# show ip eigrp neighbors • Displays the neighbors discovered by
IP Enhanced IGRP
Router# show ip eigrp topology • Displays the IP Enhanced IGRP
topology table
Router# show ip route eigrp • Displays current Enhanced IGRP
entries in the routing table
Router# show ip protocols • Displays the parameters and current
state of the active routing protocol
process
Router# show ip eigrp traffic • Displays the number of IP Enhanced
IGRP packets sent and received
Show IP Route
P1R1#sh ip route
[output cut]
Gateway of last resort is not set
D [Link]/24 [90/2172] via [Link],00:04:36, Serial0/0
C [Link]/24 is directly connected, FastEthernet0/0
D [Link]/24 [90/2681] via [Link],00:04:36, Serial0/0
C [Link]/24 is directly connected, Serial0/0
D [Link]/24 [90/2707] via [Link],00:04:35, Serial0/0
P1R1#
D is for “DUAL” or Diffused Update Algorithm, showing EIGRP route
[90 / 2172] shows two values: administrative distance, and cost of
the route. The cost of the route is a composite metric comprised
from the bandwidth and delay of the line
Trouble-shooting EIGRP
• Here are some key things to look for if neighbors haven’t
formed an adjacency:
– Interfaces between the devices are down.
– The two routers have mismatching EIGRP
autonomous system (AS) numbers.
– Proper interfaces are not enabled for EIGRP process.
– An interface is configured as passive.
– EIGRP authentication is misconfigured.
Trouble-shooting EIGRP (cont..)
…if the adjacency is up, but you’re not receiving remote
network updates, there may be a routing problem, likely
caused by these issues:
• The proper networks aren’t being advertised under
the EIGRP process.
• An access list is blocking the advertisements from
remote networks.
Open Shortest Path First (OSPF)
• Open standard: all equipment vendors can implement
• Shortest path first (SPF) algorithm
• Link-state routing protocol (not Distance Vector)
• Can be used to route between AS’s
OSPF Hierarchical Routing
• Consists of areas and autonomous systems
• Minimizes routing update traffic
• Supports VLSM
• Unlimited hop count
OSPF Design
• minimizes routing table entries
• keeps the impact of any topology changes contained
within a specific area
• fast convergence
Types of OSPF Routers
Area 1 Area 0 (Backbone) Area 2
Area Boundary
Router (ABR) Backbone/
Internal
Internal Routers
Routers
Internal
Routers
ABR and
Backbone
Autonomous Router
System External
Boundary Autonomous
Router (ASBR) System
Configuring Single Area OSPF
Router(config)#router ospf process-id
Defines OSPF as the IP routing protocol
Note: The process ID is locally significant, identifying
a unique instance of an OSPF database. A value in the range
from 1 to 65,535 identifies the OSPF process ID.
Router(config-router)#network address mask area area-id
Assigns networks to a specific OSPF area.
The area-id can be any number from 0 to 4.2 billion.
OSPF Example (Only using Area 0)
Area 0
R1
[Link]
R3
[Link]
R2
[Link] [Link]
hostname R3 hostname R2 hostname R1
router ospf 10 router ospf 20 router ospf 30
network [Link] [Link] area 0 network [Link] [Link] area 0 network [Link] [Link]
area 0
network [Link] [Link] area 0 network [Link] [Link]
area 0
Verifying the OSPF
Configuration
Router#show ip protocols
Verifies that OSPF is configured
Router#show ip route
Displays all the routes learned by the router
Router#show ip ospf interface
Displays area-ID and adjacency information
Router#show ip ospf neighbor
Displays OSPF-neighbor information on a per-interface basis
OSFP Neighbors
• OSPF uses hello packets to:
– provide dynamic neighbor discovery
– create adjacencies and maintain connectivity with
neighbor routers
• OSPF uses the multicast address [Link]
Hello?
[Link]
OSFP Neighbors (cont…)
• Link State Advertisement (LSA) is an OSPF
data packet containing link-state and routing
information shared among OSPF routers.
• Hello packets and LSA’s from other routers
help build and maintain the topological
database
OSPF Router ID (RID)
• RID is used to advertise routes, and to elect the
designated router (DR) and the backup designated
router (BDR). These designated routers create
adjacencies when a new router comes up and
exchanges LSAs to build topological databases.
RID & Loopback Interfaces
– Default RID: The highest IP address on an active
interface at the moment of OSPF process startup
– Can be overridden by a loopback interface: Highest
IP address of any active loopback (also called a
logical) interface
Electing the DR and BDR
• OSPF sends Hello packets which elect Designated
Router (DR) and Backup DR (BDR)
• Router form adjacencies with DRs and BDRs in a
multi-access environment
OSPF Terminology
Neighbors
ABR
DR
Non-DR
Adjacencies
BDR
(exchanging routing
information)
OSPF
Neighbor Table—IP
Next Hop Interface
Router
OSPF database
Routing Table—IP
Destination 1 Successor