Day 14 - OSPF Operation Flashcards
The data portion of an OSPF message is encapsulated in a __________
Packet
In the IP packet header, the protocol field is to set to what number to indicate OSPF?
89
What are the destination multicast addresses for OSPF?
224.0.0.5
224.0.0.6
What are 5 types of OSPF Packets?
Hello
DBD
LSR
LSU
LSAck
Solve for definition of OSPF packet type:
These packets establish and maintain adjacency with other OSPF routers
OSPF hello packets
Solve for definition of OSPF packet type:
This type of packet contains an abbreviated list of the sending router’s link state database. Receiving routers use it to check against the local link-state database
DBD (Database Descriptor Packets)
Solve for definition of OSPF packet type:
Receiving routers can request more information about any entry in the DBD by sending these types of packets
Link-state requests
Solve for definition of OSPF packet type:
These types of packets reply to LSRs and announce new information. These types of packets contain 11 types of LSAs
LSU (Link-state updates)
Solve for definition of OSPF packet type:
When an LSU is received, the router sends this type of packet to confirm receipt of the LSU
LSAck
Full adjacency occurs when two routers have exchanged any necessary __________ and have identical __________ __________?
LSUs
Link-state databases
What types of OSPF packets are used for routing updates?
LSUs (Link-state updates)
What do LSU’s contain within them?
LSA (Link-state advertisements)
An LSU contains one or more what?
LSA
What is the solution to managing the number of adjacencies and the flooding of LSAs on a multiaccess network?
Electing a DR and BDR
The __________ router is responsible for updating all other OSPF routers when a change occurs in the multiaccess network
Designated
All other routers other than DR and BDRs become this
DROTHERs
Each OSPF router maintains a link-state database containing the what received from all other routers
LSAs (Link-state advertisements)
OPSF uses Dijkstra’s algorithm to create a what?
An SPF tree
After the Dijkstra algorithm builds the SPF tree and and calculates cost along each path from source to destination, the SPF tree is then used to populate the what?
IP routing table with best possible paths
True or false:
OSPFv2 and OPSFv3 use a different routing algorithm?
False
They both use the Dijkstra SPF algorithm
True or False:
OSPFv2 and OSPFv3 both use cost as their metric?
True