Professional Documents
Culture Documents
Link
State
B
D
X
Link State
Updates are event
triggered
Each router is
"aware" of all other
routers in the "area"
Fast convergence
Less subject to
routing loops
More difficult to
configure
2
Comparison Continued
Distance Vector
Fewer router resources
required
Updates require more
bandwidth
Does not "understand"
the topology of the
network
Link State
More router resource
intensive
Updates require less
bandwidth
Has detailed
knowledge of distant
networks and routers
Link State
Example
OSPF
IS-IS
OSPF
Link State
There are two types of Packets
Hello
LSAs
OSPF Hello
A
10
"Hello" Packets
Small frequently issued packets
Discover neighbours and negotiate "adjacencies"
Verify continued availability of adjacent
neighbours
Hello packets and Link State Advertisements
(LSAs) build and maintain the topological
database
Hello packets are addressed to 224.0.0.5.
11
12
Link State
There are three type of tables
Neighbor
Topology
Routing
14
Tables
Neighbor
Contain information about the neighbors
Neighbor is a router which shares a link on
same network
Another relationship is adjacency
Not necessarily all neighbors
LSA updates are only when adjacency is
established
15
Tables
Topology
Contain information about all network and path
to reach any network
All LSAs are entered in to topology table
When topology changes LSAs are generated
and send new LSAs
On topology table an algorithm is run to create
a shortest path, this algorithm is known as SPF
or dijkstra algorithm
16
Tables
Routing Table
Also knows as forwarding database
Generated when an algorithm is run on the
topology database
Routing table for each router is unique
17
OSPF Terms
Link
Router ID
Neighbours
Adjacency
OSPF Area
Backbone area
Internal routers
Area Border Router
(ABR)
Autonomous
System Boundary
Router (ASBR)
18
Link
A network or router interface assigned to a
given network
Link
(interface)
will
have
"state"
information associated with it
Status (up or down)
IP Address
Network type (e.g. Fast Ethernet)
Bandwidth
Addresses of other routers attached to
this interface
19
20
Router ID
The Router ID (RID) is an IP address used to identify the
router
Cisco chooses the Router ID by using the highest IP address
of all configured loopback interfaces
If no loopback interfaces are configured with addresses,
OSPF will choose the highest IP address of all active
physical interfaces.
You can manually assign the router ID.
The RID interface MUST always be up, therefore loopbacks
are preferred
22
Neighbours
Neighbours are two or more routers
that have an interface on a common
network
E.g. two routers connected on a serial
link
E.g. several routers connected on a
common Ethernet or Frame relay
network
Communication
takes
between / among neighbours
place
23
Adjacency
A relationship between two routers
that permits the direct exchange of
route updates
Not
all
neighbours
will
form
adjacencies
This is done for reasons of efficiency
24
OSPF Design
Each router connects to the backbone called area 0, or the backbone area.
Routers that connect other areas to the backbone within an AS are called Area Border Routers
(ABRs). One interface must be in area 0.
OSPF runs inside an autonomous system, but can also connect multiple autonomous systems
together. The router that connects these ASes together is called an Autonomous System
Boundary Router (ASBR).
25
OSPF Areas
An OSPF area is a grouping of contiguous
networks and routers
Share a common area ID
A router can be a member of more than one area
(area border router)
All routers in the same area have the same
topology database
When multiple areas exist, there must always be
an area 0 (the backbone) to which other areas
connect
26
Why areas?
Decreases routing overhead
Compare to multiple smaller
domains instead of one large one
broadcast
Speeds convergence
Confines network instability (e.g. route "flapping")
to single area of the network
Adds considerably to the complexity of setting up
OSPF
27
Area Terminology
28
LSAs in Area
LSAs communicate with adjacent routers in the
same OSPF area
Subsequently, a change in a link
"flooded" to all area routers via LSAs
state
is
29
Path Calculation
Changes to the topological database of a router
trigger a recalculation to re-establish the best
route(s) to known networks
Uses the SPF (shortest path first) algorithm
developed by a computer scientist named
Dijkstra
This is done by each individual router using its
detailed "knowledge" of the whole network
Leads to rapid and accurate convergence
Based on detailed knowledge of every link in
the area and the OSPF "cost" of each
builds an OSPF tree with itself at the route
31
Types of Neighbors
OSPF can be defined for three type of
neighbors
Broadcast Multi Access (BMA) ex- Ethernet
Point to Point
Non-Broadcast Multi Access (NBMA)
32
33
Adjacencies
Point to Point all routers form adjacencies
BMA & NBMA one router is elected as DR
DR establish adjacency with every neighbor
router
LSA updates are exchanged only to DR
DR is the router which has highest priority
All CISCO routers has priority 1
If priority is same then router id is seen
The RID is highest IP address of all interfaces
34
Point-to-Point Links
35
Multi-access Broadcast
Network
DR Responsibility
When a router sees a new or changed link-state,
it sends an LSA to its DR using a particular
multicast address
The DR then forwards the LSA to all the other
routers with whom it is adjacent
Minimizes the number of formal adjacencies
that must be formed and therefore the amount
of LSU (link state update) packet traffic in a
multi-router network
39
OSPF Summary
AD -100
Hop count is unlimited
Classless, VLSM
Load balance up to SIX routers
Require more processing power
40
41
OSPF states
OSPF Configuration
OSPF Configuration -1
S0
S1
20.0.0.2
30.0.0.1
R2
R1
S020.0.0.1
10.0.0.1
E0
10.0.0.2
S0
R3
30.0.0
.2
E0
40.0.0
.1
40.0.0.2
45
OSPF Configuration -1
S0
S1
20.0.0.2
30.0.0.1
R2
R1
S0
10.0.0.1
E020.0.0.1
S0
R3
30.0.0
.2
10.0.0.2
E0
40.0.0
.1
40.0.0.2
R1#config t
Enter configuration commands, one per line. End with CNTL/Z.
R1(config)#router ospf 1
R1(config-router)#network 10.0.0.0 0.255.255.255 area 0
R1(config-router)#network 20.0.0.0 0.255.255.255 area 0
R1(config-router)#^Z
46
OSPF Configuration -2
S0
200.0.0.8/30
S1
R2
200.0.0.12/30
R1
R3
S0
S0
E0
E0
200.0.0.16/28
200.0.0.32/27
47
OSPF Configuration -2
S0
S1
200.0.0.10
255.255.255.2
52
R1
S0200.0.0.9
200.0.0.17
255.255.255.2
40
E0
200.0.0.18
R2
200.0.0.13
255.255.255.2
52 R3
S0
200.0.0.1
4
E0
200.0.0.3
3
255.255.255.2
24
200.0.0.34
48
OSPF Configuration -2
S0
S1
200.0.0.10
255.255.255.2
52
R1
S0200.0.0.9
200.0.0.17
255.255.255.2
40
E0
200.0.0.13
R2
255.255.255.2
52 R3
S0
200.0.0.1
4
E0
255.255.255.2
24
200.0.0.18
R1#config t
Enter configuration commands, one per line. End with
CNTL/Z.
R1(config)#router ospf 1
R1(config-router)#network 200.0.0.16
0.0.0.15 area
0
R1(config-router)#network 200.0.0. 8
0.0.0.3
area
0
R1(config-router)#^Z
200.0.0.3
3
200.0.0.34
R3#config t
Enter configuration commands, one per line. End with
CNTL/Z.
R3(config)#router ospf 1
R3(config-router)#network 200.0.0. 32 0.0.0.31 area
0
R3(config-router)#network 200.0.0. 12
0.0.0.3
area 0
R3(config-router)#^Z
49
50
show ip protocols
show ip ospf
54
55
Pri
1
1
State
FULL/BDR
FULL/-
Dead Time
00:00:31
00:00:38
Address
10.64.1.1
10.2.1.1
Interface
Ethernet0
Serial0
56
57
Router(config-if)#
ip ospf priority number