CCNA Routing Protocols & Concepts. Chapter 10: Link-State Routing Protocols.
It sends LSP packets to Routers B and C.
It sends LSP packets to all routers in the network.
It sends information about its directly connected neighbors to Routers A and E.
It sends information about its directly connected neighbors to all routers in the network.
It learns about its directly connected networks when its interfaces reach the up state.
30 second timer expires
Whenever the network topology changes
Immediately after the Bellman-Ford algorithm has run
Immediately after the DUAL FSM has built the topology database
Upon initial startup of router or routing protocol
Successors are placed into the routing table
SPF computes best path to each destination network
LSPs are flooded to all neighbors to converge the network
DUAL algorithm is run to find best path to destination networks
Each router in the area floods LSPs to all neighbors
All routers in the area have identical link state databases
LSPs use the reserved multicast address of 224.0.0.10 to reach neighbors
Routing loops are prevented by running the Diffusing Update Algorithm (DUAL)
Reliable Transport Protocol (RTP) is the protocol used by for the delivery and reception of LSPs
Hop count
Uptime of the route
Cost of the link
A list of all the routing protocols in use
Splitting routing topologies into smaller areas
Assigning lower process priorities to route calculations
Using update timers to restrict routing updates
Strict split horizon rules to reduce routing table entries
Use automatic summarization to reduce the size of routing tables
Build a Link State Packet (LSP) containing the state of each directly connected link
Flood the LSP to all neighbors, who then store all LSPs received in a database
Discover neighbors and establish adjacencies using the hello packet sent at regular intervals
Construct a complete map of the topology and compute the best path to each destination network
Updates triggered by network changes
Updates sent at regular intervals
Updates sent only to directly connected neighbors
Updates that include complete routing tables
Each router builds a simple view of the network based on hop count.
Routers flood the network with LSAs to discover routing loops.
Each router builds a complete and synchronized view of the network.
Routers use hold-down timers to prevent routing loops.
The topology database eliminates the need for a routing table.
Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.
Routers have direct knowledge of all links in the network and how they are connected.
After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology.
Link-state protocols require less router processor power than distance vector protocols.
DUAL
Dijkstra
Bellman-Ford
Diffie-Hellman
Moores Law
BOS -> ATL because this path is the least hops
BOS -> ATL because this path is highest cost
BOS -> ORL -> JAX -> ATL because this path is the lowest cost
Traffic would load balance across all links
Routing table
Adjacency table
Link-state database
Neighbor table
Topology database
RIPv1
RIPv2
IS-IS
BGP
OSPF
Every 30 seconds
Every 180 seconds
After the holddown time expires
When a link goes up or down
When a routing loop occurs
Sends out its updated routing table to both ORL and BOS routers
Sends out the individual link-state packets out the interface connected to BOS
Queries BOS to see if it has a better route
Only adds it to the local routing table and performs no other actions
RIP version 2
IGRP
EIGRP
OSPF
BGP
Floods the LSP to neighbors
Calculates the SPF algorithm
Runs the Bellman-Ford algorithm
Computes the best path to the destination network
A and E
B and C
A, B, C, and E
C only
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Wait!
Here's an interesting quiz for you.