Chapter 1 - Single Area OSPFv2 Concepts Flashcards
OSPFv2 is for…
OSPFv3 is for…
…IPv4
…IPv6
What protocol is a link state protocol developed as an alternative for the distance vector RIP? It offers faster convergence and scales well.
OSPF
what is used to determine best path to destination in OSPF
Cost
OSPF link-state info includes:
network prefix, prefix length and cost
What 5 packet types does OSPF use to convey routing info and used to discover neighboring routing and exchange routing info to maintain accurate info about the network?
- Hello Packet
- Database Description (DBD) Packet
- Link-State Request (LSR) Packet
- Link-State Update (LSU) Packet
- Link-State Acknowledgement (LSA) Packet
OSPF messages are used to create and maintain 3 OSPF databases, what are they and what is created
- Adjacency Database - creates the neighbor table
- Link-State Database - creates the topology table
- Forwarding Database - creates the routing table
which OSPF database lists all neighbor routers that established bidirectional communication?
What CLI command is used to see this database?
Adjacency Database
show ip ospf neighbor
which OSPF database represents the network topology?
What CLI command is used to see this database?
Link-State Database (LSDB)
show ip ospf database
what OSPF database contains the list of routes that is generated when an algorithm is run on the link-state database?
What CLI command is used to see this database?
Forwarding Database
show ip route
What algorithm is the topology table built through?
Dijkstra Shortest-path First (SPF) - cumulative cost to reach a destination
Link-State routing steps completed by a router: Step 1. Establish Neighbor Adjacencies
OSPF-enabled router sends HELLO packets out on all OSPF-enabled interfaces to see if neighbors are present on those links. If yes, router attempts to establish neighbor adjacencies with that neighbor
Link-State routing steps completed by a router: Step 2. Exchange Link-State Advertisements (LSA)
After neighbor adjacencies are established, routers exchange LSA - contains state and cost of each directly connected link. Neighbors receiving LSA immediately flood the LSA to other directly connected neighbors.
Link-State routing steps completed by a router: Step 3. Build the Link State Database (LSDB)
LSDB is built based on LSA received
Link-State routing steps completed by a router: Step 4. Execute SPF Algorithm
SPF algorithm creates the SPF tree that is used to calculate the shortest path to each node
Link-State routing steps completed by a router: Step 5. Choose the Best Route
Best paths to each network are offered to IP routing table. Routing decisions are made based on entries in routing table