1. What action does a link-state router take immediately
upon receipt of an LSP from a neighboring router?
floods the LSP to neighbors
2. Why is it difficult for routing loops to occur in
networks that use link-state routing?
Each router builds a complete and synchronized view of the
network.
3. Refer to the exhibit. What kind of information would be
seen in an LSP sent from router JAX to router ATL?
cost of the link
4. To achieve network convergence, what three steps does
each link state router take? (Choose three.)
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
construct a complete map of the topology and compute the
best path to each destination network
5. Refer to the exhibit. When Router D is configured to use
a link-state routing protocol and is added to the network, what is the first
thing that it does to begin learning the network topology?
It learns about its directly connected networks when its
interfaces reach the up state.
6. A new network administrator is given the task of
selecting an appropriate dynamic routing protocol for a software development
company. The company has over 100 routers, uses CIDR and VLSM, requires fast
convergence, and uses both Cisco and non-Cisco equipment. Which routing
protocol is appropriate for this company?
OSPF
7. What two events will cause a link state router to send
LSPs to all neighbors? (Choose two.)
whenever the network topology changes
upon initial startup of router or routing protocol
8. What is the final step in the link state routing process?
SPF computes best path to each destination network
9. Refer to the exhibit. What does JAX do with link-state
packets from ORL?
sends out the individual link-state packets out the
interface connected to BOS
10. What two statements correctly describe the link state
routing process? (Choose two.)
each router in the area floods LSPs to all neighbors
all routers in the area have identical link state databases
11. Which database or table must be identical on all
link-state routers within an area in order to construct an accurate SPF tree?
link-state database
12. Refer to the exhibit. Which statement correctly
describes the path traffic would take from the 10.0.0.0/24 network to the
192.168.1.0/24 network if a link-state routing protocol was in use?
BOS -> ORL -> JAX -> ATL because this path is the
lowest cost
13. What feature do modern link-state protocols provide to
minimize processing and memory requirements?
splitting routing topologies into smaller areas
14. What speeds up convergence in a network using link-state
routing?
updates triggered by network changes
15. Which algorithm is run by link-state routing protocols
to calculate the shortest path to destination networks?
Dijkstra
16. What are some of the advantages of using a link-state
routing protocol instead of a distance vector routing protocol? (Choose two.)
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.
17. Refer to the exhibit. If all routers and interfaces are
configured to use a link-state routing protocol, from which routers will router
D receive hello packets?
B and C
18. Which two routing protocols use Dijkstra’s shortest path
first algorithm? (Choose two.)
IS-IS
OSPF
19. When are link-state packets sent to neighbors?
when a link goes up or down
20. What are two advantages of using a link-state routing
protocol instead of a distance vector routing protocol? (Choose two.)
Each router independently determines the route to each
network.
After the inital LSP flooding, they generally require less
bandwidth to communicate changes in a topology.
21. To achieve network convergence, what three steps does
each link state router take? (Choose three.)
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
construct a complete map of the topology and compute the
best path to each destination network
CCNA 2 Chapter 10 Answers |
No comments:
Post a Comment