25.6 Enabling OSPF

2002, Cisco Systems, Inc. All rights reserved.
Enabling OSPF
2002, Cisco Systems, Inc. All rights reserved. 2002, Cisco Systems, Inc. All rights reserved.
ICND v2.05-2
OSPF overview
Open Shortest Path First (OSPF) is a link-state routing protocol based on open standards. The most recent description is RFC 2328. The Open in OSPF means that it is open to the public and is non-proprietary.
ICND v2.05-3
OSPF terminology
ICND v2.05-4
OSPF terminology: Links

An interface on Router
Links
Token Ring
ICND v2.05-5
OSPF terminology: Link state

The status of a link between two routers. Also a routers interface and its relationship to its neighboring routers.
Neighbors
Links
Token Ring
ICND v2.05-6
ICND v2.05-7
OSPF AreasExample
Area 3
Area 0 Area 2
Area 1
2002, Cisco Systems, Inc. All rights reserved. ICND v2.05-8
OSPF terminology: Link Cost

The value assigned to a link. Rather than hops, link-state protocols assign a cost to a link that is based on the speed of the media. Interface Output Cost.
Neighbors
Interfaces
Cost = 10
Token Ring
Cost = 1785
Cost = 6
ICND v2.05-9
OSPF terminology: Adjacency database

A listing of all the neighbors to which a router has established bi-directional communication. Not every pair of neighboring routers become adjacent Neighbors
Token Ring
Adjacency database
OSPF terminology: Link-state database

Also known as a topological database A list of link-state entries of all other routers in the internetwork
Token Ring
Adjacency database
Topological Database
ICND v2.05-11
OSPF terminology: Routing table

The routing table (also known as forwarding database) generated when an algorithm is run on the link-state database. Each routers routing table is unique
Token Ring
Lists neighbors Lists all routes

Adjacency Database
Topological Database
Lists best routes

ICND v2.05-12
Routing Table
OSPF terminology: DR and BDR router

Designated router (DR) and backup designated router (BDR): A router that is elected by all other routers on the same LAN to represent all the routers. Each network has a DR and BDR
DR
Token Ring
BDR
ICND v2.05-13
Comparing OSPF with distance vector routing protocols

Distance vector View network topology from neighbors perspective OSPF Gets common view of entire network topology
Calculates the shortest Adds distance vectors from path to other routers router to router Event-triggered update: Frequent, periodic update: Slow convergence Passes copies routing tables to neighbor routers Use flat topology Fast to convergence Passes link-state routing updates to other routers Allow hierarchical design for large internetworks
Support for VLSM
ICND v2.05-14
Shortest path algorithm

1 4
C
4
2 D 1 E F G
The best path is the lowest cost path.

Shortest Path First Tree for node B

B (1, B) 1 4 A (4, B) 2 D (4, E) 2
1
E (3, C)
F (5, E)
G (6, A)
ICND v2.05-16
OSPF network types
ICND v2.05-17
OSPF network types: Fourth type
ICND v2.05-18
DR and BDR receive LSAs
Hellos elect DR and BDR to present segment Each router then forms adjacency with DR and BDR
OSPF Hello Protocol

The rules that govern the exchange of OSPF hello packets are called the Hello protocol. Hello packets use : 224.0.0.5 (all routers). Hello packets are sent at regular intervals (default): Multi access and Point-to-point: 10s NBMA : 30s On multi-access networks the Hello protocol elects a designated router (DR) and a backup designated router (BDR). The hello packet carries information that all neighbors must agree upon before an adjacency is formed, and link-state information is exchanged.
OSPF packet header
For the hello packet the type field is set to 1.
ICND v2.05-21
OSPF Hello Protocol - Hello header
ICND v2.05-22
Steps in the operation of OSPF
5 steps of operation:
1. Establish router adjacencies. 2. Elect a DR and BDR (if necessary). 3. Discover routes.
4. Select the appropriate routes to use.

5. Maintain routing information.
OSPF Topologies
Broadcast Multiaccess
Point-to-Point
NBMA
X.25
Frame Relay
ICND v2.05-24
OSPF Operation in a Broadcast Multiaccess Topology
Broadcast Multiaccess
2002, 2000, Cisco Systems, Inc. All rights reserved.
www.cisco.com
4-25 25
Step 1: Establish router adjacencies
First step in OSPF operation is to establish router adjacencies RTB sends hello packets, advertising its own router ID highest IP address:10.6.0.1(no loopback)
ICND v2.05-26
Step 1: Establish router adjacencies (cont.)

D E
Hello
A
afadjfjorqpoeru 39547439070713
Hello
Router ID Hello/dead intervals Neighbors Area-ID Router priority DR IP address BDR IP address Authentication password Stub area flag
* Entry must match on neighboring routers

Step 2: Electing the DR and BDR (if necessary).

P=3 P=2
DR
BDR
Hello
P=1
P=1
P=0
The router with the highest priority value is the DR. The router with the second highest priority value is the BDR. The default for the interface OSPF priority is 1. In case of a tie, the routers router ID is used.
Step 3: Discover routes
On difference network have differ discover process.
On multi-access network, the exchange of routing information occurs between the DR or BDR and every other router on the network. Link partners on a point-to-point or pointto-multipoint network also engage in the exchange process.
Exchange Process
A
172.16.5.1/24 E0 172.16.5.2/24 E1
Down State
I am router ID 172.16.5.1 and I see no one.

Init State
Router B Neighbors List 172.16.5.1/24, int E1
I am router ID 172.16.5.2, and I see 172.16.5.1.

Router A Neighbors List 172.16.5.2/24, int E0
Two-way State
ICND v2.05-30
Step 3: Discover routes (cont.)

DR E0 172.16.5.3
Exstart State I will start exchange because I have router ID 172.16.5.1.
E0
172.16.5.1
Hello
No, I will start exchange because I have a higher router ID. Exchange State
Hello
Here is a summary of my link-state database.

DBD
DBD
Here is a summary of my link-state database.

ICND v2.05-31
Step 3: Discover routes (cont.)
DR E0 172.16.5.1
E0 172.16.5.3
LSAck
Thanks for the information! Loading State
LSAck
LSR
I need the complete entry for network 172.16.6.0/24.

Here is the entry for network 172.16.6.0/24.

LSU
LSAck Thanks for the information!
Full State
Step 4: Choosing Routes

10.1.1.0/24 A
Token Ring
10.2.2.0/24 B
FDDI
10.3.3.0/24 C
Cost=6 Cost=1 Cost=10

10.4.4.0/24 Topology Table Net Cost Out Interface 10.2.2.0 6 To0 10.3.3.0 7 To0 10.3.3.0 10 E0
This is the best route to 10.3.3.0.
ICND v2.05-33
Step 5: Maintaining Routing Information

Link-State Change
DR
1 LSU
A B
Router A tells all OSPF DRs on 224.0.0.6
ICND v2.05-34

Link-State Change
LSU
2
DR
1 LSU
A B

DR tells all others on 224.0.0.5
ICND v2.05-35

Link-State Change
LSU
2
DR
4 I need to update my routing table.
1 LSU
A B
3
LSU

DR tells all others on 224.0.0.5
ICND v2.05-36
OSPF Operation in a Point-to-Point
Point-to-Point Neighborship Router dynamically detects its neighboring router using the Hello protocol No election: Adjacency is automatic as soon as the two routers can communicate OSPF packets are always sent as multicast 224.0.0.5
ICND v2.05-37
OSPF Operation in an NBMA
X.25
Frame Relay ATM
NBMA Topology
Single interface interconnects multiple sites

NBMA topologies support multiple routers but without broadcasting capabilities
ICND v2.05-38
SINGLE AREA OSPF Configuration
39
Basic OSPF Configuration

Broadcast Network
E0 10.64.0.2 E0
Point-to-Point Network
S0
10.64.0.1
10.2.1.2
10. 2.1.1 S1
<Output Omitted> <Output Omitted> interface Ethernet0 interface Ethernet0 ip address 10.64.0.2 255.255.255.0 ip address 10.64.0.1 255.255.255.0 ! ! interface Serial0 <Output Omitted> ip address 10.2.1.2 255.255.255.0 router ospf 1 <Output Omitted> network 10.0.0.0 0.255.255.255 area 0 router ospf 50 vicardmark network 10.2.1.2 0.0.0.0 area 0
network 10.64.0.2 0.0.0.0 area 0
Can Assign Network or Interface Address.

Configuring OSPF loopback address

Router ID: Number by which the router is known to OSPF Default: 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 interface
! Create the loopback 0 interface
Router(configf)#Interface loopback 0 Router(configf-if)#ip address 192.168.31.33 255.255.255.255

! Remove loopback 0 interface Router(configf)#no Interface loopback 0
Configuring OSPF router priority
Router(config-if)# ip ospf priority number
ICND v2.05-42
Configuring OSPF timers

! To configure the hello and dead intervals on an interface
Router(config-if)#ip ospf hello-interval seconds Router(config-if)#ip ospf dead-interval seconds
OSPF networks, the default Hello interval is 10 seconds Dead interval is 40 seconds. On nonbroadcast networks, the default Hello interval is 30 seconds Dead interval is 120 seconds. These timers must be configured to match those of any neighboring router.
Common OSPF configuration issues

Failure to establish a neighbor relationship is caused by any of the following reasons: Hellos are not sent from both neighbors. Hello and dead interval timers are not the same. Interfaces are on different network types. Authentication passwords or keys are different. In OSPF routing it is also important to ensure the following: All interfaces have the correct addresses and subnet mask. network area statements have the correct wildcard masks. network area statements put interfaces into the correct area.
ICND v2.05-44
Verifying OSPF Operation

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

Verifying OSPF Operation (cont.)

Router#
show ip ospf
Displays OSPF timers and statistics

Router#
show ip ospf neighbor detail
Displays information about DR, BDR and neighbors

Router#
show ip ospf database
Displays the link-state database

Verifying OSPF Operation (cont.)
Router#
clear ip route *
Allows you to clear the IP routing table

Router#
debug ip ospf option
Displays router interaction during the hello, exchange, and flooding processes
ICND v2.05-47
show ip ospf interface
R2#sh ip ospf int e0 Ethernet0 is up, line protocol is up Internet Address 192.168.0.12/24, Area 0 Process ID 1, Router ID 192.168.0.12, Network Type BROADCAST, Cost: 10 Transmit Delay is 1 sec, State DROTHER, Priority 1 Designated Router (ID) 192.168.0.11, Interface address 192.168.0.11 Backup Designated router (ID) 192.168.0.13, Interface address 192.168.0.13 Timer intervals configured, Hello 10, Dead 40, Wait 40, Retransmit 5 Hello due in 00:00:04 Neighbor Count is 3, Adjacent neighbor count is 2 Adjacent with neighbor 192.168.0.13 (Backup Designated Router) Adjacent with neighbor 192.168.0.11 (Designated Router) Suppress hello for 0 neighbor(s)
ICND v2.05-48
show ip ospf neighbor
Neighbor ID 192.168.0.13 192.168.0.14 192.168.0.11 192.168.0.12
Pri 1 1 1 1
State Dead Time Address 2WAY/DROTHER 00:00:31 192.168.0.13 FULL/BDR 00:00:38 192.168.0.14 2WAY/DROTHER 00:00:36 192.168.0.11 FULL/DR 00:00:38 192.168.0.12
Interface Ethernet0 Ethernet0 Ethernet0 Ethernet0
OSPF over Ethernet - Multiaccess Network
Neighbor ID 192.168.0.11
Pri 1
State FULL/
Dead Time 00:00:39
Address 10.1.1.2
Interface Serial1
OSPF over HDLC - Point-to-Point Network
ICND v2.05-49
show ip ospf database

R2#show ip ospf database OSPF Router with ID (192.168.0.12) (Process ID 1)
Router Link States (Area 0)

Link ID 192.168.0.10 192.168.0.11 192.168.0.12 192.168.0.13 192.168.0.14 ADV Router 192.168.0.10 192.168.0.11 192.168.0.12 192.168.0.13 192.168.0.14 Age 817 817 816 816 817 Seq# 0x80000003 0x80000003 0x80000003 0x80000003 0x80000003 Checksum 0xFF56 0xFD55 0xFB54 0xF953 0xD990 Link count 1 1 1 1 1
Net Link States (Area 0) Link ID 192.168.0.14 ADV Router 192.168.0.14 Age 812 Seq# 0x80000002 Checksum 0x4AC8
ICND v2.05-50
OSPF debug commands

Router#debug ip ospf events OSPF:hello with invalid timers on interface Ethernet0 hello interval received 10 configured 10 net mask received 255.255.255.0 configured 255.255.255.0 dead interval received 40 configured 30 Router# debug ip ospf packet OSPF: rcv. v:2 t:1 l:48 rid:200.0.0.117 aid:0.0.0.0 chk:6AB2 aut:0 auk: Router#debug ip ospf packet OSPF: rcv. v:2 t:1 l:48 rid:200.0.0.116 aid:0.0.0.0 chk:0 aut:2 keyid:1 seq:0x0
Displays router interaction during the hello, exchange, and flooding processes
Summary
OSPF is an interior gateway protocol similar to IGRP, but based on link states rather than distance vectors. OSPF advertises information about each of its links rather than sending routing table updates like a distance vector protocol. The SPF algorithm places each router at the root of a tree and calculates the shortest path to each destination based on the cumulative cost required to reach that destination.
ICND v2.05-52
Summary (Cont.)
Use the router ospf command to start an OSPF routing process and the network command to associate addresses to an OSPF area. You can use any one of a number of show commands to display information about an OSPF configuration. To display information on OSPF-related events, such as adjacencies, flooding information, designated router selection, and SPF calculation, use the debug ip ospf events privileged EXEC command.

25.6 Enabling OSPF

Enviado por

Dados do documento

Descrição original:

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

25.6 Enabling OSPF

Enviado por

Direitos autorais:

Formatos disponíveis

2002, Cisco Systems, Inc. All rights reserved.

2002, Cisco Systems, Inc. All rights reserved.

2002, Cisco Systems, Inc. All rights reserved.

OSPF terminology: Links

2002, Cisco Systems, Inc. All rights reserved.

OSPF terminology: Link state

2002, Cisco Systems, Inc. All rights reserved.

2002, Cisco Systems, Inc. All rights reserved.

OSPF terminology: Link Cost

2002, Cisco Systems, Inc. All rights reserved.

OSPF terminology: Adjacency database

OSPF terminology: Link-state database

OSPF terminology: Routing table

Lists neighbors Lists all routes

Lists best routes

OSPF terminology: DR and BDR router

2002, Cisco Systems, Inc. All rights reserved.

Comparing OSPF with distance vector routing protocols

2002, Cisco Systems, Inc. All rights reserved.

Support for VLSM

Shortest path algorithm

The best path is the lowest cost path.

Shortest Path First Tree for node B

OSPF network types

2002, Cisco Systems, Inc. All rights reserved.

OSPF network types: Fourth type

2002, Cisco Systems, Inc. All rights reserved.

DR and BDR receive LSAs

OSPF Hello Protocol

OSPF packet header

For the hello packet the type field is set to 1.

2002, Cisco Systems, Inc. All rights reserved.

OSPF Hello Protocol - Hello header

2002, Cisco Systems, Inc. All rights reserved.

Steps in the operation of OSPF

4. Select the appropriate routes to use.

2002, Cisco Systems, Inc. All rights reserved.

OSPF Operation in a Broadcast Multiaccess Topology

2002, 2000, Cisco Systems, Inc. All rights reserved.

Step 1: Establish router adjacencies

2002, Cisco Systems, Inc. All rights reserved.

Step 1: Establish router adjacencies (cont.)

* Entry must match on neighboring routers

Step 2: Electing the DR and BDR (if necessary).

Step 3: Discover routes

On difference network have differ discover process.

I am router ID 172.16.5.1 and I see no one.

Router B Neighbors List 172.16.5.1/24, int E1

I am router ID 172.16.5.2, and I see 172.16.5.1.

2002, Cisco Systems, Inc. All rights reserved.

Step 3: Discover routes (cont.)

Here is a summary of my link-state database.

Here is a summary of my link-state database.

2002, Cisco Systems, Inc. All rights reserved.

Step 3: Discover routes (cont.)

Thanks for the information! Loading State

I need the complete entry for network 172.16.6.0/24.

Here is the entry for network 172.16.6.0/24.

LSAck Thanks for the information!

Step 4: Choosing Routes

Cost=6 Cost=1 Cost=10

This is the best route to 10.3.3.0.

Step 5: Maintaining Routing Information