Professional Documents
Culture Documents
Ccna2 - Mod6 - Routing & Routing Protocols
Ccna2 - Mod6 - Routing & Routing Protocols
Version 3.1
Routing
Version 3.1
Configuring Static Routes
with Outgoing Interface
Outgoing
interface
Administrative
distance of 1 -
default
Version 3.1
Configuring Static Routes
with Next-hop IP Address
Next hop
interface
Administrative
distance of 1 -
default
Version 3.1
Configuring Static Routes
Version 3.1
Administrative Distance
Version 3.1
S0 S0
192.168.2.1/24 192.168.4.1/24
Router A Router B Router C
S1 S1
192.168.2.2/24 192.168.4.2/24
Version 3.1
Static Default Routes
Version 3.1
Default Route on non-directly connected
networks
Version 3.1
Verifying a Default Route
Version 3.1
Examine the show ip route Command
Version 3.1
Troubleshooting static route configuration
•show interfaces
•show interface s0
•show interface s1
•show ip interface brief
Version 3.1
Routed VS. Routing
•Routed protocols
are protocols that are
routed over an
Internetwork (IP,
AppleTalk, IPX)
•Routing protocols
use algorithms to
route routed protocols
through the
Internetwork (RIP,
IGRP, OSPF)
Version 3.1
Convergence
Version 3.1
S0 S0
Version 3.1
Distance Vector Routing
Neighbor to
neighbor
ONLY
Version 3.1
Distance Vector Routing
Version 3.1
Topology Changes (distance vector)
Version 3.1
Link-state Routing
•Shortest Path First (SPF)
•Flood routing information about it’s OWN links
•Analyze incoming routing update messages
•If the message indicates that a network change has
occurred, the routing software recalculates routes
and sends out new routing update messages
•These messages permeate the network, stimulating
routers to rerun their algorithms and change their
routing tables accordingly.
•After the initial flood, it passes small event-
triggered updates to all other routers
Version 3.1
In Order to Converge, a Router in a Link-
State network must:
•Remember its neighbor’s name, when it’s link is up or down
(status), and the cost of the path to that router.
•Create an LSP (link-state packet) that lists its neighbor’s
name and relative costs.
•Send the newly created LSP to all other routers participating
in the link-state network.
•Receive LSPs from other routers and update its own
database. (Particularly when there are changes in the network)
•Build a complete map of the Internetwork’s topology from all
the LSPs received, then compute the best route to each
network destination.
Version 3.1
Link-State Concerns
•Processor overhead
•Memory requirements (use more router resources
initially when flooding info)
•Bandwidth Consumption on initial flood
Version 3.1
The Routing Process
192.168.1.56
01-00-A5-C3-26-6B
•The protocol
address (IP) always
remains the same.
192.168.1.56
34-7E-33-12-C9-20
192.168.1.56
6A-5F-0D-09-8B-AA
•The physical
192.168.1.56
address (MAC)
BC-48-03-8F-FF-AA changes at each hop.
Version 3.1
Routing Decisions
Version 3.1
Configuring a Router to Route
Version 3.1
Routing Protocols
•RIP
oDistance vector
oUses hop count as its only metric (15)
oBroadcasts routing updates every 30 seconds
•IGRP
oProprietary to Cisco, still a distance vector protocol
oUses bandwidth, load, reliability, & delay as its metrics
oBroadcasts routing updates every 90 seconds
•EIGRP
oCisco’s advanced distance vector interior routing protocol
oUses some distance vector and some link-state principles
Version 3.1
Routing Protocols
•OSPF (initially advertisements are flooded)
oLink-state routing protocol
oRouting updates occur when there are topology changes
oAll routers in a OSPF domain would then adjust their routes
•BGP
oA distance vector exterior routing protocol
oRoutes traffic between 2 autonomous systems
Version 3.1
Border Gateway Protocol & Autonomous
Systems