Sie sind auf Seite 1von 2

Open Shortest Path First (Dijkstra Algorithm) - classless, link-state routing pr

otocol as a replacement for RIP.


***Hop count doesn't scale well in larger networks with multiple paths of varyin
g speeds.
OSPFv2 - IPv4; OSPFv3 - IPv6
Internet Engineering Task Force OSPF Working Group - 1987
Features:
1. AD - 110
2. Classless - supports VLSM and CIDR
3. Efficient - routing changes trigger routing updates
4. Fast Convergence - quickly propagates network changes
5. Scalable - works in small and large network sizes.
6. Secure - supports Message Digest 5 authentication. OSPF routers only accept e
ncrypted routing updates from peers with same pre-shared password.
Components:
1. Data Structures
a. Adjacency db - neighbor table; unique for each router; show ip ospf neighbor
b. Link-state db - info about all other routers in the network; topology table;
show ip ospf database
c. Forwarding db - routing table; show ip route
2.
a.
b.
c.
d.
e.

Routing Protocol Messages


Hello packet
Database description packet
Link-state request packet
Link-state update packet
Link-state acknowledgmerit packet

3. Algorithm - Dijkstra's Algorithm


Link-state Routing Process:
Step 1. Establish Neighbor Adjacencies - send Hello packets
Step 2. Exchange Link-State Advertisements - state and cost of each C link.
Step 3. Build the Topology Table - LSDB
Step 4. Execute the SPF Algorithm
Step 5. SPF tree
Step 6. The best paths are inserted into the routing table.
Implementation of OSPF:
OSPF area - group of routers that share same link-state info in LSDBs.
Area 0 - backbone area
1. Single-Area OSPF - all routers in one area called Area 0
2. Multiarea OSPF - Multiple areas, in hierarchal fashion. All are connected to
Area 0.
Area Border Routers - interconnecting routers.
***CPU-intensive
Advantages
1. Smaller
2. Reduced
3. Reduced

of Multiarea OSPF:
routing tables
link-state update overhead
frequency of SPF calculations

OSPF Messages Information:


1. Data Link Frame Header
2. IP Packet Header

3. OSPF Packet Header


4. OSPF Packet Type-Specific Db
0x01 Hello - discovers neighbors
0x02 Db Description - checks for db sync
0x03 Link State Request
0x04 Link State Update - send requested link-state records
0x05 Link State Acknowledgment - acknowledges other packet types
Hello Packets:
*Elect the Designated Router and Backup Designated Router on multiaccess network
s.
Router ID - 32-bit dotted decimal notation (IPv4 address)
10 seconds - multiaccess and P2P networks
30 seconds - nonbroadcast multiaccess networks
Dead Interval - router waits to receive Hello packet before declaring the neighb
or down.
Cisco uses a default of 4 times the Hello interval:
40 seconds (default on multiaccess and point-to-point networks)
120 seconds (default on NBMA networks; for example, Frame Relay)
Transitioning Through OSPF States:
Establish (Step 1-3)
Step 1. Down State - No Hello
Step 2. Init State - Hello from neighbor; Contain sending router's Router ID
Step 3. Two-Way State - Elect a DR and BDR
Synchronize OSPF Db (Step 4-6)
Step 4. ExStart State - Negotiate master/slave relationship and DBD packet seq.
no.
Step 5. Exchange State - Routers exchange DBD packets. If additional router info
, Step 6, else Step 7
Step 6. Loading State - LSRs and LSUs used to gain info
Step 7. Full State - Routers have converged
Router ID:
-Uniquely identify the router
-Participate in the election of the DR
Wildcard Mask - 32 binary digits
bit 0 - matches the corresponding bit value in the address
bit 1 - ignores the corresponding bit value in the address

Das könnte Ihnen auch gefallen