Reviewing
Routing
Operations
Medium-Sized Routed Network Construction
[Link]
ICND1 v1.01-1
Static vs. Dynamic Routes
Static Route
Uses a route that a
network administrator
enters into the router
manually
[Link]
Dynamic Route
Uses a route that a
network routing protocol
adjusts automatically for
topology or traffic changes
ICND1 v1.01-2
What Is a Dynamic Routing Protocol?
Routing protocols are
used between routers to
determine paths to remote
networks and maintain
those networks in the
routing tables.
After the path is determined,
a router can route a routed
protocol to the learned networks.
[Link]
ICND1 v1.01-3
Autonomous Systems: Interior and
Exterior Routing Protocols
nomous system is a collection of networks within
on administrative domain.
gateway protocols operate within an autonomous s
r gateway protocols connect different autonomous
[Link]
ICND1 v1.01-4
Classes of Routing Protocols
[Link]
ICND1 v1.01-5
Selecting the Best Route Using Metrics
[Link]
ICND1 v1.01-6
Administrative Distance:
Ranking Routing Sources
Routers choose the routing source with the
best administrative distance:
OSPF has an administrative distance of 110.
EIGRP has an administrative distance of 90.
[Link]
ICND1 v1.01-7
Distance Vector Routing Protocols
Routers pass periodic copies of their routing table to
neighboring routers and accumulate distance vectors.
[Link]
ICND1 v1.01-8
Sources of Information and
Discovering Routes
Routers discover the best path to destinations from each neighbor.
[Link]
ICND1 v1.01-9
Maintaining Routing Information
Updates proceed step by step from router to router.
[Link]
ICND1 v1.01-10
Inconsistent Routing Entries:
Counting to Infinity and Routing Loops
Each node maintains the distance from itself
to each possible destination network.
[Link]
ICND1 v1.01-11
Counting to Infinity
Slow convergence produces inconsistent routing.
[Link]
ICND1 v1.01-12
Counting to Infinity (Cont.)
Router C concludes that the best path to
network [Link] is through router B.
[Link]
ICND1 v1.01-13
Counting to Infinity (Cont.)
Router A updates its table to reflect
the new but erroneous hop count.
[Link]
ICND1 v1.01-14
Counting to Infinity (Cont.)
The hop count for network [Link] counts to infinity.
[Link]
ICND1 v1.01-15
Solution to Counting to Infinity:
Defining a Maximum
A limit is set on the number of hops to prevent infinite loops.
[Link]
ICND1 v1.01-16
Routing Loops
Packets for network [Link] bounce
(loop) between routers B and C.
[Link]
ICND1 v1.01-17
Solution to Routing Loops: Split Horizon
It is never useful to send information about a route back
in the direction from which the original information came.
[Link]
ICND1 v1.01-18
Solution to Routing Loops:
Route Poisoning and Poison Reverse
Routers advertise the distance of routes
that have gone down to infinity.
[Link]
ICND1 v1.01-19
Solution to Routing Loops:
Route Poisoning and Poison Reverse (Cont.)
Poison reverse overrides split horizon.
[Link]
ICND1 v1.01-20
Solution to Routing Loops:
Hold-Down Timers
The router keeps an entry for the possibly down state in the network,
allowing time for other routers to recompute for this topology change.
[Link]
ICND1 v1.01-21
Triggered Updates
The router sends updates when a change in its routing table occurs.
[Link]
ICND1 v1.01-22
Eliminating Routing Loops
[Link]
ICND1 v1.01-23
Eliminating Routing Loops (Cont.)
[Link]
ICND1 v1.01-24
Eliminating Routing Loops (Cont.)
[Link]
ICND1 v1.01-25
Link-State Routing Protocols
After an initial flood of LSAs, link-state routers pass small,
event-triggered link-state updates to all other routers.
[Link]
ICND1 v1.01-26
OSPF Hierarchical Routing
Consists of areas and autonomous systems
Minimizes routing update traffic
[Link]
ICND1 v1.01-27
Link-State Routing Protocol Algorithms
[Link]
ICND1 v1.01-28
Benefits and Drawbacks of Link-State Routing
Benefits of link-state routing:
Fast convergence:
Changes are reported immediately by the affected source
Robustness against routing loops:
Routers know the topology
Link-state packets are sequenced and acknowledged
Hierarchical network design enables optimization of resources.
Drawbacks of link-state routing:
Significant demands for resources:
Memory (three tables: adjacency, topology, forwarding)
CPU (Dijkstras algorithm can be intensive, especially when there are many
instabilities)
Requires very strict network design
Configuration can be complex when tuning various parameters and
when design is complex
[Link]
ICND1 v1.01-29
Summary
Dynamic routing requires administrators to configure either a
distance vector or link-state routing protocol.
Distance vector routing protocols incorporate solutions such as
split horizon, route poisoning, and hold-down timers to prevent
routing loops.
Link-state routing protocols scale to large network infrastructures
better than distance vector routing protocols, but they require
more planning to implement.
[Link]
ICND1 v1.01-30