CCNA Exploration 2: Chapter 10 toets antwoorden / CCNA Routing Protocols

and Concepts exam 10 answers

CCNA Exploration 2: Routing Protocols and Concepts Chapter 10 Exam Answers
1. What are some of the advantages of using a link-state routing protocol instead of a distance
vector routing protocol? (Choose two.)
The topology dataase eliminates the need for a routing tale.
!re"uent periodic updates are sent to minimi#e the numer of incorrect routes in the topological
dataase.
$outers have direct knowledge of all links in the network and how they are connected.
%fter the inital &'% flooding( they generally re"uire less andwidth to communicate changes in
a topology.
&ink-state protocols re"uire less router processor power than distance vector protocols.
). When are link-state packets sent to neighors?
every *+ seconds
every 1,+ seconds
after the holddown time e-pires
when a link goes up or down
when a routing loop occurs
*. Why is it difficult for routing loops to occur in networks that use link-state routing?
.ach router uilds a simple view of the network ased on hop count.
$outers flood the network with &'%s to discover routing loops.
.ach router uilds a complete and synchroni#ed view of the network.
$outers use hold-down timers to prevent routing loops.
/. $efer to the e-hiit. When $outer 0 is configured to use a link-state routing protocol and is
added to the network( what is the first thing that it does to egin learning the network topology?
1t sends &'2 packets to $outers 3 and C.
1t sends &'2 packets to all routers in the network.
1t sends 4ello packets to all routers in the network.
1t sends information aout its directly connected neighors to $outers % and ..
1t sends information aout its directly connected neighors to all routers in the network.
1t learns aout its directly connected networks when its interfaces reach the up state.
5. What two events will cause a link state router to send &'2s to all neighors? (Choose two.)
*+ second timer e-pires
whenever the network topology changes
1 | P a g e
immediately after the 3ellman-!ord algorithm has run
immediately after the 06%& !'7 has uilt the topology dataase
upon initial startup of router or routing protocol
8. What speeds up convergence in a network using link-state routing?
updates triggered y network changes
updates sent at regular intervals
updates sent only to directly connected neighors
updates that include complete routing tales
9. To achieve network convergence( what three steps does each link state router take? (Choose
three.)
use automatic summari#ation to reduce the si#e of routing tales
uild a &ink 'tate 2acket (&'2) containing the state of each directly connected link
flood the &'2 to all neighors( who then store all &'2s received in a dataase
discover neighors and estalish ad:acencies using the hello packet sent at regular intervals
construct a complete map of the topology and compute the est path to each destination network
use the 06%& !'7 to select efficient( loop-free paths( and insert routes into the routing tale
,. % new network administrator is given the task of selecting an appropriate dynamic routing
protocol for a software development company. The company has over 1++ routers( uses C10$
and ;&'7( re"uires fast convergence( and uses oth Cisco and non-Cisco e"uipment. Which
routing protocol is appropriate for this company?
$12 version )
1<$2
.1<$2
='2!
3<2
>. Which dataase or tale must e identical on all link-state routers within an area in order to
construct an accurate '2! tree?
routing tale
ad:acency tale
link-state dataase
neighor tale
topology dataase
1+. $efer to the e-hiit. What does ?%@ do with link-state packets from =$&?
2 | P a g e
sends out its updated routing tale to oth =$& and 3=' routers
sends out the individual link-state packets out the interface connected to 3='
"ueries 3=' to see if it has a etter route
only adds it to the local routing tale and performs no other actions
11. What feature do modern link-state protocols provide to minimi#e processing and memory
re"uirements?
splitting routing topologies into smaller areas
assigning lower process priorities to route calculations
using update timers to restrict routing updates
strict split hori#on rules to reduce routing tale entries
1). What two statements correctly descrie the link state routing process? (Choose two.)
each router in the area floods &'2s to all neighors
all routers in the area have identical link state dataases
&'2s use the reserved multicast address of ))/.+.+.1+ to reach neighors
routing loops are prevented y running the 0iffusing 6pdate %lgorithm (06%&)
$eliale Transport 2rotocol ($T2) is the protocol used y for the delivery and reception of &'2s
1*. $efer to the e-hiit. Which statement correctly descries the path traffic would take from the
1+.+.+.+A)/ network to the 1>).18,.1.+A)/ network if a link-state routing protocol was in use?
3=' -B %T& ecause this path is the least hops
3=' -B %T& ecause this path is highest cost
3=' -B =$& -B ?%@ -B %T& ecause this path is the lowest cost
traffic would load alance across all links
1/. $efer to the e-hiit. What kind of information would e seen in an &'2 sent from router ?%@
to router %T&?
hop count
3 | P a g e
uptime of the route
cost of the link
a list of all the routing protocols in use
15.What action does a link-state router take immediately upon receipt of an &'2 from a
neighoring router?
floods the &'2 to neighors
calculates the '2! algorithm
runs the 3ellman-!ord algorithm
computes the est path to the destination network
18. What is the final step in the link state routing process?
successors are placed into the routing tale
'2! computes est path to each destination network
&'2s are flooded to all neighors to converge the network
06%& algorithm is run to find est path to destination networks
19. Which algorithm is run y link-state routing protocols to calculate the shortest path to
destination networks?
06%&
0i:kstra
3ellman-!ord
0iffie-4ellman
1,. $efer to the e-hiit. 1f all routers and interfaces are configured to use a link-state routing
protocol( from which routers will router 0 receive hello packets?
% and .
3 and C
%( 3( C( and .
C only
1>. Which two routing protocols use 0i:kstraCs shortest path first algorithm? (Choose two.)
$12v1
$12v)
1'-1'
3<2
.1<$2
='2!
4 | P a g e