CCNA 2 Chapter 1 2011 V4.

0 Answers 100%
June 13, 2011 by admin 17 C mments

Our Sponsors CCNA 2 Chapter 1 2011 V4.0 Answers 100% 1. If a router cannot find a valid configuration file during the startup sequence, what will occur? The startup sequence will reset. The router will prompt the user for a response to enter setup mo e. The startup sequence will halt until a !ali confi"uration file is acquire . The router will "enerate a efault confi"uration file #ase on the last !ali confi"uration. The router will monitor local traffic to etermine routin" protocol confi"uration requirements. 2.

Refer to the exhibit. The network ad !ings fro proble The &' a not host a ?

inistrator has configured the router

with the interface I! addresses shown for the directl" connected networks. the router to hosts on the connected networks or pings ost likel" between router interfaces are not working. #hat is the The estination networ$s o not e%ist. resses on the router interfaces must #e confi"ure as networ$ a resses. resses an

The interfaces must #e ena#le with the no shut own comman . (ach interface must #e confi"ure with the cloc$ rate comman . $.

Refer to the exhibit. #hat can be concluded fro in the exhibit? %&hoose two.' This router onl) has two interfaces. The router interfaces are not operational )et.

the routing table output

This router is confi"ure to forwar pac$ets to remote networ$s. The *ast(thernet0+0 an Serial0+0+0 interfaces of this router were confi"ure with an &' a ress an the no shut own comman . ress of 1,-.1-.,.1 will #e An &' pac$et recei!e #) this router with a estination a forwar e out of the Serial0+0+0 interface. (. Refer to the exhibit. The fra this fra e? %&hoose two.' estination &' a ress in the pac$et #efore e shown in the exhibit was received b" the router. The router interfaces are operational. )ow will the router process The router will chan"e the source an forwar in" the frame. The router will chan"e the frame t)pe to one supporte #) the .AN lin$ #efore forwar in" the frame. The router will use the estination /AC a forwar the pac$et. The router will loo$ up the /AC a a ress of the S0+0+0 interface in the A0' ta#le an it to the frame #efore forwar in". ress to etermine which interface to

The frame was recei!e on the *a0+0 interface of the router an will #e switche to the S0+0+0 interface. The frame was recei!e on the S0+0+0 interface of the router an will #e switche to the *a0+0 interface.

*. !asswords can be used to restrict access to all or parts of the &isco I+,. ,elect the VT1 interface console interface (thernet interface secret (2(C mo e pri!ile"e (2(C mo e router confi"uration mo e -. #hich two state %&hoose two.' 0A/ permanentl) stores the confi"uration file use NV0A/ stores a #ac$up cop) of the &OS use urin" the #oot sequence. 0O/ contains ia"nostics e%ecute on har ware mo ules. urin" the #oot sequence. *lash memor) oes not lose its contents urin" a re#oot. 0O/ contains the most current an most complete !ersion of the &OS. *lash contains #oot s)stem comman s to i entif) the location of the &OS .. ents correctl" describe the co ponents of a router? odes and interfaces that can be protected with passwords. %&hoose three.'

Refer to the exhibit. /fter host 2 is connected to the switch on the 0/1, host 2 is unable to co proble ? unicate with host 1. #hat is the cause of this

The su#net mas$ of host 2 is incorrect. 3ost 1 an host 2 are on ifferent networ$s. The switch nee s an &' a The &' a router. ress that is not confi"ure . The router 4AN interface an host 1 are on ifferent networ$s. ress of host 1 is on a ifferent networ$ than is the 4AN interface of the

2. #hich are functions of a router? %&hoose three.' pac$et switchin" e%tension of networ$ se"ments se"mentation of #roa cast omains selection of #est path #ase on lo"ical a election of #est path #ase on ph)sical a 3. ressin" ressin"

Refer to the exhibit. /ll routers have a route in its routing table to each network that is shown in the exhibit. 4efault routes have not been issued on these routers. #hat can be concluded about how packets are forwarded in this network? %&hoose two.' &f 0outerC recei!es a pac$et that is estine for 10.5.1.16 it will #e forwar e out interface *a0+0. &f 0outerA recei!es a pac$et that is estine for 1,2.17-.8.1476 it will #e forwar e out interface S0+0+1. &f 0outer9 recei!es a pac$et that is estine for 10.5.2:.156 it will #e forwar e out interface S0+0+1. &f 0outer9 recei!es a pac$et that is estine for 1:2.20.255.16 it will #e forwar e out interface S0+0+0. &f 0outerC recei!es a pac$et that is estine for 1,2.17.5.1016 it will #e forwar e out interface S0+0+1. 15.

The serial connection shown in the graphic needs to be configured. #hich configuration co ands ust be ade on the ,"dne" router to establishconnectivit" with the 6elbourne site? %&hoose three.' S) ne);confi"<if=> ip address 251.155.*$.2 2**.2**.2**.5 S) ne);confi"<if=> no shutdown S) ne);confi"<if=> ip address 251.155.*$.1 2**.2**.2**.22( S) ne);confi"<if=> clock rate *-555 S) ne);confi"<if=> ip host 6elbourne 251.155.*$.2 11.

Refer to the exhibit. #hat can be concluded fro running7configuration of a router? The passwor s are encr)pte . The current confi"uration was sa!e to NV0A/.

the output of the

The confi"uration that is shown will #e the one use on the ne%t re#oot. The comman s that are ispla)e 12. etermine the current operation of the router.

Refer to the exhibit. )ost / pings host 8. #hen R( accepts the ping into the 9thernet interface, what two pieces of header infor included? %&hoose two.' source &' a source &' a ress? 1,2.17-.10.12, ress? 9999.8888.57:: ress? 1,2.17-.10.88 ress? 1,2.17-.10.184 ress? ,,,,.@A@C.1284 e of entering these co ands? ation are

estination &' a estination &' a

estination /AC a

1$. #hat is the outco 01;confi"<line=> login

01;confi"=> line vt" 5 ( 01;confi"<line=> password check12$ ensures that a passwor is entere #efore enterin" user (2(C mo e sets the passwor to #e use for connectin" to this router !ia Telnet requires chec$128 to #e entere #efore the confi"uration can #e sa!e creates a local user account for lo""in" in to a router or switch 1(. #hich of the following is the correct flow of routines for a router startup? loa #ootstrap6 loa &OS6 appl) confi"uration loa #ootstrap6 appl) confi"uration6 loa &OS loa &OS6 loa #ootstrap6 appl) confi"uration6 chec$ har ware chec$ har ware6 appl) confi"uration6 loa #ootstrap6 loa &OS 1*. #hat three processes does a router execute when it receives a packet fro one network that is destined for another network? %&hoose three.' ress in the &' 3ea er to loo$ up the ne%t<hop a ress in ecapsulates the 4a)er 8 pac$et #) strippin" off the 4a)er 2 frame hea er uses the estination /AC A the routin" ta#le lea!es the 4a)er 2 frame hea er intact when ecapsulatin" the 4a)er 8 pac$et

uses the estination &' A routin" ta#le

ress in the &' hea er to loo$ up the ne%t<hop a

ress in the

encapsulates the 4a)er 8 pac$et into the new 4a)er 2 frame an forwar s it out the e%it interface encapsulates the 4a)er 8 pac$et into a special 4a)er 1 frame an forwar s it to the e%it interface 1-. The network ad use? strai"ht<throu"h rollo!er cross<o!er serial 1.. #hich two state %&hoose two.' 4oa #alancin" occurs when a router sen s the same pac$et to ifferent estination networ$s. 4oa #alancin" occurs when a router sen s the same pac$et to ifferent estination networ$s. 4oa #alancin" allows a router to forwar pac$ets o!er multiple paths to the same estination networ$. Anequal cost loa #alancin" is supporte #) (&B0'. &f multiple paths with ifferent metrics to a estinations e%ist6 the router cannot support loa #alancin". 12. #hat infor gathered fro ation about the router and its startup process can be the output of the show version co and? %&hoose three.' ents describe characteristics of load balancing? inistrator needs to connect two routers directl" via inistrator their :ast9thernet ports. #hat cable should the network ad

the last restart metho the comman #uffer contents the amount of NV0A/ an *4AS3 use the confi"uration re"ister settin"s the location from where the &OS loa e 13.

#hich interfaces in the exhibit could be used for a leased line #/1 connection? %&hoose two.' 1 2 8 4 5 7 25. :ro 0A/ T*T' ser!er NV0A/ setup routine *lash memor) terminal 21. / network ad Router1. #hich co changes to 1<R/6? 0outer1> cop" running7config flash 0outer1;confi"=> cop" running7config flash 0outer1> cop" running7config startup7config 0outer1;confi"=> cop" running7config startup7config 0outer1> cop" startup7config running7config 0outer1;confi"=> cop" startup7config running7config inistrator has ;ust entered new configurations into and should be executed to save configuration what location can a router load the &isco I+, during the boot process? %&hoose two.'

22. #hat is the default sequence for loading the configuration file? NV0A/6 *4AS36 0O/ *4AS36 T*T'6CONSO4( NV0A/6 T*T'6 CONSO4( *4AS36 T*T'6 0O/ 2$. #hat header address infor infor infor ation it receives fro ation is trans ress ress ress ress ress ress ation does a router change in the an attached 9thernet interface before

itted out another interface?

onl) the 4a)er 2 source a onl) the 4a)er 8 source a the 4a)er 2 source an the 4a)er 8 source an

onl) the 4a)er 2 estination a onl) the 4a)er 8 estination a

estination a estination a

OCT

Examen CCNA2 v4.0 Captulo 1

!"amen CCNA2 #4.0 Cap$tu% 1 1. C nsu%te %a presenta&i'n. (espu)s de *ue e% h st 2 es & ne&tad a% swit&h de %a +AN, est, inhabi%itad para & muni&arse & n e% h st 1. -Cu,% es %a &ausa de este pr b%ema. a. +a m,s&ara de subred de% h st 2 es in& rre&ta. b. El host 1 y el host 2 se encuentran en redes diferentes. &. !% swit&h ne&esita una dire&&i'n /0 *ue n est, & n1i2urada. d. +a inter1a3 +AN de% r uter y e% h st 1 se en&uentran en redes di1erentes. e. +a dire&&i'n /0 de% h st 1 se en&uentra en una red di1erente *ue %a *ue se en&uentra %a inter1a3 +AN de% ru ter. 2. 4i un r uter n en&uentra un ar&hi# #,%id de & n1i2ura&i'n durante %a se&uen&ia de ini&i , -*u) &urre. a. 4e #ue%#e a ini&iar %a se&uen&ia de ini&i . b. El router le indicar al usuario que d una respuesta para entrar en el modo de configuracin. &. +a se&uen&ia de ini&i se detiene hasta *ue se ad*uiere un ar&hi# de & n1i2ura&i'n #,%id . d. !% r uter 2enera un ar&hi# de & n1i2ura&i'n p r de1e&t a partir de %a 5%tima & n1i2ura&i'n #,%ida. e. !% r uter m nit rea e% tr,1i& % &a% para determinar % s re*uisit s de %a & n1i2ura&i'n de pr t & % de enrutamient . 3. C nsu%te %a presenta&i'n. -A *u) & n&%usi'n se puede %%e2ar a% bser#ar %a tab%a de enrutamient de %a presenta&i'n. 6!%i7a d s p&i nes8. a. !ste r uter s'% tiene d s inter1a&es. b. +as inter1a&es de% r uter a5n n est,n perati#as. &. !ste r uter est, & n1i2urad para reen#iar pa*uetes a redes rem tas. d. Las interfaces FastEthernet0/0 y erial0/0/0 de este router fueron configuradas con una direccin !" y el comando no shutdo#n. e. $n paquete !" reci%ido por el router con una direccin de destino de 1&'.1'.&.1 ser reen(iado fuera de la interfa) erial0/0/0. 4. -9u) in1 rma&i'n de dire&&i'n de en&abe3ad &ambia un r uter en %a in1 rma&i'n *ue re&ibe desde una inter1a3 !thernet & ne&tada antes de *ue se transmita %a in1 rma&i'n a tra inter1a3. a. s'% %a dire&&i'n ri2en de Capa 2 b. s'% %a dire&&i'n destin de Capa 2 &. s'% %a dire&&i'n ri2en de Capa 3 d. s'% %a dire&&i'n destin de Capa 3 e. la direccin origen y destino de *apa 2 1. %a dire&&i'n ri2en y destin de Capa 3 :. -Cu,%es s n %as 1un&i nes de un r uter. 6!%i7a tres p&i nes8. a. conmutacin de paquetes b. e"tensi'n de se2ment s de red &. segmentacin de los dominios de %roadcast d. seleccin de la me+or ruta %asada en un direccionamiento lgico e. se%e&&i'n de %a me7 r ruta basada en un dire&&i namient 1$si& ;. !% administrad r de red ne&esita & ne&tar d s r uters dire&tamente a tra#)s de sus puert s <ast!thernet. -9u) &ab%e debe uti%i3ar e% administrad r de red.

a. dire&t 6strai2ht=thr u2h8 b. transpuest &. de cone,in cru)ada d. seria% 7. >n administrad r de red a&aba de in2resar nue#as & n1i2ura&i nes a% ? uter 1. -9u) & mand s se deben e7e&utar para 2uardar % s &ambi s en %a & n1i2ura&i'n a NV?A@. a. ? uter1A & py runnin2=& n1i2 1%ash b. ? uter16& n1i28A & py runnin2=& n1i2 1%ash &. ? uter1A & py runnin2=& n1i2 startup=& n1i2 d. -outer1.config/0 copy running1config startup1config e. ? uter1A & py startup=& n1i2 runnin2=& n1i2 1. ? uter16& n1i28A & py startup=& n1i2 runnin2=& n1i2 B. C nsu%te %a presenta&i'n. C d s % s r uters tienen una ruta en su tab%a de enrutamient para &ada red *ue apare&e en %a presenta&i'n. +as rutas p r de1e&t n se han emitid en est s r uters. -9u) & n&%usi'n se puede sa&ar s bre %a manera en *ue % s pa*uetes se reen#$an en esta red. 6!%i7a d s p&i nes8. a. 4i ? uterC re&ibe un pa*uete destinad a 10.:.1.1, se reen#iar, 1uera de %a inter1a3 <a0D0. b. i -outer2 reci%e un paquete con destino a 1&2.13'.4.1536 se reen(iar fuera de la interfa) 0/0/1. &. i -outer7 reci%e un paquete con destino a 10.8.29.186 se reen(iar fuera de la interfa) 0/0/1. d. 4i ? uterE re&ibe un pa*uete & n destin a 172.20.2::.1, se reen#iar, 1uera de %a inter1a3 40D0D0. e. 4i ? uterC re&ibe un pa*uete & n destin a 1F2.1;.:.101, se reen#iar, 1uera de %a inter1a3 40D0D1. F. -(esde *u) ubi&a&i'n un r uter puede &ar2ar e% /G4 de Cis& durante e% pr &es de ini&i . 6!%i7a d s p&i nes8. a. ?A@ b. er(idor :F:" &. NV?A@ d. rutina de & n1i2ura&i'n e. memoria Flash 1. termina% 10. C nsu%te %a presenta&i'n. -Cu,% es %a & n&%usi'n *ue se puede sa&ar de% resu%tad de %a & n1i2ura&i'n a&ti#a de% r uter. a. +as & ntraseHas est,n en&riptadas. b. +a & n1i2ura&i'n a&tua% se 2uard' en %a NV?A@. &. +a & n1i2ura&i'n *ue se muestra ser, %a uti%i3ada %a pr'"ima #e3 *ue se reini&ie e% r uter. d. Los comandos que se (isuali)an determinan la actual operacin del router. 11. C nsu%te %a presenta&i'n. I st A ha&e pin2 a% h st E. Cuand ?4 a&epta e% pin2 en %a inter1a3 !thernet, -*u) d s partes de %a in1 rma&i'n de en&abe3ad est,n in&%uidas. 6!%i7a d s p&i nes8. a. %a dire&&i'n /0 de ri2enJ 1F2.1;B.10.12F b. %a dire&&i'n /0 de ri2enJ EEEE.3333.:;77 &. %a dire&&i'n @AC de ri2enJ ::::.AAAA.;;;; d. %a dire&&i'n /0 de destin J 1F2.1;B.10.33 e. la direccin !" de destino; 1&2.13'.10.145 1. la direccin <2* de destino; &&&&.=2=*.1245 12. -Cu,% es e% resu%tad de in2resar est s & mand s. ?16& n1i28A %ine #ty 0 4 ?16& n1i2=%ine8A passw rd &he&K123 ?16& n1i2=%ine8A % 2in a. ase2ura *ue se in2rese una & ntraseHa antes de in2resar e% m d !L!C de% usuari

b. &. d. 13. a. b. &. d. 14.

a. b. &. d. 1:. a. b. &. d. 1;. a. b. &. d. e. 1. 17. a. b. &. d. e. 1B. a. b. &. d. e. 1. 1F.

esta%lece la contrase>a a utili)ar para conectar este router (ia :elnet re*uiere in2resar &he&K123 antes de 2uardar %a & n1i2ura&i'n &rea una &uenta de usuari % &a% para & ne&tarse a un r uter swit&h -Cu,% es %a se&uen&ia p r de1e&t para &ar2ar e% ar&hi# de & n1i2ura&i'n. NV?A@, <+A4I, ?G@ <+A4I, C<C0, CGN4G+! ?@-2<6 :F:"6 *A? ALE <+A4I, C<C0, ?G@ C nsu%te %a presenta&i'n. !% administrad r de red ha & n1i2urad e% r uter & n %a dire&&i'n /0 de inter1a3 a %a #ista para %as redes & ne&tadas dire&tamente. + s pin2s desde e% r uter a % s h sts en %as redes & ne&tadas % s pin2s entre %as inter1a&es de% r uter n est,n 1un&i nand . -Cu,% es %a &ausa m,s pr bab%e de% pr b%ema. +as redes de destin n e"isten. +a dire&&i nes /0 en %as inter1a&es de% r uter se deben & n1i2urar & m dire&&i nes de red y n & m dire&&i nes de h st. Las interfaces de%en estar ha%ilitadas con el comando no shutdo#n. Cada inter1a3 debe estar & n1i2urada & n e% & mand &% &K rate. Cu,% de %as si2uientes p&i nes es e% 1%u7 & rre&t de rutinas para e% ini&i de un r uter. cargar el %ootstrap6 cargar el !A 6 aplicar la configuracin &ar2ar e% b tstrap, ap%i&ar %a & n1i2ura&i'n, &ar2ar e% /G4 &ar2ar e% /G4, &ar2ar e% b tstrap, ap%i&ar %a & n1i2ura&i'n, #eri1i&ar e% hardware #eri1i&ar e% hardware, ap%i&ar %a & n1i2ura&i'n, &ar2ar e% b tstrap, &ar2ar e% /G4 -Cu,%es s n % s tres pr &es s *ue un r uter e7e&uta &uand re&ibe un pa*uete desde una red *ue est, destinad a tra red. 6!%i7a tres p&i nes8. desencapsula el paquete de la *apa4 eliminando el enca%e)ado de trama de la *apa 2 uti%i3a %a dire&&i'n @AC de destin en e% en&abe3ad /0 para bus&ar %a dire&&i'n de% si2uiente sa%t en %a tab%a de enrutamient de7a inta&t e% en&abe3ad de trama de %a Capa 2 &uand desen&apsu%a e% pa*uete de %a Capa 3 utili)a la direccin !" de destino en el enca%e)ado !" para %uscar la direccin del siguiente salto en la ta%la de enrutamiento encapsula el paquete de la *apa 4 en la nue(a trama de la *apa 2 y lo reen(Ba a la interfa) de salida en&apsu%a e% pa*uete de %a Capa 3 en una trama espe&ia% de %a Capa 1 y % reen#$a a %a inter1a3 de sa%ida 4e debe & n1i2urar %a & ne"i'n seria% *ue se muestra en e% 2r,1i& . -9u) & mand s de & n1i2ura&i'n deben e7e&utarse en e% r uter 4ydney para estab%e&er %a & ne&ti#idad & n e% siti de @e%b urne. 6!%i7a tres8. ydney.config1if/0 ip address 201.100.84.2 288.288.288.0 ydney.config1if/0 no shutdo#n 4ydney6& n1i2=i18A ip address 201.100.:3.1 2::.2::.2::.224 ydney.config1if/0 clocC rate 83000 4ydney6& n1i2=i18A ip h st @e%b urne 201.100.:3.2 -9u) inter1a&es en %a presenta&i'n se p dr$an uti%i3ar para una & ne"i'n MAN de %$nea arrendada. 6!%i7a d s p&i nes8. 1 2 3 5 : ; -Cu,%es s n %as d s a1irma&i nes *ue des&riben %as &ara&ter$sti&as de% ba%an&e de &ar2a. 6!%i7a d s p&i nes8.

a. b. &. d. e. 20. a. b. &. d. e. 1. 21. a. b. &. d. e. 1.

!% ba%an&e de &ar2a se pr du&e &uand un r uter en#$a e% mism pa*uete a di1erentes redes de destin . !% ba%an&e de &ar2a se pr du&e &uand se en#$a %a misma &antidad de pa*uetes a tra#)s de rutas est,ti&as y din,mi&as. El %alanceo de carga permite que el router reen(Be paquetes a la misma red de destino a tra(s de (arias rutas. E!D-" admite %alanceo de carga con distinto costo. 4i e"isten #arias rutas & n di1erentes m)tri&as a destin s, e% r uter n puede admitir ba%an&e de &ar2a. -Cu,%es s n %as d s a1irma&i nes *ue des&riben & rre&tamente % s & mp nentes de un r uter. 6!%i7a d s p&i nes8. +a ?A@ a%ma&ena de manera permanente e% ar&hi# de & n1i2ura&i'n uti%i3ad durante %a se&uen&ia de ini&i . La -A< contiene los diagnsticos e+ecutados en los mdulos de hard#are. +a NV?A@ a%ma&ena una & pia de respa%d de /G4 usad durante %a se&uen&ia de inicio. La memoria Flash no pierde sus contenidos cuando se reinicia. +a ?G@ & ntiene %a #ersi'n m,s a&tua% y m,s & mp%eta de /G4. <%ash & ntiene & mand s de% sistema de ini&i para identi1i&ar %a ubi&a&i'n de /G4. 4e pueden usar & ntraseHas para restrin2ir e% a&&es a t d parte de% Cis& /G4. 4e%e&&i ne % s m d s e inter1a&es *ue se pueden pr te2er & n & ntraseHas. 6!%i7a tres p&i nes8. interfa) @:E interfa) de consola inter1a3 !thernet m d !L!C se&ret modo EFE* pri(ilegiado m d de & n1i2ura&i'n de% r uter

*hapter 2
1.Ghich of the follo#ing is true regarding *=" and the graphic sho#nH C(0 runnin2 n ? uter ( wi%% 2ather in1 rmati n ab ut r uters A, E, C, and !. 7y default6 -outer 2 #ill recei(e *=" ad(ertisements from routers 7 and *. /1 r uters ( and ! are runnin2 di11erent r utin2 pr t & %s, they wi%% n t e"&han2e C(0 in1 rmati n. ? uter ! &an use C(0 t identi1y the /G4 runnin2 n ? uter E. 2. Ghich address can %e used to summari)e net#orCs 192.13.0.0/25 thru 192.13.9.0/25H 192.13.0.0/21 172.1;.1.0D22 172.1;.0.0 2::.2::.2::.24B 172.1;.0.0 2::.2::.2:2.0 4.

-efer to the e,hi%it. Io# #ill pacCets destined to the 192.13.0.0 net#orC %e for#ardedH -outer1 #ill perform recursi(e looCup and pacCet #ill e,it 0/0. ? uter1 wi%% per1 rm re&ursi#e % Kup and pa&Ket wi%% e"it 40D1. Chere is n mat&hin2 inter1a&e ass &iated with netw rK 172.1;.0.0 s pa&Kets wi%% be dr pped. Chere is n mat&hin2 inter1a&e ass &iated with netw rK 172.1;.0.0 s pa&Kets wi%% taKe 2ateway 1 %ast res rt and e"it ut 40D2. 5. 2 static route that points to the ne,t hop !" #ill ha(e #hat administrati(e distance and metric in the routing ta%leH administrati#e distan&e 1 0 and metri& 1 0 administrati#e distan&e 1 0 and metri& 1 1 administrati(e distance of 1 and metric of 0 administrati#e distan&e 1 1 and metri& 1 1

8. Iosts on t#o separate su%nets cannot communicate. :he net#orC administrator suspects a missing route in one of the routing ta%les. Ghich three commands can %e used to help trou%leshoot Layer 4 connecti(ity issuesH .*hoose three./ ping sh w arp traceroute sho# ip route sh w & ntr %%ers sh w &dp nei2hb r 3.

-efer to the e,hi%it. Ghich static route should %e configured on -outer1 so that host 2 #ill %e a%le to reach host 7 on the 192.13.0.0 net#orCH ip r ute 1F2.1;B.0.0 172.1;.0.0 2::.2::.0.0 ip r ute 172.1;.0.0 2::.2::.0.0 1F2.1;B.0.1 ip r ute 172.1;.0.0 2::.2::.0.0 40D0D1 ip route 192.13.0.0 288.288.0.0 0/0/0 9. Ghich of the follo#ing are displayed %y the -outer0 sho# cdp neigh%ors commandH .*hoose three./ % ad platform

re%iabi%ity holdtime local interface '. Ghy is it ad(isa%le to enter a ne,t1hop !" address #hen creating a static route #hose e,it interface is an Ethernet net#orCH Addin2 the ne"t=h p address e%iminates the need 1 r the r uter t d any % Kups in the r utin2 tab%e be1 re 1 rwardin2 a pa&Ket. !n a multi1access net#orC6 the router cannot determine the ne,t1hop <2* address for the Ethernet frame #ithout a ne,t1hop address. >sin2 a ne"t=h p address in a stati& r ute pr #ides a r ute with a % wer metri&. /n mu%ti=a&&ess netw rKs, usin2 a ne"t=h p address in a stati& r ute maKes that r ute a &andidate de1au%t r ute. &.

-efer to the e,hi%it. Ghich set of commands #ill configure static routes that #ill allo# the Ginter"arC and the 2ltamonte routers to deli(er pacCets from each L2? and direct all other traffic to the !nternetH Ginter"arC.config/0 ip route 0.0.0.0 0.0.0.0 1&2.13'.153.1 2ltamonte.config/0 ip route 10.0.245.0 288.288.288.0 1&2.13'.153.2 2ltamonte.config/0 ip route 0.0.0.0 0.0.0.0 s0/1 Minter0arK6& n1i28A ip r ute 0.0.0.0 0.0.0.0 1F2.1;B.14;.1 A%tam nte6& n1i28A ip r ute 10.0.234.0 2::.2::.2::.0 1F2.1;B.14;.2 A%tam nte6& n1i28A ip r ute 1FB.1B.222.0 2::.2::.2::.2:: s0D1 Minter0arK6& n1i28A ip r ute 172.1F1.;7.0 2::.2::.2::.0 1F2.1;B.14;.1 Minter0arK6& n1i28A ip r ute 0.0.0.0 0.0.0.0 1F2.1;B.14;.1 A%tam nte6& n1i28A ip r ute 10.0.234.0 2::.2::.2::.0 1F2.1;B.14;.2 Minter0arK6& n1i28A ip r ute 172.1F1.;7.0 2::.2::.2::.0 1F2.1;B.14;.1 A%tam nte6& n1i28A ip r ute 10.0.234.0 2::.2::.2::.0 1F2.1;B.14;.2 A%tam nte6& n1i28A ip r ute 0.0.0.0 0.0.0.0 s0D0 10. Ghat happens to a static route entry in a routing ta%le #hen the outgoing interface is not a(aila%leH :he route is remo(ed from the ta%le. Che r uter p %%s nei2hb rs 1 r a rep%a&ement r ute. Che r ute remains in the tab%e be&ause it was de1ined as stati&. Che r uter redire&ts the stati& r ute t & mpensate 1 r the % ss 1 the ne"t h p de#i&e. 11.

-efer to the e,hi%it. Di(en the output in the e,hi%it6 ho# #ould a clocC rate %e determined for this linCH Che rate w u%d be ne2 tiated by b th r uters. A rate w u%d n t be se%e&ted due t the (C!D(C! & nne&ti n mismat&h. Che rate & n1i2ured n the (C! determines the &% &K rate. :he rate configured on the =*E determines the clocC rate. 12. Ghich piece of information is a(aila%le from e,amining the output of the command sho# ip interface %riefH /nter1a&e speed and dup%e" /nter1a&e @C> !rr rs /nter1a&e @AC address !nterface !" address 14. Ghat t#o de(ices are responsi%le for con(erting the data from the G2? ser(ice pro(ider into a form accepta%le %y the routerH .*hoose t#o/. the seria% p rt 1 the r uter

a modem a swit&h the ethernet p rt 1 the r uter a * $/= $ de(ice a (C! de#i&e 15.

-efer to the e,hi%it. Ghat t#o commands are required to pro(ide connecti(ity %et#een the 1&2.13'.1.0 and 10.0.0.0 net#orCs #ithout requiring recursi(e looCupH .*hoose t#o./ 2.config/0 ip route 10.0.0.0 288.0.0.0 s 0/1/0 A6& n1i28A ip r ute 10.0.0.0 2::.0.0.0 172.1;.40.2 A 6& n1i28A ip r ute 10.0.0.0 2::.0.0.0 s 0D0D0 7.config/0 ip route 1&2.13'.1.0 288.288.288.0 s 0/0/0 E 6& n1i28A ip r ute 1F2.1;B.1.0 2::.2::.2::.0 172.1;.40.1 E6& n1i28A ip r ute 1F2.1;B.1.0 2::.2::.2::.0 s 0D1D0 18. 2 router has one static route configured to each destination net#orC. Ghich t#o scenarios #ould require an administrator to alter the static routes that are configured on that routerH .*hoose t#o./ :he destination net#orC no longer e,ists. Che destinati n netw rK is m #ed t a di11erent inter1a&e n the same r uter. Che path between the s ur&e and destinati n is up2raded with a hi2her bandwidth %inK. Che rem te destinati n netw rK inter1a&e has t be d wn 1 r 1: minutes 1 maintenan&e. 2 topology change occurs #here the e,isting ne,t1hop address or e,it interface is not accessi%le. 13. 2 net#orC administrator enters the follo#ing command into -outer1; ip route 1&2.13'.0.0 288.288.288.0 0/1/0. -outer1 then recei(es a pacCet that is destined for 1&2.13'.0.22/25. 2fter finding the recently configured static route in the routing ta%le6 #hat does -outer1 do ne,t to process the pacCetH dr ps the pa&Ket be&ause the destinati n h st is n t %isted in the r utin2 tab%e % Ks up the @AC address 1 the 40D1D0 inter1a&e t determine the destinati n @AC address 1 the new 1rame per1 rms a re&ursi#e % Kup 1 r the /0 address 1 the 40D1D0 inter1a&e be1 re 1 rwardin2 the pa&Ket encapsulates the pacCet into a frame for the G2? linC and for#ards the pacCet out the 0/1/0 interface

19.

-efer to the e,hi%it. 2 company net#orC engineer is assigned to esta%lish connecti(ity %et#een the t#o Ethernet net#orCs so that hosts on the 10.1.1.0/25 su%net can contact hosts on the 10.1.2.0/25 su%net. :he engineer has %een told to use only static routing for these company routers. Ghich set of commands #ill esta%lish connecti(ity %et#een the t#o Ethernet net#orCsH ?16& n1i28A ip r ute 10.1.2.0 2::.2::.2::.0 1F2.1;B.0.1 ?26& n1i28A ip r ute 10.1.1.0 2::.2::.2::.0 1F2.1;B.0.2

?16& n1i28A ip r ute 10.1.2.0 2::.2::.2::.0 1F2.1;B.0.2 ?26& n1i28A ip r ute 10.1.1.0 2::.2::.2::.0 1F2.1;B.0.1 -1.config/0 ip route 10.1.1.0 288.288.288.0 1&2.13'.0.2 -2.config/0 ip route 10.1.2.0 288.288.288.0 1&2.13'.0.1 ?16& n1i28A ip r ute 10.1.1.0 2::.2::.2::.0 1F2.1;B.0.1 ?26& n1i28A ip r ute 10.1.2.0 2::.2::.2::.0 1F2.1;B.0.2 ?16& n1i28A ip r ute 0.0.0.0 0.0.0.0 10.1.2.1 ?26& n1i28A ip r ute 0.0.0.0 0.0.0.0 10.1.1.1

1'.

-efer to the e,hi%it. Ghat is the significance of the /' in the route to the 10.0.0.0 net#orCH /t indi&ates that there are B h ps between this r uter and the 10.0.0.0 netw rK. /t represents the time, in mi%%ise& nds, it taKes 1 r a pin2 t rep%y when sent t the 10.0.0.0 netw rK. /t indi&ates that there are B subnets in the destinati n netw rK t whi&h the r uter &an 1 rward pa&Kets. !t indicates the num%er of consecuti(e %its6 from the left6 in the destination !" address of a pacCet that must match 10.0.0.0 to use that route. 1&.

-efer to the e,hi%it. Ghat t#o commands #ill change the ne,t1hop address for the 10.0.0.0/' net#orC from 192.13.50.2 to 1&2.13'.1.2H .*hoose t#o./ A6& n1i28A n netw rK 10.0.0.0 2::.0.0.0 172.1;.40.2 A6& n1i28A n ip address 10.0.0.1 2::.0.0.0 172.1;.40.2 2.config/0 no ip route 10.0.0.0 288.0.0.0 192.13.50.2 A6& n1i28A ip r ute 10.0.0.0 2::.0.0.0 s0D0D0 2.config/0 ip route 10.0.0.0 288.0.0.0 1&2.13'.1.2 20. Ghich t#o statements descri%e functions or characteristics of *="H .*hoose t#o./ !t starts up automatically and allo#s the de(ice to detect directly connected neigh%or de(ices that use *=". /t perates at the netw rK %ayer and a%% ws tw systems t %earn ab ut ea&h ther. /t &reates a t p % 2y map 1 the entire netw rK. !t allo#s systems to learn a%out each other e(en if different net#orC layer protocols are configured. /t 1 rwards ad#ertisements ab ut r utes 1 r 1aster & n#er2en&e. 21. :he output of the -outer0 sho# interfaces serial 0/1 command displays the follo#ing; erial0/1 is up6 line protocol is do#n. Mhat is the m st %iKe%y &ause 1 r the %ine pr t & % bein2 d wn. 4eria%0D1 is shutd wn. Chere is n &ab%e & nne&tin2 the r uters.

Che rem te r uter is usin2 seria% 0D0. ?o clocC rate has %een set.

CCNA 2 - Examen Unidad 2

CCNA 2 = !"amen >nidad 3

CCNA 2 Chapter 3 2011 V4.0 Answers 100%

June 13, 2011 by admin 10 C mments

Our Sponsors CCNA 2 Chapter 8 2011 V4.0 Answers 100% 1. #hich two state distance and ents correctl" describe the concepts of ad inistrative etric? %&hoose two.'

A ministrati!e istance refers to the trustworthiness of a particular route. A router first installs routes with hi"her a ministrati!e istances. The !alue of the a ministrati!e istance can not #e altere #) the networ$ a ministrator.

0outes with the smallest metric to a estination in icate the #est path. The metric is alwa)s etermine #ase on hop count. The metric !aries epen in" which 4a)er 8 protocol is #ein" route 6 such as &' or &'2. 2.

Refer to the exhibit. #hich state ad ent correctl" describes how R1 will deter ine the best path to R2? R1 will install a RI! route using network / in its routing table because the inistrative distance of RI! is higher than 9I=R!. 01 will install a 0&' route usin" networ$ A in its routin" ta#le #ecause the path cost from 0&' is lower than (&B0'. 01 will install an (&B0' route usin" networ$ 9 in its routin" ta#le #ecause the a ministrati!e istance of (&B0' is lower than 0&'. 01 will install an (&B0' route usin" networ$ 9 in its routin" ta#le #ecause the path cost from (&B0' is lower than 0&'. 01 will install an (&B0' route an a 0&' route in its routin" ta#le an loa #alance #etween them. $. #hich two state %&hoose two.' C sen s su#net mas$ information in routin" up ates sen s complete routin" ta#le up ate to all nei"h#ors is supporte #) 0&' !ersion 1 C allows for use of #oth 1,2.17-.1.0+80 an 1,2.17-.1.17+2- su#nets in the same topolo") re uces the amount of a (. #hich co show ip protocols show ip route ress space a!aila#le in an or"aniDation inistrator issue to deter ine if and would the network ad ents are true regarding classless routing protocols?

load balancing is in effect on a router?

show ip interface #rief show ip interface *. #hich state perio icall). OS'* is a Cisco proprietar) protocol that sen s up ates tri""ere #) topolo") chan"es. (&B0' uses @AA4 to calculate the shortest path an can #e confi"ure to o unequal cost loa #alancin". 9B' is a path !ector interior routin" protocol. -. #hich two conditions would create a setting where the use of a distance7 vector routing protocol would be efficient? %&hoose two.' the networ$ requires a special hierarchical esi"n fast con!er"ence of the networ$ is crucial the networ$ is usin" a hu# an spo$e topolo") the networ$ is usin" a flat esi"n there are more than 15 hops #etween the most istant routers .. #hat is the purpose of a routing protocol? &t is use to #uil an maintain A0' ta#les. &t pro!i es a metho for se"mentin" an reassem#lin" ata pac$ets. &t allows an a ministrator to e!ise an a &t pro!i es a proce ure for enco in" an vectorrouting protocols? The) use hop count as their onl) metric. The) onl) sen out up ates when a new networ$ is a The) floo the entire networ$ with routin" up ates. 3. #hich of the following is associated with link7state routing protocols? low processor o!erhea poison re!erse routin" loops split horiDon shortest<path first calculations 15. #h" is fast convergence desirable in networks that use d"na ic routingprotocols? e . The) sen their routin" ta#les to irectl) connecte nei"h#ors. ressin" scheme for the networ$. eco in" ata into #its for pac$et forwar in". &t allows a router to share information a#out $nown networ$s with other routers. 2. #hich of the following best describes the operation of distance ent is true regarding routing protocols? 0&' uses hop count an #an wi th as the metric for path selection an sen sup ates

0outers will not allow pac$ets to #e forwar e until the networ$ has con!er"e . 3osts are una#le to access their "atewa) until the networ$ has con!er"e . 0outers ma) ma$e incorrect forwar in" ecisions until the networ$ has con!er"e . 0outers will not allow confi"uration chan"es to #e ma e until the networ$ has con!er"e . 11. #hich of the following conditions have converged? The routers in the networ$ are operatin" with )namic routin" protocols. The routers in the networ$ are operatin" with compati#le !ersions of &OS. The routers in the networ$ are operatin" with the same routin" ta#les. The routers in the networ$ are operatin" with consistent routin" $nowle "e. 12. #hich two state ents are true regarding etrics? %&hoose two.' 0&' uses #an wi th as a metric. OS'* uses ela) as a metric. (&B0' uses #an wi th as a metric. OS'* uses cost #ase on #an wi th as a metric. 0&' uses ela) as a metric. (&B0' uses hop count onl) as a metric. 1$. #hich two state increase securit) re uce effort in confi"urin" routes the a ministrator maintains control o!er routin" easier to implement in a "rowin" networ$ re uces the chance of routin" errors increase router resource usa"e 1(. The following line of code is displa"ed in a routing table> R 253.1-*.251.5?2( @125?2A via 132.1-2.2*2.2, 55>55>1-, ,5?5?5 #hat can be concluded fro this output? A pac$et estine for host 1,2.17-.252.2 will #e forwar e out the interface connecte to networ$ 20,.175.201.0+24. The !alue6 1206 is use to etermine the #est path when a router has more than oneroutin" protocol confi"ure for the same estination networ$. This route was manuall) confi"ure usin" the ip route comman . 1,2.17-.252.2 is an interface on the router that pro uce this output. ents are true regarding the advantages of the use of staticroutes? %&hoose two'. ust be et in order for a network to

1*. #hat will be the result of the following co 2**.2**.2**.5 O04;confi"<if=> no shutdown

ands?

O04;confi"=> interface fastethernet 5?5 O04;confi"<if=> ip address 1.2.1-.$.1 The 1:2.17.8.0 networ$ will #e route #) an) )namic routin" protocol automaticall). A routin" ta#le entr) is ma e to the 1:2.17.8.0 networ$ with a co e of ECF. A static route is require to route traffic to the 1:2.17.8.0 networ$. The comman s will #e sa!e to the startup<confi"uration. 1-. /n engineer creates a static route b" entering the Router%config'B ip route15.5.5.5 2**.2**.2**.5 132.1-2.1.2 co about this route? The a ministrati!e istance of this route is 1. 1,2.17-.1.2 is the a ress of an interface on this router. ress of 1,2.17-.1.2 will #e forwar e to the This route will ispla) as a irectl) connecte networ$ in the routin" ta#le. 'ac$ets with a estination &' a 10.0.0.0+24 networ$ first. 1.. and. #hat can be concluded

Refer to the exhibit. Router1 and Router2 are running 9I=R!. /ll interfaces are operational and packets can be forwarded between all networks. #hat infor Router1? 0outer1 will ha!e 7 irectl) connecte networ$s. The a ministrati!e istance of the route to networ$ 1:2.17.0.0 will #e ,0. The metric for routes to 1:2.17.0.0 will #e 1. The interface that is use to forwar pac$ets to 1:2.17.0.0 will alwa)s #e the S0+1 interface. 12. The following line of code is present in the routing table> + 15.1-.1.5?2. @115?123A via 132.1-2.1.*, 55>55>5*, ,erial5?5?1 ation will be found in the routing table for

#hat does the nu

ber 123 indicate in this output?

The cost for this lin$ has a !alue of 12,. The cloc$ rate on this serial interface is set to 12,6000. The ne%t<hop router is 12, hops awa) from this router. This route has #een up ate 12, times in this routin" ta#le. 13. / growing ediu 7siCed anufacturing co pan" recentl" began to haverouting instabilit" issues. The co ad pan" uses static routes and has a ic routing.

ixture of over $5 &isco and non7&isco routers. The network inistrator has decided to convert the network to d"na #hat characteristics of protocols should be considered in this selection process? @istance !ector routin" protocols6 such as 0&'6 con!er"e more quic$l) than o lin$< stateroutin" protocols. (&B0' can #e use on all of the routers in the compan). OS'* can #e use #etween the routers. An e%terior routin" protocol6 such as 9B'6 is recommen e for "rowin" companies. 25.

Refer to the exhibit. If RI! is the routing protocol, what is the value of the etric fro 8 4 57 724 :24 21. / router learns two paths with equal etrics to a destination network via the RI! routing protocol. )ow will the router handle packets to the router / to network 132.1-2.*.5?2(?

destination network? The router will install the first route it learne into the routin" ta#le. The router will install #oth routes in the routin" ta#le an loa #alance #etween the two. The router will put the first route in the routin" ta#le6 an #ac$up route. The router will pic$ the path with the hi"her #an wi th an will place it in the routin" ta#le. 22. #hen #est metric lowest hop count "reatest a!aila#le #an wi th lowest a ministrati!e istance lowest cost ultiple routing protocols have a route to the sa e destination network, what deter ines which route is installed in the routing table? enote the secon route as a

CCNA 2 = !"amen >nidad 4

CCNA 2 Chapter 4 2011 V4.0 Answers 100%

June 13, 2011 by admin 12 C mments

Our Sponsors

CCNA 2 Chapter 4 2011 V4.0 Answers 100% 1.

#hat actions will occur after Router/ loses connectivit" to network 11(.12*.1-.5? %&hoose two.' 0outer9 will inclu e networ$ 128.,2.:7.0 an 187.125.-5.0 in its up ate to 0outerA. @urin" the ne%t up ate inter!al6 0outer9 will sen a 0&' up ate out #oth ports that inclu es the inaccessi#le networ$. @urin" the ne%t up ate inter!al6 0outerC will sen an up ate to 0outer9 statin" that networ$ 114.125.17.0 is accessi#le in 2 hops. 0outer C will learn of the loss of connecti!it) to networ$ 114.125.17.0 from 0outer9. 0outer9 will inclu e networ$ 128.,2.:7.0 an 187.125.-5.0 in its up ate to 0outerC. 2. #hat does a router running RI! do first with a new route that is received fro an advertise ent? e istance for the route places it imme iatel) in the routin" ta#le a Gusts the metric for the new route to show the a a !ertises this route out all other interfaces e%cept the one that it came in on sen s a pin" pac$et to !erif) that the path is a feasi#le route $.

Refer to the exhibit. If all routers are using RI!, how 1 2 8 4 5 7 (. #hich of the following incorrectrouting infor

an" rounds of

updates will occur before all routers know all networks?

ethods does split horiCon use to reduce

ation?

0outin" up ates are split in half to re uce the up ate time. &nformation learne from one source is not istri#ute #ac$ to that source. New route information must #e learne from multiple sources to #e accepte . The time #etween up ates is split in half to spee con!er"ence. New route information is suppresse until the s)stem has con!er"e . *.

Refer to the exhibit. The routers in this network are running RI!. Router / has not received an update fro Router / respond? The 3ol own timer will wait to remo!e the route from the ta#le for 70 secon s. The &n!ali timer will mar$ the route as unusa#le if an up ate has not #een recei!e in 1-0 secon s. The Ap ate timer will request an up ate for routes that were learne from 0outer 9. The 3ello timer will e%pire after 10 secon s an the route will #e flushe out of the routin"ta#le. -. Router 8 in over three inutes. )ow will

The graphic shows a network that is configured to use RI! routing protocol. Router2 detects that the link to Router1 has gone down. It then advertises the network for this link with a hop count of 1-. #hich routing loop prevention split horiDon error con ition hol < own timer route poisonin" count to infinit) .. #hich two state ents describe 9I=R!? %&hoose two.' (&B0' can #e use with Cisco an non<Cisco routers. (&B0' sen s tri""ere up ates whene!er there is a chan"e in topolo") that influences theroutin" information. (&B0' has an infinite metric of 17. (&B0' sen s a partial routin" ta#le up ate6 which inclu es Gust routes that ha!e #een chan"e . (&B0' #roa casts its up ates to all routers in the networ$. 2. #hich event will cause a triggered update? an up ate routin" timer e%pires a corrupt up ate messa"e is recei!e a route is installe in the routin" ta#le the networ$ is con!er"e 3. #hich of the following state uses a multicast a ents are correct about RI!? uses a #roa cast to up ate all other routers in the networ$ e!er) 70 secon s ress to up ate other routers e!er) ,0 secon s will sen out an up ate if there is a failure of a lin$ up ates onl) contain information a#out routes that ha!e chan"e since last up ate echanis is in effect? etric

15. #hich two state

ents are true regarding the function of the

RI!v1 routingupdates? %&hoose two'. up ates are #roa cast onl) when there are chan"es to the topolo") up ates are #roa cast at re"ular inter!als #roa cast are sent to 0.0.0.0 #roa casts are sent to 255.255.255.255 up ates contain the entire networ$ topolo") onl) chan"es are inclu e in the up ates 11. / network ad inistrator is evaluating RI! versus 9I=R! for a new ust respond network. The network will be sensitive to congestion and instead of RI! in this case? %&hoose two.' (&B0' uses perio ic up ates. (&B0' onl) up ates affecte nei"h#ors. (&B0' uses #roa cast up ates. (&B0' up ates are partial. (&B0' uses the efficient 9ellman<*or al"orithm. 12. #hich two conditions are two.' ran om Gitter implementation of classful a inconsistent routin" ta#les incorrectl) confi"ure static routes a networ$ con!er"in" too quic$l) 1$. #hat 0 15 17 224 255 1(. #hat does the RI! holddown ti ensures an in!ali route has a metric of 15 pre!ents a router from sen in" an) up ates after it has intro uce a routin" loop into the networ$ ensures e!er) new route is !ali #efore sen in" an up ate er do? etric does the RI! routing protocol consider to be infinit"? ressin" ost likel" to cause a routing loop? %&hoose

quickl" to topolog" changes. #hat are two good reasons to choose 9I=R!

instructs routers to i"nore up ates6 for a specifie time or e!ent6 a#out possi#le inaccessi#le routes 1*.

Refer to the exhibit. #hat path will packets fro active routing protocol?

the 132.1-2.1.5?2(

network travel to reach the 15.5.5.5?2 network if RI! is the The path will #e router A <H router 9 <H router C <H router (. The path will #e router A <H router @ <H router ( 0outer A will loa #alance #etween the router A <H router @ <H router ( an router A <H router 9 <H router C <H router ( path 'ac$ets will alternate paths epen in" on the or er the) arri!e at router A. 1-. Three routers running a distance7vector routing protocol lost all power, including the batter" backups. #hen the routers reload, what will happen? The) will share all routes sa!e in NV0A/ prior to the power loss with their irectl) connecte nei"h#ors. The) will multicast hello pac$ets to all other routers in the networ$ to esta#lish nei"h#or a Gacencie The) will sen up ates that inclu e onl) irectl) connecte routes to their irectl) connecte nei"h#or The) will #roa cast their full routin" ta#le to all routers in the networ 1.. #hat is a routing loop? a pac$et #ouncin" #ac$ an forth #etween two loop#ac$ interfaces on a route a con ition where a return path from a estination is ifferent from the out#oun pathformin" a EloopF a con ition where a pac$et is constantl) transmitte within a series of routers without

e!er reachin" its inten e 12. #hich state

estination

the istri#ution of routes from one routin" protocol into another ent is true regarding ciscoDs RI!EFITT9R variable? &t pre!ents the s)nchroniDation of routin" up ates #) #ufferin" the up ates as the) lea!e the router interface &t pre!ents the s)nchroniDation of routin" up ates #) su#tractin" a ran om len"th of time ran"in" from 0% to 15% of the specifie inter!al time from the ne%t routin" up ate &t pre!ents the s)nchroniDation of routin" up ates #) causin" the router to s$ip e!er) other sche ule up ate time &t pre!ents the s)nchroniDation of routin" up ates #) forcin" the router to listen when its time for other up ates on the lines #efore sen in" it 13. #hich three routing protocols are distance vector routing protocols? %&hoose three'. 0&'!1 (&B0' OS'* &S<&S 0&'!2 25. #hich of the following can exist in a distance vector network that has not converged? %&hoose three'. routin" loops inconsistent traffic forwar in" no traffic forwar in" until s)stem con!er"es inconsistent routin" ta#le entries routin" ta#le up ates sent to wron" estinations 21. #hat is the purpose of the TT0 field in the I! header? use to mar$ routes as unreacha#le in up ates sent to other routers pre!ents re"ular up ate messa"es from reinstatin" a route that ma) ha!e "one #a pre!ents a router from a !ertisin" a networ$ throu"h the interface from which the up ate came limits the time or hops that a pac$et can tra!erse throu"h the networ$ #efore it shoul #e iscar e efines a ma%imum metric !alue for each istance !ector routin" protocol #) settin" a ma%imum hop count

CCNA 2 Chapter : 2011 V4.0 Answers 100%

June 13, 2011 by admin 17 C mments

Our Sponsors CCNA 2 Chapter 5 2011 V4.0 Answers 100% 1.

Refer to the exhibit. The network that is shown is running RI!v1. The 132.1-2.15.5?2( network was recentl" added and will onl" contain end users. #hat co and or set of co ands should be entered on Router1 to prevent RI!v1 updates fro other routers? 0outer1;confi"<router=> no router rip 0outer1;confi"<router=> networ$ 1,2.17-.10.0 0outer1;confi"<router=> no networ$ 1,2.17-.10.0 0outer1;confi"<router=> passi!e<interface fastethernet 0+0 0outer1;confi"<router=> passi!e<interface serial 0+0+0 2. Refer to the output fro concluded fro the show ip route co and. #hat can be and? the output of this router co being sent to the end user devices on the

new network while still allowing this new network to be advertised to

A preferre route to the estination has not #een set. There are two equal cost paths to networ$ 1.0.0.0. 9oth interfaces are #ein" use equall) to route traffic. A !ariance must #e set to loa <#alance across multiple paths. $.

Refer to the exhibit. The 9thernet interface on Router2 goes down and the ad inistrator notices that the route is still in the uch longer will Router1 keep the down arking it as possibl" down? Router1 routing table. )ow 80 secon s ,0 secon s 155 secon s 1-0 secon s 255 secon s (. #hat is the default update period in seconds for the RI! routing protocol? 10 12 15 20 80 70 *. #hich of the following is considered a li itation of RI! v1? 0&' !1 oes not sen su#net mas$ information in its up ates. 0&' !1 is not wi el) supporte #) networ$in" har ware !en ors. 0&' !1 consumes e%cessi!e #an wi th #) multicastin" routin" up ates usin" a Class @ a ress. 0&' !1 requires enhance router processors an e%tra 0A/ to function effecti!el). 0&' !1 oes not support loa #alancin" across equal<cost paths. 0&' !1 authentication is complicate an time<consumin" to confi"ure. -. #hich co e#u" ip rip show ip route show ip interface show ip protocols e#u" ip rip confi" show ip rip ata#ase .. #hat are three characteristics of the RI!v1 routing protocol? %&hoose three.' supports the use of V4S/ uses hop count as a metric and will displa" RI! activit" as it occurs on a router?

network in its routing table before

consi ers a metric of 17 as infinit) has an a ministrati!e istance of 110 #) efault inclu es the estination &' a 2. ress an su#net mas$ in routin" up ates calculates metrics usin" the 9ellman *or al"orithm

#hich of the following would be the correct co RI! on Router 8 for all connected networks? 0outer9> router rip

and sequence to enable

0outer9;router=> network 215.$-...5 0outer9;router=> network 225.1..23.50outer9;router=> network 211.1-2..(.5 0outer9;confi"=> router rip 0outer9;confi"<router=> network 132.1-.(.50outer9;confi"<router=> network 211.1-2..(.5 0outer9;confi"< router=> network 133.2(.$2.5 0outer9;confi"=> configure router rip 0outer9;confi"<router=> network 215.$-...50outer9;confi"<router=> network 133.2(.$2.5 0outer9;confi"< router=> network 211.1-2..(.5 0outer9;confi"=> router rip 0outer9;confi"<router=> network 132.1-.(.50outer9;confi"<router=> network 215.$-...5 0outer9;confi"< router=> network 211.1-2..(.5 0outer9;confi"=> router rip 0outer9;confi"<router=> network 132.1-.(.50outer9;confi"<router=> network 215.$-...5 0outer9;confi"< router=> network 225.1..23.5 3.

Refer to the exhibit. /ll routers are configured with valid interface addresses in the indicated networks and are running RI!v1. The network is converged. #hich routes are present in the routing tables? All routers ha!e all routes in their routin" ta#le. All routers ha!e all +80 routes6 #ut o not ha!e +24 routes in their routin" ta#le. All routers ha!e all +80 routes. 0outers A an ( also ha!e some of the +24 routes in theirroutin" ta#le. All routers ha!e all +80 routes. 0outers 9 an @ also ha!e some of the +24 routes in theirroutin" ta#le. 0outers A an ( ha!e all routes. 0outers 9 an @ ha!e onl) +80 routes in their routin"ta#le. 0outers A an ( ha!e onl) +24 routes. 0outers 9 an @ ha!e onl) +80 routes in theirroutin" ta#le. 15. #hat will happen if an interface I! address is entered for the address portion of the network co network address? The router will reGect the comman . A route to the host a A route to the host a ress will #e a ress will #e a e to out"oin" 0&' up ates. e to the routin" ta#le. ress will #e inclu e in and in a RI!v1 configuration instead of a

All interfaces in the same classful networ$ as the confi"ure a the 0&'!1 routin" process. 11.

Refer to the exhibit. Router1 and Router2 are running the RI!v1 protocol. The network ad 10.1.0.0+17 10.1.0.0+10.0.0.0+17 10.0.0.0+12. inistrator configures the co and network 15.1.5.5 on Router1. #hat network will Router1 advertise to Router2?

Refer to the exhibit. /ll routers in the exhibit are running RI! v1. The network ad inistrator issues the show ip route co and on router /. #hat routes would appear in the routing table output if the network is converged? %&hoose two'. 0 1,2.17-.2.0+24 I120+1J C 1,2.17-.2.0+24 I120+1J 0 10.10.8.0+24 I120+0J C 10.10.8.0+24 I120+1J 0 10.10.1.0+24 I120+2J 0 10.10.1.0+24 I120+8J 1$.

Refer to the exhibit. / network consists of verified when the show ip protocols co routers in the network?

ultiple routers. #hat can be and is issued on one of the e to the routin" ta#le

whether all routes in the networ$ ha!e #een properl) a

routin" protocol confi"uration in use for &' on this router operational status of routin" protocols in use on all routers in the networ$ routin" metric of each networ$ that is liste in the routin" ta#le 1(.

Refer to the exhibit. #hat can be concluded fro of router 8? A static efault route has #een confi"ure on 9.

the routing table output

The efault<information ori"inate comman has #een entere on A. All traffic that is estine for 1,2.17-.1.1 will #e sent to a a ress. and. R 132.1-2.$.5?2( @125?$A via 132.1-2.2.2, 55>55>$5, etric? ress 0.0.0.0. 3osts on the 10.17.1.0+2: networ$ ha!e 1,2.17-.1.1 confi"ure as the efault "atewa) 1*. The following line was displa"ed in the output of the show ip routeco 8 12 20 80 120 1-. ,erial5?5 #hat is the value of the routing

Refer to the exhibit. /ll routers that are shown are running the RI! routingprotocol. /ll unknown I! traffic #hat router or set of routers are reco route and the default7infor this forwarding polic"? onl) 0outer1 onl) the "atewa) router all routers in the networ$ onl) the routers with 4ANs nee in" &nternet access 1.. ation originateco ust be forwarded to the I,!. and issued to i ple ent ended to have both a default

Refer to the exhibit. Router1 is running RI!v1. #hat co no auto7su ar"

and was

entered into Router1 to configure the gatewa" of last resort? ip default7network 5.5.5.5 ip default7gatewa" 15.5.5.5 ip route 5.5.5.5 5.5.5.5 ,5?5?1 12. #hich co and or set of co ands will stop the RI! routing process? 0outer9;confi"=> router rip Router8%config7router'B shutdown 0outer9;confi"=> router rip Router8%config7router'B network no

132.1-2.2.5 0outer9;confi"=> no router rip 0outer9;confi"=> router no rip 13. #hich two state %&hoose two'. &t is a istance !ector routin" protocol. &t a !ertises the a ress an su#net mas$ for routes in routin" up ates. The ata portion of a 0&' messa"e is encapsulate into a TC' se"ment. The ata portion of a 0&' messa"e is encapsulate into a A@' se"ment. &t #roa casts up ates e!er) 15 secon s. &t allows a ma%imum of 15 routers in the routin" omain. 25. ents are true regarding the characteristics of RI!v1?

Refer to the exhibit. RI!v1 is running on all three routers. /ll interfaces have been correctl" configured with addresses in the address ranges that are shown. #hich route would "ou see in the routing table on router &)I if the routers are configured with the co the exhibit? 1,2.17-.0.4+80 1,2.17-.0.0+24 1,2.17-.0.0+17 1,2.17-.0.82+2: 21. Refer to the exhibit. The 9thernet interface on Router2 goes down and the ad inistrator notices that the route is still valid in the routing table of uch longer will it take for Router1 to ark the route invalid Router1.)ow ands that are displa"ed in

b" setting the

etric to 1-?

80 secon s ,0 secon s 155 secon s 1-0 secon s 255 secon s

CCNA 2 = !"amen >nidad :

CCNA 2 Chapter ; 2011 V4.0 Answers 100%

June 13, 2011 by admin 2; C mments

Our Sponsors &&1/ 2 &hapter - 2511 <(.5 /nswers 155G 1. #hat two advantages does &I4R provide to a network? %&hoose two.' re uce routin" ta#le siDe )namic a ress assi"nment automatic route re istri#ution re uce routin" up ate traffic automatic summariDation at classful #oun aries 2.

Refer to the exhibit. #hich address is a broadcast address for one of the subnets that are shown in the exhibit? 1,2.17-.4.8+2, 1,2.17-.4.15+2, 1,2.17-.4.75+27 1,2.17-.4.255+24 $.

In the network shown in the graphic, three bits were borrowed fro host portion of a &lass & address. )ow 8 4 12 87 -4 1-0 unused on the three point7to7point links co

the

an" valid host addresses will be bined if <0,6 is not used?

(. #hich of the following are contained in the routing updates of classless routing protocols? %&hoose two.' 82<#it a ress ne%t hop router interface su#net mas$ unicast host a 4a)er 2 a *. ress ress

Refer to the exhibit. The network ad subnetwork 255.255.255.1,2 255.255.255.224 255.255.255.240

inistrator wants to create a subnet

for the point7to7point connection between the two routers. #hich ask would provide enough addresses for the point7to7point ber of wasted addresses? link with the least nu

255.255.255.24255.255.255.252 -. #hat does <0,6 allow a network ad utiliDe multiple su#net mas$s in the same &' a inistrator to do? ress space utiliDe one su#net mas$ throu"hout an autonomous s)stem utiliDe &B0' as the routin" protocol in an entire autonomous s)stem utiliDe multiple routin" protocols within an autonomous s)stem .. #hich three interior routing protocols support <0,6? %&hoose three.' OS'* 0&' !1 0&' !2 (&B0' 9B' ST' 2. #hich of the following proble the shorta"e of &' a resses resses to hosts in lar"e enterprises the ifficult) of assi"nin" static &' a s does <0,6 help to alleviate?

the comple%it) of implementin" a !ance routin" protocols such as OS'* an (&B0' the shorta"e of networ$ a ministrators qualifie in the use of 0&' !1 an &B0' 3. Refer to the exhibit. / network technician enters the static route in R1 needed to reach network 15.1.1.5?2(. / ping fro following results> 1. pin"s from 01 to the S0+0+0 interface on 02K.successful 2. pin"s from 01 to the *a0+0 interface on 02K.successful 8. pin"s from host 9 to hosts on the 10.1.1.0+24 networ$K.successful 4. pin"s from host 9 to the *a0+0 interface on 02K.successful 5. pin"s from 02 to host 9K.successful. .hat is the li$el) cause of the failure of the pin" from 01 to host 9L The efault "atewa) on host 9 is not correctl) set. There are no routes #ac$ to networ$s connecte to 01 from 02. There is a 4a)er 2 pro#lem #etween 02 an host 9. 3ost 9 has a efecti!e (thernet car . 15. / network ad a inistrator is tasked with dividing up a class & network inistration depart ents. The H/ ong the H/, ,ales, and /d the ,5?5?5 interface on R1 to host 8 fails. The technician begins testing the network and has the

depart the /d

ent is

ade up of 15 people, the ,ales is ents? %&hoose two.'

ade up of 22 people, and

inistration has -. #hich two subnets

asks adequatel" address

the H/ and ,ales depart 255.255.255.252 for MA N 255.255.255.224 for Sales N 255.255.255.240 for MA 255.255.255.24- for MA 255.255.255.0 for Sales 11.

Refer to the exhibit. / network engineer is su for all the subnets? 1,2.17-.0.0+28 1,2.17-.0.0+22 1,2.17-.0.0+21 1,2.17-.0.0+20 12

ariCing the two groups of ariCation will work

routes on router R1 shown in the exhibit. #hich su

/ &lass & address has been assigned for use in the network shown in the graphic. Ising <0,6, which bit nu addresses? ask should be used to provide for the ber of host addresses required on Router /, while wasting the fewest

+81 +80 +2, +2+2: +27 1$.

Refer to the exhibit. In the network that is shown, the router interfaces are assigned the first address in each subnet. #hich I! address would be usable for a host on one of the 0/1s in this network? 1,2.17-.1.5+80 1,2.17-.2.1:+21,2.17-.2.78+2: 1,2.17-.2.180+25 1(. Refer to the exhibit. #hat subnet none 17 24 1*. ask will be applied if Router / sends a RI!v1 update for the network 1.2.1-.1.5 to Router 8?

Refer to the exhibit. The nu address require

ber of required host addresses for each ber includes the host ined, what will

subnet in a network is listed in the exhibit. This nu all device and router port address assign

ents for all router ports and hosts on that subnet. /fter ents are deter

be the total nu 7 14 2, 84 40 72 1-.

ber of unused host addresses available?

/n additional subnet is required for a new 9thernet link between Router1 and Router2 as shown in the diagra . #hich of the following subnet axi u of 1( addresses can be configured in this network to provide a 1,2.1.1.17+27 1,2.1.1.,7+21,2.1.1.170+21,2.1.1.1,7+2: 1,2.1.1.224+21,2.1.1.240+21.. #hat is a supernet? the networ$ for a efault route a summariDation of classful a resses resses a networ$ that contains #oth pri!ate an pu#lic a 12.

useable addresses for this link while wasting the fewest addresses?

a set of isconti"uous networ$s that are controlle #) an &S'

Refer to the exhibit. / network ad subnetworks fro network ad

inistrator needs to create two in

15.5.5.5?2 for a router running RI!v2. The /d

subnet requires 125 hosts and the ,ales subnet requires *2 hosts. The inistrator assigned 15.5.1.122?2* to the /d e? resses for the "i!en networ$ requirements. in subnet. The ,ales subnet is given 15.5.1.132?2-. #hat will be the result of this addressing sche 9ecause 0&'!2 oes not support V4S/6 the su#net mas$s will not #e allowe . The su#nets will not ha!e enou"h host a The router will support the a 13. / router has a su The su#nets o!erlap an will #e reGecte #) the router. ressin" scheme. ariCed b" this route? ar" route to network 132.1-2.$2.5?25 installed in

its routing table. #hat range of networks are su 1,2.17-.0.0 O 1,2.17-.82.0+24 1,2.17-.0.0 O 1,2.17-.4:.0+24 1,2.17-.82.0 O 1,2.17-.4:.0+24 1,2.17-.82.0 O 1,2.17-.4-.0+24 1,2.17-.82.0 O 1,2.17-.78.0+24 25.

Refer to the exhibit. The network ad nu ad inistrator i ple

inistrator wants to

ini

iCe the

ber of entries in Router1Ds routing table. #hat should the ent on the network?

V4S/ C&@0 pri!ate &' a 21. resses classful routin"

Refer to the exhibit. #hat subnet none 17 24 22.

ask will be applied b" router 8 when it

receives a RI!v1 update for the network 1.2.1-.1.5?

Refer to the exhibit. / network technician enters the static route in R1 needed to reach network 15.1.1.5?2(. / ping fro R1 to )ost 8 fails. The technician begins testing the network and has the following results>

1. pin"s from 01 to the S0+0+0 interface on 02K.successful 2. pin"s from 01 to the *a0+0 interface on 02K.successful 8. pin"s from 3ost 9 to hosts on the 10.1.1.0+24 networ$K.successful 4. pin"s from 3ost 9 to the *a0+0 interface on 02K.successful 5. pin"s from 02 to 3ost 9K.successful 2$. #hat is the likel" cause of the failure of the ping fro 3ost 9 has a efecti!e (thernet car . The efault "atewa) on 3ost 9 is not correctl) set. There is a 4a)er 2 pro#lem #etween 02 an 3ost 9. 02 oes not ha!e routes #ac$ to networ$s connecte to 01. R1 to )ost 8?

Examen CCNA2 v4.0 Captulo 6

!"amen CCNA2 #4.0 Cap$tu% ; 1. -9u) es % *ue V+4@ %e permite ha&er a un administrad r de red. a. uti%i3ar una m,s&ara de subred en un sistema aut'n m %. Jutili)ar mKltiples msaras de su%red en el mismo espacio de direccin !" &. uti%i3ar /N?0 & m e% pr t & % de enrutamient en t d un sistema aut'n m d. uti%i3ar m5%tip%es pr t & % s de enrutamient dentr de un sistema aut'n m 2. >n administrad r de red tiene & m tarea di#idir una red de &%ase C entre % s departament s de C ntr % de Ca%idad, Ventas y Administra&i'n. !% departament de C ntr % de Ca%idad est, 1 rmad p r 10 pers nas, e% de Ventas est, 1 rmad p r 2B pers nas y %a Administra&i'n tiene ;. -Cu,%es s n %as m,s&aras de subredes *ue diri2en & rre&tamente % s departament s de C ntr % de Ca%idad y de Ventas. 6!%i7a d s p&i nes8. a. 2::.2::.2::.2:2 para C ntr % de Ca%idad %. J288.288.288.225 para @entas c. J288.288.288.250 para *ontrol de *alidad d. 2::.2::.2::.24B para C ntr % de Ca%idad e. 2::.2::.2::.0 para Ventas 3. 4e ha asi2nad una dire&&i'n C%ase C para ser uti%i3ada en %a red *ue se i%ustra en e% 2r,1i& . 4i se usa V+4@, -&u,% es %a m,s&ara de bits *ue se debe uti%i3ar para suministrar & n e1i&ien&ia %a &antidad de dire&&i nes de h st *ue se re*uieren en e% ? uter A, desperdi&iand %a men r &antidad de dire&&i nes p sib%es. a. D31 b. D30 &. D2F d. D2B e. J/29 1. D2; 4. -Cu,%es s n %as #enta7as *ue %e pr p r&i na C/(? a una red. 6!%i7a d s p&i nes8. a. Jtama>o reducido de la ta%la de enrutamiento b. asi2na&i'n de dire&&i nes din,mi&as &. redistribu&i'n de ruta aut m,ti&a d. Jtrfico de actuali)acin de enrutamiento reducido e. resumen aut m,ti& en % s b rdes & n &%ase :. 4e re*uiere una subred adi&i na% para un nue# en%a&e !thernet entre ? uter1 y ? uter2, & m se indi&a en e% dia2rama. -Cu,% de %as si2uientes dire&&i nes de subred se puede

& n1i2urar en esta red para suministrar una &antidad m,"ima de 14 dire&&i nes uti%i3ab%es para este en%a&e desperdi&iand %a men r &antidad de dire&&i nes p sib%e. a. 1F2.1.1.1;D2; b. 1F2.1.1.F;D2B &. 1F2.1.1.1;0D2B d. 1F2.1.1.1F;D27 e. J1&2.1.1.225/2' 1F2.1.1.240D2B ;. >n r uter tiene una ruta de resumen ha&ia %a red 1F2.1;B.32.0D20 insta%ada en su tab%a de enrutamient . -9u) ran2 de redes resume esta ruta. a. 1F2.1;B.0.0 O 1F2.1;B.32.0D24 b. 1F2.1;B.0.0 O 1F2.1;B.47.0 c. J1&2.13'.42.0 L 1&2.13'.59.0/25 d. 1F2.1;B.32.0 O 1F2.1;B.4B.0D24 e.1F2.1;B.32.0 O 1F2.1;B.;3.0D24. 7. C nsu%te %a presenta&i'n. -9u) m,s&ara de subred se ap%i&ar, si e% ? uter A en#$a una a&tua%i3a&i'n ?/0#1 para %a red 172.1;.1.0 a% ? uter E. a. Nin2un b. B &. 1; d.J25 B. -9u) es una superred. a. %a red para una ruta predeterminada b. una red *ue & ntiene tant dire&&i nes pri#adas & m p5b%i&as &. un & n7unt de redes n & nti2uas & ntr %adas p r un /40 d. Juna sumari)acin de (arias redes !" con clase en un rango de direcciones !" F. C nsu%te %a presenta&i'n. !% administrad r de red *uiere &rear una subred para %a & ne"i'n punt a punt entre % s d s r uters. -Cu,% de %as si2uientes m,s&aras de subred pr p r&i nar$a su1i&ientes dire&&i nes para e% en%a&e punt a punt & n e% m$nim de dire&&i nes desperdi&iadas. a. 2::.2::.2::.1F2 b. 2::.2::.2::.224 &. 2::.2::.2::.240 d. 2::.2::.2::.24B e. J288.288.288.282. 10. C nsu%te %a presenta&i'n. !n %a presenta&i'n est, enumerad e% n5mer de dire&&i nes de h st re*uerid s para &ada subred en una red. !ste n5mer in&%uye % s re*uisit s de dire&&i'n de h st para t d s % s puert s de r uter y h sts en esa subred. (espu)s de determinar t das %as asi2na&i nes de % s disp siti# s y de %as dire&&i nes de puert de% r uter, -&u,% ser, e% n5mer t ta% de dire&&i nes de h st disp nib%es *ue n se uti%i3an. a. ; b. 14 c. J2& d. 34 e. 40 1. ;2 11. !n %a red *ue se i%ustra en e% 2r,1i& , se pidier n prestad s tres bits a %a p r&i'n de% h st de una dire&&i'n C%ase C. -Cu,ntas dire&&i nes de h st #,%idas n se uti%i3ar,n en % s tres en%a&es punt a punt & mbinad s si n se usa V+4@. a. 3 b. 4 &. 12 d. 3;

e. J'5 1. 1B0 12. -Cu,%es s n % s tres pr t & % s de enrutamient interi r *ue admiten V+4@. 6!%i7a tres p&i nes8 a. JA "F b. ?/0 #1 c. J-!" (2 d. JE!D-" e. EN0 1. 4C0 13. C nsu%te %a presenta&i'n. !% administrad r de red *uiere minimi3ar %a &antidad de entradas en %a tab%a de enrutamient de% ? uter 1 -9u) debe imp%ementar e% administrad r en %a red. a. V+4@ %. J*!=&. dire&&i nes /0 pri#adas d. enrutamient & n &%ase 14. C nsu%te %a ima2en. >n t)&ni& de red in2resa %a ruta est,ti&a en e% ?1 ne&esari para a%&an3ar %a red 10.1.1.0D24. !% pin2 de% ?1 a% h st E 1a%%a. !% t)&ni& & mien3a a pr bar %a red y btiene % s si2uientes resu%tad sJ 1. pin2s desde ?1 a %a inter1a3 40D0D0 en ?2....e"it s s 2. pin2s desde ?1 a %a inter1a3 <a0D0 en ?2....e"it s s 3. pin2s desde e% h st E a % s h sts en %a red 10.1.1.0D24....e"it s s 4. pin2s desde e% h st E a %a inter1a3 <a0D0 en ?2....e"it s s :. pin2s desde ?2 a% h st E....e"it s s -Cu,% puede ser %a &ausa de %a 1a%%a de% pin2 de% ?1 a% h st E. a. I st E tiene una tar7eta !thernet de1e&tu sa. %. JLa gate#ay predeterminada en el host 7 no est configurada correctamente. &. !"iste un pr b%ema de Capa 2 entre ?2 y e% h st E. d. ?2 n tiene rutas de re2res a %as redes & ne&tadas a% ?1. e. ?e2%a de punta7e paraJ & rre&tness 1 resp nse. 1:. C nsu%te %a presenta&i'n. >n in2enier de red resume % s d s 2rup s de rutas en e% ? uter ?1 *ue apare&en en %a presenta&i'n. -9u) resumen 1un&i nar, para t das %as subredes. a. 1F2.1;B.0.0D23 b. 1F2.1;B.0.0D22 c. J1&2.13'.0.0/21 d. 1F2.1;B.0.0D20 1;. -Cu,% de % s si2uientes pr b%emas ayuda a a%i#iar V+4@. a. Jla falta de direcciones !" b. %a di1i&u%tad *ue sur2e a% asi2nar dire&&i nes /0 est,ti&as a % s h sts en 2randes empresas &. %a & mp%e7idad de imp%ementar pr t & % s de enrutamient a#an3ad s & m , p r e7emp% , G40< y !/N?0. d. %a 1a%ta de administrad res de red e"perimentad s en e% us de ?/0 #1 e /N?0 17. C nsu%te %a presenta&i'n. -9u) dire&&i'n es una dire&&i'n de br ad&ast para una de %as subredes *ue se muestran en %a presenta&i'n. a. 1F2.1;B.4.3D2F %. J1&2.13'.5.18/2& &. 1F2.1;B.4.;:D2; d. 1F2.1;B.4.2::D24 1B. C nsu%te %a presenta&i'n. >n administrad r de red debe &rear d s subredes de 10.0.0.0DB para un r uter *ue e7e&uta ?/0#2. +a subred Admin re*uiere 120 h sts y %a subred Ventas re*uiere :B h sts. !% administrad r de red asi2n' 10.0.1.12BD2: a %a subred Admin. A %a subred Ventas se %e t r2' 10.0.1.1F2D2;. -Cu,% ser, e% resu%tad de este es*uema de dire&&i namient . a. (ebid a *ue ?/0#2 n admite V+4@, n se permitir,n m,s&aras de subred. b. +as subredes n tendr,n su1i&ientes dire&&i nes de h st para % s re*uisit s de red dad s. c. JLas su%redes se superponen y sern recha)adas por el router.

d. !% r uter admitir, e% es*uema de dire&&i namient . 1F. -Cu,% de %as si2uientes p&i nes se en&uentra en %as a&tua%i3a&i nes de enrutamient de % s pr t & % s de enrutamient sin &%ase. 6!%i7a d s p&i nes8. a. Jdireccin de 42 %its b. inter1a3 de% r uter de% si2uiente sa%t c. Jmscara de su%red d. dire&&i'n de h st uni&ast e. dire&&i'n de Capa 2 20. C nsu%te %a presenta&i'n. !n %a red *ue se muestra, %as inter1a&es de% r uter s n asi2nadas a %a primera dire&&i'n en &ada subred. -9u) dire&&i'n /0 se p dr, uti%i3ar para un h st en una de %as +AN de esta red. a. 1F2.1;B.1.:D30 b. 1F2.1;B.2.17D2B &. 1F2.1;B.2.;3D27 d. J1&2.13'.2.140/28

CCNA 2 Chapter 7 2011 V4.0 Answers 100%

June 13, 2011 by admin 7 C mments

Our Sponsors CCNA 2 Chapter : 2011 V4.0 Answers 100% 1. / network ad infrastructure fro three.' 10.0.0.0+12:.0.0.0+17,.254.0.0+17 1:2.17.0.0+12 1,2.17-.0.0+17 20,.175.201.0+2: 2. inistrator has been told that the co pan" I! address ust adhere to R:& 1312. #hat three I! address ranges inistrator use on the network? %&hoose

R:& 1312 could the ad

Refer to the exhibit. Routers 9ast and #est are configured using RI!v1. 8oth routers are sending updates about their directl" connected routes. The 9ast router can ping the #est router serial interface and #est can ping the serial interface of 9ast. )owever, neither router has d"na icall"

learned routesfro

the other. #hat is

ost likel" the proble

A "atewa) of last resort is require . Su#nettin" is not supporte #) 0&'!1. V4S/ is not supporte #) 0&'!1. One of the routers nee s a cloc$ rate on the serial interface. $.

Refer to the exhibit. #hat effect will the co on RI! updates for Router1? Onl) !ersion 2 up ates are sent to 255.255.255.255. Onl) !ersion 2 up ates are sent to 224.0.0.,.

ands that are shown have

9oth !ersion 1 an !ersion 2 up ates are sent to 224.0.0.,. 9oth !ersion 1 an !ersion 2 up ates are sent to 255.255.255.255. (.

Refer to the exhibit. #hat can be concluded fro theexhibit?

the output shown in

The routin" ta#le is limite to 2 routes. The 4AN interfaces are participatin" in the routin" process. One up ate has #een sent out of each serial interface an 2 ha!e #een recei!e . The no auto<summar) has not #een confi"ure on this router. *. #hat are two reasons to i version 1? %&hoose two.' 0&' !ersion 2 supports V4S/. 0&' !ersion 2 supports more than 17 routers. 0&' !ersion 2 supports classful ;an not classless= routin". 0&' !ersion 2 supports routin" up ate authentication. 0&' !ersion 2 supports multi<areas. 0&' !ersion 2 uses the @iG$stra al"orithm rather than the 9ellman<*or al"orithm. -. ple ent RI! version 2 rather than RI!

Refer to the exhibit. RI!v1 is configured as the routing protocol for the network that is shown. The following co router rip networ$ 10.0.0.0 networ$ 1:2.17.0.0 .hen this confi"uration is complete6 users on the 4AN of each router are una#le to access the remote 4ANs. .h)L The networ$ statements are confi"ure incorrectl). A routin" loop has #een create . 0&'!1 is una#le to route to isconti"uous su#nets of a maGor networ$. 0&'!1 is una#le to route networ$s with a +24 su#net mas$. .. / network ad inistrator installed four new routers that are running RI!v2. Router1 is a boundar" router in the RI!v2 network and has a default route configured. +nce the network has converged, the network ad inistrator enters Router1%config7router'B default7infor ation ands are used on each router>

originate on Router1. )ow will this affect the network? pre!ents 0outer1 from forwar in" up ates a#out networ$s that are not irectl) connecte causes all routers in the networ$ to s)nchroniDe routin" up ates with 0outer1 forces 0outer1 to #ecome the primar) or esi"nate router ;@0= for up ates propa"ates the efault route to all routers in the networ$ 2.

Refer to the exhibit. / technician needs to add a new loopback interface to testrouting functionalit" and network design. The technician enters the following set of co ands on the router> Sanfor ;confi"=> interface loopback1 Sanfor ;confi"<if=> ip address 132.1-2.-.-2 2**.2**.2**.2*2 .h) oes the router respon with an errorL The router oes not allow loop#ac$ interface confi"urations. This mas$ can not #e use with this class of a The networ$ a a ress. resses. ress can #e a e . Classless routin" must #e confi"ure #efore this a

ress for 4oop#ac$1 o!erlaps with an alrea ) confi"ure interface

The router is o!er the limit for the ma%imum paths that can #e pro!i e in the routin"ta#le. 3. #hat is the of RI!v2? 15 hops 17 hops 100 hops 120 hops 255 hops axi u network dia eter per itted b" the default etric

15. #hat are two functions of the network co configuringrouting protocols? %&hoose two.'

and used when

i entifies which networ$s will #e inclu e in the routin" up ates i entifies the hosts a use to list all a resses that can #e summariDe in the networ$ resses for remote an local networ$s

etermines which su#net mas$ to appl) to routin" up ates etermines which interfaces can sen an recei!e routin" up ates 11.

Refer to the exhibit. /ll routers are running RI!v1. #hat changes will occur in the routing table of router 8 if a loopback interface with an address of 15.1-.1.123?2. is configured on router 8? 0outes to the 10.17.1.0+2:6 10.17.1.74+2:6 an 10.17.1.12-+2: networ$s are a A connecte route to the 10.17.1.12-+2: networ$ is a e . e . A thir route to the 10.0.0.0+- networ$ with 0&'!1 as the source is a confi"ure . 12. e .

The 10.0.0.0+- route is roppe imme iatel) from the routin" ta#le after router 9 is

Refer to the exhibit. If all routers are running RI! version 2, wh" is there no route for the 132.1-2.1.$2?2. network? 0ip !ersion 2 oes not sen su#net mas$s in its up ates. 0outer A is not setup with 0&' as a routin" protocol. 0ip !ersion 2 will auto summariDe routes #) efault. 0outer 9 is not setup to a !ertise the 1,2.17-.1.74+80 networ$. 1$. RI!v2 is the configured routing protocol on the routers in a network. The co and Router%config7router'B no version 2 is entered on the and have on routing updates? ress 224.0.0.,. e to the routin" up ates. routers. #hat effect does entering this co Su#net mas$s will #e a 0outin" up ates will #e sent out usin" multicast a

Version 1 an 2 up ates will #e recei!e an the !ersion 2 up ates will not #e sent. The 0&' routin" process will #e remo!e from the router an routin" up ates will not #e forwar e . 1(. )ow are RI! v1 and RI! v2 si The) #oth use hop count as a metric. The) #oth ha!e the same metric !alue for infinite istance. The) #oth #roa cast their up ates to their nei"h#ors. The) #oth sen su#net mas$ information in their up ates. The) #oth pro!i e for authentication of up ate sources. The) #oth use split horiDon to pre!ent routin" loops. 1*. ilar to one another? %&hoose three.'

Refer to the exhibit. The exhibited network contains a non7&isco routers. The co router. /ll routers are running the sa possible solution to this proble (na#le split horiDon in the networ$. Confi"ure 0&'!2 on routers. A ?

ixture of &isco and

and debug ip rip was entered on the F/J e version of RI!. Router &)I and

Router +R0 are not able to reach the 132.1-2.1.1-?22 network. #hat is a

networ$ 1,2.17-.1.0 to the 0&' confi"uration on the PA2 router.

Confi"ure PA2 *a0+0 as a passi!e interface. (na#le the Serial0+0+0 interface on the PA2 router. Chan"e the &' a ress on the *a0+0 interface of the PA2 router to 1,2.17-.1.1+24. essage header b" R:& 1.2$ to add 1-. #hat field was added to the RI! support for <0,6 and &I4R? su#net mas$ estination port num#er a 1.. ress famil) i entifier estination &' a resses source an

Refer to the exhibit. #hich co 0outer1;confi"=> ip classless

and on which router will allow Router1

to learn about the 132.1-2.5.5?25 network? 0outer1;confi"<router=> no passi!e<interface serial 0+1+1 0outer2;confi"<router=> !ersion 2 0outer2;confi"<router=> nei"h#or 10.0.0.2 12. Refer to the exhibit. #hich two state ents are true? %&hoose two.' 0outer1 will install a route to 1,2.17-.0.0+20 0outer1 will install a route to 1,2.17-.0.0+24 0outer1 will install a route to 1,2.17-.17.0+24 0outer2 will install a route to 1,2.17-.17.0+24 0outer2 will not install a route to 1,2.17-.17.0+20 13.

Refer to the exhibit. /ll routers are running RI! version 2. F/J is configured to ;ust advertise the 15.5.5.5?2( network. &)I is configured to advertise the 1.2.1-.5.5?1- network. / network ad co inistrator enters the ands shown in the exhibit. #hat changes will occur in this network?

The PA2 router will i"nore up ates for the 1:2.17.0.0+17 networ$ ue to split horiDon issues. The C3& router will install a route to the 1,2.17-.0.0+17 networ$ in its routin" ta#le. The routin" ta#le for C3& will ha!e the 1,2.17-.0.0+17 route #ut it will ha!e an S ne%t to the route. The O04 router will appl) a 255.255.0.0 su#net mas$ to all networ$s in the routin" up ates it forwar s. 25.

Refer to the exhibit. #hich co 132.1-2.1-.5?22 networkL 0outer1;confi"=> ip classless

and will allow Router2 to learn about the

0outer1;confi"<router=> network 132.1-2.1-.5 0outer1;confi"<router=> no passive7interface serial 5?1?1 0outer2;confi"<router=> version 2 0outer2;confi"<router=> neighbor 15.5.5.2

CCNA2 Examen 7 Corregido

1 -Cu,%es s n d s ra3 nes para imp%ementar ?/0, #ersi'n 2, en %u2ar de ?/0, #ersi'n 1. 6!%i7a d s p&i nes8. J -!" (ersin 2 admite @L <. ?/0 #ersi'n 2 admite m,s de 1; r uters. ?/0 #ersi'n 2 admite enrutamient & n &%ase 6y n sin &%ase8. J -!" (ersin 2 admite la autenticacin de la actuali)acin de enrutamiento. ?/0 #ersi'n 2 admite #arias ,reas. ?/0 #ersi'n 2 uti%i3a e% a%2 ritm de (i7Kstra en %u2ar de% a%2 ritm Ee%%man=< rd. 2

C nsu%te %a presenta&i'n. -9u) & mand y en *u) r uter %e permitir, a% ? uter1 aprender s bre %a red 1F2.1;B.0.0D20. ? uter16& n1i28A ip classless ? uter16& n1i2=r uter8A no passi(e1interface serial 0/1/1 J -outer2.config1router/0 (ersion 2 ? uter26& n1i2=r uter8A neigh%or 10.0.0.2 3

C nsu%te %a presenta&i'n. -9u) e1e&t tendr,n % s & mand s *ue se muestran en %as a&tua%i3a&i nes ?/0 para e% ? uter1. 4'% se en#$an %as a&tua%i3a&i nes #ersi'n 2 a 2::.2::.2::.2::. J lo se en(Ban las actuali)aciones (ersin 2 a 225.0.0.&. 4e en#$an ambas a&tua%i3a&i nes, #ersi'n 1 y #ersi'n 2, a 224.0.0.F. 4e en#$an ambas a&tua%i3a&i nes, #ersi'n 1 y #ersi'n 2, a 2::.2::.2::.2::. 4

-!n *u) se aseme7an ?/0 #1 y ?/0 #2. 6!%i7a tres p&i nes8. J 2m%os usan el conteo de saltos como mtrica.

J 2m%os tienen el mismo (alor mtrico para la distancia infinita. Amb s en#$an br ad&asts de sus a&tua%i3a&i nes a sus #e&in s. Amb s en#$an %a in1 rma&i'n de %a m,s&ara de subred en sus a&tua%i3a&i nes. Amb s suministran autenti&a&i'n de %as 1uentes de a&tua%i3a&i'n. J 2m%os usan el hori)onte di(idido para pre(enir los routing loops. 5

-9u) &amp a2re2' ?C< 1723 a% en&abe3ad de mensa7e ?/0 para a2re2ar respa%d para V+4@ y C/(?. J mscara de su%red n5mer de puert destin identi1i&ad r de address 1ami%y dire&&i nes /0 de ri2en y de destin

-Cu,%es s n %as d s 1un&i nes de% & mand net#orC *ue se uti%i3an a% & n1i2urar % s pr t & % s de enrutamient . 6!%i7a d s p&i nes8. J identifica qu redes se incluirn en las actuali)aciones de enrutamiento identi1i&a %as dire&&i nes de h st *ue se pueden resumir en %a red se uti%i3a para enumerar t das %as dire&&i nes para redes % &a%es y rem tas determina *u) m,s&ara de subred ap%i&ar en %as a&tua%i3a&i nes de enrutamient J determina qu interfaces pueden en(iar y reci%ir actuali)aciones de enrutamiento

C nsu%te %a presenta&i'n. C d s % s r uters e7e&utan ?/0#1. -9u) &ambi s se pr du&ir,n en %a tab%a de enrutamient de% r uter E si se & n1i2ura una inter1a3 % pba&K & n una dire&&i'n 10.1;.1.12FD27 en e% r uter E. 4e a2re2an rutas a %as redes 10.1;.1.0D27, 10.1;.1.;4D27 y 10.1;.1.12BD27.

e agrega una ruta conectada a la red 10.13.1.12'/29. 4e a2re2a una ter&era ruta a %a red 10.0.0.0DB & n ?/0#1 & m e% ri2en. +a ruta 10.0.0.0DB se des& ne&ta inmediatamente de %a tab%a de enrutamient despu)s de *ue se & n1i2ura e% r uter E.

C nsu%te %a presenta&i'n. + s ? uters !ast y Mest se & n1i2uran usand e% ?/0#1. Amb s r uters en#$an a&tua%i3a&i nes s bre sus rutas dire&tamente & ne&tadas. !% r uter !ast puede ha&er pin2 a %a inter1a3 seria% de% r uter Mest y e% r uter Mest puede ha&er pin2 a %a inter1a3 seria% de !ast. 4in embar2 , nin2un de % s r uters aprendi' de 1 rma din,mi&a de% tr . -Cu,% es p sib%emente e% pr b%ema. 4e re*uiere una 2ateway de 5%tim re&urs . !% ?/0#1 n admite %a di#isi'n de redes. J El -!"(1 no admite @L <. >n de % s r uters ne&esita una 1re&uen&ia de re% 7 en %a inter1a3 seria%. 9

4e %e ha s %i&itad a un administrad r de red *ue %a in1raestru&tura de %a dire&&i'n /0 de %a & mpaH$a debe &ump%ir & n ?<C 1F1B. -9u) tres ran2 s de dire&&i'n /0 de ?C< 1F1B puede uti%i3ar e% administrad r en %a red. 6!%i7a tres p&i nes8. J 10.0.0.0/' 127.0.0.0DB 1;F.2:4.0.0D1; J 192.13.0.0/12 J 1&2.13'.0.0/13 20F.1;:.201.0D27

1 0

C nsu%te %a presenta&i'n. ?/0#1 est, & n1i2urad & m e% pr t & % de enrutamient en %a red *ue se muestra. !n &ada r uter, se uti%i3an % s si2uientes & mand sJ router rip net#orC 10.0.0.0 net#orC 192.13.0.0 Cuand esta & n1i2ura&i'n est, & mp%eta, % s usuari s en %a +AN de &ada r uter n est,n habi%itad s para a&&eder a %as +AN rem tas. -0 r *u). +as senten&ias de red est,n & n1i2uradas de manera in& rre&ta. 4e ha &read un r utin2 % p. J -!"(1 no puede enrutar hacia las redes discontinuas de una red principal. ?/0#1 n puede enrutar redes & n una m,s&ara de subred D24.

1 1

C nsu%te %a presenta&i'n. -9u) & mand %e permitir, a% ? uter2 aprender de %a red 1F2.1;B.1;.0D2B. ? uter16& n1i28A ip classless J -outer1.config1router/0 net#orC 1&2.13'.13.0 ? uter16& n1i2=r uter8A no passi(e1interface serial 0/1/1 ? uter26& n1i2=r uter8A (ersion 2

? uter26& n1i2=r uter8A neigh%or 10.0.0.2 1 2

C nsu%te %a presenta&i'n. +a red e"hibida & ntiene una me3&%a de r uters Cis& y tr s *ue n s n Cis& . 4e in2res' e% & mand de%ug ip rip en e% r uter JAL. C d s % s r uters est,n e7e&utand %a misma #ersi'n de ?/0. !% ? uter CI/ y e% ? uter G?+ n pueden a%&an3ar %a red 1F2.1;B.1.1;D2B. -Cu,% es %a p sib%e s %u&i'n para este pr b%ema. Iabi%itar un h ri3 nte di#idid en %a red. J *onfigurar -!"(2 en los routers. A2re2ar %a red 1F2.1;B.1.0 a %a & n1i2ura&i'n ?/0 de% r uter JAL. C n1i2urar JAL <a0D0 & m una inter1a3 pasi#a. Iabi%itar %a inter1a3 4eria%0D0D0 en e% r uter JAL. Cambiar %a dire&&i'n /0 en %a inter1a3 <a0D0 de% r uter JAL p r 1F2.1;B.1.1D24. 1 3

?/0#2 es e% pr t & % de enrutamient & n1i2urad en % s r uters de una red. 4e in2resa e% & mand ? uter6& n1i2=r uter8A no (ersion 2 en % s r uters. -9u) e1e&t tiene in2resar este & mand en %as a&tua%i3a&i nes de enrutamient . +as m,s&aras de subred se a2re2ar,n a %as a&tua%i3a&i nes de enrutamient . J Las actuali)aciones de enrutamiento se en(iarn mediante la direccin multicast 225.0.0.&. 4e re&ibir,n %as a&tua%i3a&i nes de %a #ersi'n 1 y 2P y n se en#iar,n %as a&tua%i3a&i nes de %a #ersi'n 2. !% pr &es de enrutamient ?/0 se e%iminar, de% r uter y n se reen#iar,n %as a&tua%i3a&i nes de enrutamient .

1 4

C nsu%te %a presenta&i'n. 4i t d s % s r uters est,n e7e&utand ?/0 #ersi'n 2, -p r *u) n hay una ruta para %a red 1F2.1;B.1.32D27. ?/0 #ersi'n 2 n en#$a %as m,s&aras de subred en sus a&tua%i3a&i nes. !% ? uter A n est, & n1i2urad & n ?/0 & m un pr t & % de enrutamient . J -!" (ersin 2 autoresumir las rutas por defecto. !% ? uter E n est, & n1i2urad para pub%i&ar %a red 1F2.1;B.1.;4D30. 1 5

-Cu,% es e% di,metr de red m,"im permitid p r %a m)tri&a p r de1e&t de ?/0#2. J 18 saltos 1; sa%t s 100 sa%t s 120 sa%t s 2:: sa%t s

1 6

C nsu%te %a presenta&i'n. >n t)&ni& debe a2re2ar una nue#a inter1a3 % pba&K para pr bar %a 1un&i na%idad de% enrutamient y e% diseH de red. !% t)&ni& in2resa e% si2uiente & n7unt de & mand s en e% r uterJ 4an1 rd6& n1i28A interface loop%acC1 4an1 rd6& n1i2=i18A ip address 1&2.13'.3.32 288.288.288.282 -0 r *u) e% r uter resp nde & n un err r. !% r uter n permite & n1i2ura&i nes de inter1a3 % pba&K.

!sta m,s&ara n se puede uti%i3ar & n esta &%ase de dire&&i nes. !% enrutamient sin &%ase debe & n1i2urarse antes de *ue se a2re2ue esta dire&&i'n. J La direccin de red de Loop%acC1 se superpone con una direccin de interfa) ya configurada. !% r uter est, p r en&ima de% %$mite m,"im de rutas *ue se pueden pr p r&i nar en %a tab%a de enrutamient . 1 7

>n administrad r de red insta%' &uatr r uters nue# s *ue est,n e7e&utand ?/0#2. !% ? uter1 es un r uter de b rde en %a red ?/0#2 y tiene una ruta & n1i2urada p r de1e&t . >na #e3 *ue %a red ha & n#er2id , e% administrad r de red in2resa en e% ? uter 1, ? uter16& n1i2=r uter8A default1information originate. -C'm a1e&tar, esta a&&i'n a %a red. e#ita *ue e% ? uter1 reen#$e a&tua%i3a&i nes a&er&a de %as redes *ue n est,n dire&tamente & ne&tadas &asi na *ue t d s % s r uters en %a red sin&r ni&en a&tua%i3a&i nes de enrutamient & n e% ? uter1 b%i2a a% ? uter1 a & n#ertirse en e% r uter primari r uter desi2nad 6(?8 para %as a&tua%i3a&i nes J propaga la ruta por defecto a todos los routers en la red

1 8

C nsu%te %a presenta&i'n. -9u) se puede & n&%uir de% resu%tad *ue apare&e en %a presenta&i'n. +a tab%a de enrutamient est, %imitada a 2 rutas. +as inter1a&es +AN est,n parti&ipand de% pr &es de enrutamient . 4e ha en#iad una a&tua%i3a&i'n de &ada inter1a3 seria% y se han re&ibid 2. J ?o se ha configurado el comando no auto1summary en este router. 1 9

C nsu%te %a presenta&i'n. C d s % s r uters est,n e7e&utand ?/0 #ersi'n 2. JAL est, & n1i2urad para pub%i&ar s'% %a red 10.0.0.0D24. CI/ est, & n1i2urad para pub%i&ar %a red 172.1;.0.0D1;. >n administrad r de red in2resa % s & mand s *ue se muestran en %a presenta&i'n. -9u) &ambi s se pr du&ir,n en esta red. !% r uter JAL i2n rar, %as a&tua%i3a&i nes para %a red 172.1;.0.0D1; p r &uesti nes de h ri3 nte di#idid . J El router *I! instalar una ruta a la red 1&2.13'.0.0/13 en la ta%la de enrutamiento. +a tab%a de enrutamient de CI/ tendr, %a ruta 1F2.1;B.0.0D1; per tendr, una 4 7unt a %a ruta. El router ORL aplicar una mscara de subred 255.255.0.0 a todas las redes en las actualizaciones de enrutamiento que reenve.

2 ?e1i)rase a% b7et e"puest . -Cu,% d s de&%ara&i nes s n #erdaderas. 6!s& 7a d s.8 0 J-outer1 instalar una ruta a 1&2.13'.0.0/20 ? uter1 insta%ar, una ruta a 1F2.1;B.0.0D24 ? uter1 insta%ar, una ruta a 1F2.1;B.1;.0D24 ? uter2 insta%ar, una ruta a 1F2.1;B.1;.0D24 J -outer2 no instalar una ruta a 1&2.13'.13.0/20

CCNA 2 Chapter B 2011 V4.0 Answers 100%

June 13, 2011 by admin 10 C mments

Our Sponsors CCNA 2 Chapter - 2011 V4.0 Answers 100% 1.

Refer to the exhibit. Router 8 receives a packet with a destination address of 15.1-.1.3.. #hat will router 8 do? rop the pac$et forwar the pac$et !ia the route to 10.17.1.0 forwar the pac$et !ia the route to 10.17.1.74 use the efault route 2. / network is converged and the routing tables are co the best path in the routing table? the route with the smallest A@ the route with the lon"est a ress an mas$ match to the estination the route with the hi"hest #an wi th the route with the #est com#ination of A@ an lowest cost $. plete. #hen a ine packet needs to be forwarded, what is the first criterion used to deter

Refer to the exhibit. #hich state (&B0' is #ein" use

ent correctl" describes this network?

There is at least one parent an one chil route 1,2.17-.2.06 1,2.17-.8.06 an 1,2.17-.4.0 networ$s are chil routes Traffic "oin" to 1:2.17.8.0 will #e irecte to s 0+0+1 (.

Refer to the exhibit. Router1 has been issued the ip classless co #hat happens to packets destined to host 1.2.1-.$.15? the) are roppe sent to efault "atewa) forwar out interface Serial0+0+1 forwar out interface *ast(thernet 0+0 *. The following entr" is displa"ed in the routing table> R 132.1-2.2.5?2( @125?2A via 132.1-2.(.1, 55>55>2-, ,erial5?5?1 #hat t"pe of route is this? a le!el 1 parent route a le!el 1 supernet route a le!el 1 ultimate networ$ route

and.

a le!el 2 chil route a le!el 2 ultimate chil route -. #hat deter process? Chil routes are present in the routin" ta#le. A classless routin" protocol has #een confi"ure on the router. The comman ip classless is ena#le on the router. /ultiple routes with ifferent mas$s to the same estination are in the routin" ta#le. 0outin" ta#le entries ha!e a ne%t<hop &' a route. .. ress an an e%it interface for each chil ines if the router i ple ents a classless route lookup

Refer to the exhibit. )ow ulti 8 4 5 7 : 2. ateroutes?

an" routes in this output qualif" for use as

Refer to the exhibit. #hat protocol was used to distribute the routinginfor 0&'!1 ation for the network 1.2.1-.1.(?

0&'!2 (&B0' OS'* 3.

Refer to the exhibit. #hat can be deter 1,2.17-.2.218+24.

ined fro

this output?

The router will ha!e to perform recursi!e loo$ups to forwar a pac$et estine for The parent route for these networ$s was remo!e from the routin" ta#le. A route to 1,2.17-.0.0+25 woul #e classifie as a supernet route for the routes liste in theroutin" ta#le. All of the routes liste are networ$ routes. 15.

Refer to the exhibit. The graphic contains partial contents of the routing table on router 9. Router 9 is running version 12.$ of the I+, and is configured for default routing behavior. Router 9 receives a packet to forward. #hich route in the routing table will be searched first and wh"? 1:2.17.1.0+25 #ecause it is the first ultimate route 0.0.0.0+0 #ecause it is the lowest networ$ num#er 1:2.17.0.0+25 #ecause it is the first le!el 1 route 1:2.1-.0.0+15 #ecause it has the shortest mas$ 11.

Refer to the exhibit. Router1 is running I+, version 12.2. #hat will the network ad inistrator need to do so that packets for unknown child routes of 1.2.1-.5.5?2( will not be dropped? issue the ip efault<networ$ comman use a classful routin" protocol such as 0&'!1 ena#le either OS'* or &S&S as the routin" protocol issue the ip classless comman o nothin"6 ip classless is on #) efault 12.

Refer to the exhibit. #ith the ip classless co rop the pac$et sen pac$et out Serial 0+0+1 sen pac$et to networ$ 0.0.0.0 sen pac$et out *ast(thernet 0+0

and issued, what will

router R2 do with a packet destined for host 1.2.1-.(.2$(?

1$. / router has the following entries in its routing table> , 132.1-2.5.5?2( @1?5A via 132.1-2.122.2 + 132.1-2.5.5?2* @115?21.*A via 1.2.1-.1.1, 55>52>1*, :ast9thernet5?1

4 132.1-2.5.5?2* @35?22(**A via 1.2.1-.2.2, 55>12>1*, ,erial5?5?5 R 132.1-2.5.5?2- @125?2A via 1.2.1-.$.$, 55>55>1*, ,erial5?5?1 The router receives a packet that is destined for a host with the address 132.1-2.5.*2. #hich route would this router use to forward the packet? the static route the OS'* route the (&B0' route the 0&' route 1(.

Refer to the exhibit. #hat parent network will auto 1:2.17.0.0+17 1:2.17.0.0+24 1:2.17.0.0+80 1:2.17.1.0+17 1:2.17.1.0+24 1*.

aticall" be included

in therouting table when the three subnets are configured on Router1?

Refer to the exhibit. #hat subnet 0.0.0.0

ask will Router1 appl" to

child routes of the 1.2.1-.5.5?2( network?

255.255.0.0 255.255.255.0 255.255.255.255 1-.

Refer to the exhibit. The network ad dropped b" Router2. #hat co 5?5?1? ip classless no ip classless ip efault<networ$ 0.0.0.0 ip efault<"atewa) 1:2.17.254.1 ip route 0.0.0.0 0.0.0.0 Serial 0+0+1 1..

inistrator has discovered that inistrator issue to

packets destined for servers on the 1.2.1-.2*(.5 network are being and should the ad ensure that these packets are sent out the gatewa" of last resort, ,erial

Refer to the exhibit. / packet destined for host 122.15..5.*?1- is processed b" the F/J router. /fter finding the static route in the routing table that atches the destination network for this packet, what does the router do next?

searches for a efault route to forwar the pac$et rops the pac$et since the static route oes not ha!e an e%it interface performs a recursi!e loo$up to fin the e%it interface use to forwar the pac$et sen s a request to nei"h#orin" routers for the location of the 12-.10:.0.0 networ$ 12. #hat occurs when no ip classless is i The router will onl) support classful &' a ple ented on the router? ressin".

The router will onl) support classful routin" protocols. The router will use a efault route6 if present6 when a matchin" route is not foun in theroutin" ta#le. The router will assume it has $nowle "e of all su#nets in the networ$ an will not search #e)on chil routes for a #etter match. 13. / route to a destination network is learned fro ultiple routing protocols. #hat is used b" a &isco router to select the preferred route to the destination that will be installed in the routing table? metric route prefi% up ate timer a ministrati!e istance

(ste e%Qmen esta al ,4%6 recuer en tomenlo como fuente e estu io asi apren eran mas.

CCNA 2 Chapter F 2011 V4.0 Answers 100%

June 13, 2011 by admin 14 C mments

Our Sponsors CCNA 2 Chapter , 2011 V4.0 Answers 100% 1. #hat two actions will the 9I=R! 4I/0 :,6 take if a link to a network goes down? %&hoose two.' put the route into passi!e mo e quer) nei"h#ors for a new route search routin" ta#le for a feasi#le successor run the S'* al"orithm to fin a new successor search topolo") ta#le for a feasi#le successor 2.

)ost 132.1-2.1.-- in the network illustrated is unable to ping host 132.1-2.1.1$5. )ow ust 9I=R! be configured to enable connectivit" between the two hosts? %&hoose two.' 01;confi"<router=> network 132.1-2.1.122 01;confi"<router=> auto7su 01;confi"<router=> no auto7su 02;confi"<router=> no auto7su 02;confi"<router=> auto7su $. ar" ar" ar" ar"

02;confi"<router=> network 132.1-2.1.-(

Refer to the exhibit. The co an autono successful. ous s"ste nu

pan" is using 9I=R! with ber of 15. !ings between hosts on networks

that are connected to router / and those that are connected to router 8 are )owever, users on the 132.1-2.$.5 network are unable to reach users on the 132.1-2.1.$2 network. #hat is the ost likel" cause of this proble ? &' classless is ena#le an is causin" the pac$et to rop. The comman networ$ 1,2.17-.1.82 was not issue on router C. The routers are not confi"ure in the same (&B0' routin" omain. Automatic summariDation of the networ$s is causin" the su#nette routes to #e roppe . (. #hat infor ation is aintained in the 9I=R! topolog" database for a destination route? %&hoose three.' the routin" protocol the feasi#le istance of the route the hi"hest cost of the route the S0TT !alue for the route the route cost as a !ertise #) the nei"h#orin" router the ph)sical a ress of the "atewa) interface aintain a list of *. +n a router running 9I=R!, what database would feasible successors? routin" ta#le nei"h#or ta#le topolo") ta#le a Gacenc) ta#le -.

Refer to the exhibit. #hat is indicated b" the ! at the beginning of the topolog" entr"? the route is in a sta#le state the route is a preferre route @AA4 is searchin" for a #etter route to this estination the e%it interface is in passi!e mo e an (&B0' a !ertisements are #loc$e .. In the co and router eigrp 25, what is the purpose of the nu ber 25? specifies the a ministrati!e istance for all (&B0' routes i entifies the autonomous s)stem num#er this (&B0' process will a !ertise etermines what metric is a in icates the num#er of a 2. e to all a !ertise routes resses in the (&B0' routin" omain

Refer to the exhibit. In the topolog" table, what do the nu and $122-3* represent? the route metric that is applie to those (&B0' routes for this router the trustworthiness of the routin" information source

bers $5112(5

the composite of the hop count an #an wi th to that estination networ$ the total metric for that networ$ as a !ertise #) the (&B0' nei"h#or

3. #hich two state

ents describe characteristics of 9I=R!? %&hoose two.'

(&B0' is a istance !ector routin" protocol. (&B0' supports classless routin" an V4S/. (&B0' is classifie as a lin$<state routin" protocol. (&B0' uses TC' for relia#le eli!er) of (&B0' up ate pac$ets. .ith (&B0'6 loop<free paths are achie!e throu"h the use of hol < own timers. (&B0' sen s a perio ic up ate e!er) 80 minutes. 15.

Refer to the exhibit. 1etwork 132.1-2.5.5?22 goes down. #hat t"pe of packet does Router2 i ediatel" send to Router1 and Router$? a quer) for networ$ 1,2.17-.0.0+2an ac$nowle "ment pac$et to 224.0.0., an up ate pac$et that is sent to 255.255.255.255 a pac$et that contains the new routin" ta#le for 02 unicast up ate pac$ets to 1,2.17-.1.1 an 1,2.17-.2.1 11.

Refer to the exhibit. #hich co networ$ 1,2.17-.1.0 networ$ 1,2.17-.1.0 255.255.255.0

and will advertise the 132.1-2.1.-(?$5

network but not the 132.1-2.1.$2 network on router /?

networ$ 1,2.17-.1.74 0.0.0.8 networ$ 1,2.17-.1.74 0.0.0.: networ$ 1,2.17-.1.74 0.0.0.255 12. #hat ad the autono 1 5 :0 ,0 1:0 1,0 1$. In which of the following tables does the 9I=R! 4I/0 algorith the pri routin" topolo") nei"h#or path shortest path 1(. #hich of the following t"pes of routes will be denoted b" 9J in 9I=R!routing table entries? %&hoose two.' routes learne from other routin" protocols routes learne from an) non<a Gacent (&B0' routers an) route with a hop count metric hi"her than 224 (&B0' routes that ori"inate in ifferent autonomous s)stems all passi!e routes in the routin" ta#le 1*. #hich ter theInternet? autonomous s)stem conti"uous networ$s process &@ 9B' 1-. defines a collection of networks under the ad inistrative control of a single entit" that presents a co on routing polic" to ar" route to a destination? %&hoose two.' store inistrative distance would a router assign to a default route a source external to ous s"ste ? in 9I=R! that is learned fro

Refer to the exhibit. 9I=R! is the onl" routing protocol enabled on this network. 1o static routes are configured on this router. #hat can be concluded about network 132.12.1.5?2( fro the exhibited output? A route to networ$ 1,-.1-.1.0+24 is not liste in the routin" ta#le. 'ac$ets that are estine for 1,-.1-.1.0+24 will #e forwar e to 1,-.1-.10.7. (&B0' will perform equal cost loa #alancin" across two paths when forwar in" pac$ets to 1,-.1-.1.0+24. The router with interface 1:2.17.8.2 is a successor for networ$ 1,-.1-.1.0+24. 1..

Refer to the exhibit. /ll interfaces have been configured with the bandwidths that are shown in the exhibit. /ssu ing that all routers are using a default configuration of 9I=R! as their routing protocol, what path

will packets take fro network? A696( A6C6( A6@6(

the 1.2.1-.1.5?1- network to the 132.1-2.255.5?2(

'ac$ets will loa #alance across the A696( an A6C6( paths. 'ac$ets will loa #alance across the A696( an A6@6( paths. 'ac$ets will loa #alance across the A6C6( an A6@6( paths. 12. 8" default, which two path between networks? /TA loa ela) #an wi th relia#ilit) 13. #hich of the following state b" 9I=R!? 9oun e up ates are sent to all routers within an autonomous s)stem. 'artial up ates are sent onl) to routers that nee the information. The up ates are sent to all routers in the routin" ta#le. Ap ates are #oun e #) the routers in the topolo") ta#le. 25. The show ip eigrp topolog" co and output on a router displa"s a successor route and a feasible successor route to network 132.1-2.1.5?2(. In order to reduce processor utiliCation, what does 9I=R! do when the pri ar" route to this network fails? The router sen s quer) pac$ets to all (&B0' nei"h#ors for a #etter route to networ$ 1,2.17-.1.0+24. The @AA4 *S/ imme iatel) recomputes the al"orithm to calculate the ne%t #ac$up route. 'ac$ets that are estine for networ$ 1,2.17-.1.0+24 are sent out the efault "atewa)instea . The #ac$up route to networ$ 1,2.17-.1.0+24 is installe in the routin" ta#le. 21. ents describes the bounded updates used etrics are used b" 9I=R! to deter ine the best

Refer to the exhibit. 8ased on the output of show ip eigrp neighbors, what are two possible proble %&hoose two.' The routers are confi"ure with ifferent (&B0' process &@s. Automatic summariDation was isa#le . The hello timer for 01 was altere . The serial interfaces for #oth routers are in ifferent networ$s. No feasi#le successors were foun . 22. s with ad;acencies between Router1 and Router2?

Refer to the exhibit. This is the debug output fro #hat is the cause? one router is a non<cisco router the) ha!e ifferent autonomous<s)stem num#ers the) are usin" ifference sequence num#ers the) are sen in" incorrect hello t)pes

2 ing an ad;acenc".

directl" connected 9I=R! routers. The" are not for

Examen CCNA2 v4.0 Captulo 10

E,amen **?22 (5.0 *apBtulo 10 1 -Cu,%es s n %as #enta7as de usar un pr t & % de enrutamient de %inK=state en %u2ar de un #e&t r distan&ia. 6!%i7a d s p&i nes8. +a base de dat s de t p % 2$a e%imina %a ne&esidad de una tab%a de enrutamient . J*ada router determina de manera independiente la ruta a cada red. + s pr t & % s de %inK=state re*uieren men r p ten&ia de% pr &esad r de% r uter *ue % s pr t & % s #e&t r distan&ia. J=espus de la inundacin L " inicial6 generalmente requieren menos ancho de %anda para comunicar cam%ios en una topologBa. 4e en#$an a&tua%i3a&i nes peri'di&as 1re&uentes para minimi3ar %a &antidad de rutas in& rre&tas en %a base de dat s t p %'2i&a. 2 A un administrad r de red se %e asi2na %a tarea de se%e&&i nar un pr t & % de enrutamient din,mi& apr piad para una & mpaH$a de desarr %% de s 1tware. +a & mpaH$a p see m,s de 100 r uters, uti%i3a C/(? y V+4@, re*uiere & n#er2en&ia r,pida y uti%i3a e*uip s Cis& y tr s *ue n s n Cis& . -9u) pr t & % de enrutamient es ade&uad para esta & mpaH$a. ?/0 #ersi'n 2 /N?0 !/N?0 JA "F EN0 3 C nsu%te %a presenta&i'n. -9u) tip de in1 rma&i'n se #er$a en un +40 en#iad desde e% r uter JAL a% r uter AC+. & nte de sa%t s tiemp de a&ti#idad de %a ruta Jcosto del enlace una %ista de t d s % s pr t & % s de enrutamient en us 4 C nsu%te %a presenta&i'n. Cuand se & n1i2ura e% ? uter ( para uti%i3ar un pr t & % de enrutamient de estad de en%a&e y se a2re2a a %a red, -*u) es % primer *ue ha&e para & men3ar a aprender %a t p % 2$a de red. !n#$a % s pa*uetes +40 a % s ? uters E y C. !n#$a % s pa*uetes +40 a t d s % s r uters en %a red. !n#$a % s pa*uetes de sa%ud a t d s % s r uters en %a red. !n#$a in1 rma&i'n s bre sus #e&in s dire&tamente & ne&tad s a % s ? uters A y !. !n#$a in1 rma&i'n s bre sus #e&in s dire&tamente & ne&tad s a t d s % s r uters en %a red. J2prende so%re las redes directamente conectadas cuando las interfaces alcan)an el estado de completo. : -9u) a%2 ritm e7e&utan % s pr t & % s de enrutamient de estad de en%a&e para &a%&u%ar %a ruta m,s & rta ha&ia %as redes de destin . (>A+ J=i+Cstra Ee%%man=< rd (i11ie=Ie%%man ; 0ara a%&an3ar %a & n#er2en&ia de red, -&u,%es s n % s tres pas s *ue rea%i3a &ada r uter de %inK=state. 6!%i7a tres p&i nes8. uti%i3ar %a sumari3a&i'n aut m,ti&a para redu&ir e% tamaH de %as tab%as de enrutamient Jconstruir un "aquete de LinC1 tate .L "/ que contiene el estado de cada enlace directamente conectado Jinundar el L " a todos los (ecinos6 los cuales luego almacenan todos los L " reci%idos en una %ase de datos

a. %. &. d. e.

a. b. &. d. e. a. b. c. d.

a. b. &. d. e. f.

a. %. &. d. a. %. c.

d. e. 1.

a. b. c. d. a. b. c. d. a. %. &. d. a. b. &. d. a. b. &. d. a. b. &. d. e. a. %. &. d. e. a.

en#iar pa*uetes de sa%ud a inter#a% s re2u%ares para des&ubrir #e&in s y estab%e&er adya&en&ias Jconstruir un mapa completo de la topologBa y calcular el me+or camino hacia cada red destino uti%i3ar %a <4@ (>A+ para se%e&&i nar %as rutas e1i&ientes sin bu&%es e insertar rutas en %a tab%a de enrutamient 7 C nsu%te %a presenta&i'n. -Cu,% de %as si2uientes a1irma&i nes des&ribe & rre&tamente %a ruta *ue e% tr,1i& t mar$a desde %a red 10.0.0.0D24 ha&ia %a red 1F2.1;B.1.0D24 si estu#iera en us un pr t & % de enrutamient de estad de en%a&e. EG4 =Q AC+ p r*ue esta ruta tiene %a men r &antidad de sa%t s EG4 =Q AC+ p r*ue esta ruta tiene e% & st m,s e%e#ad J7A 1M A-L 1M N2F 1M 2:L porque esta ruta tiene el costo ms %a+o e% tr,1i& har$a e% ba%an&e de &ar2a en t d s % s en%a&es B -0 r *u) es di1$&i% *ue se pr du3&an r utin2 % ps en redes *ue usan enrutamient de estad de en%a&e. Cada r uter desarr %%a una #isi'n simp%e de %a red basada en e% & nte de sa%t s. + s r uters inundan %a red & n +4A para des&ubrir r utin2 % ps. J*ada router desarrolla una (isin completa y sincroni)ada de la red. + s r uters usan temp ri3ad res de espera para pre#enir % s r utin2 % ps. F C nsu%te %a presenta&i'n. -9u) ha&e e% r uter JAL & n % s pa*uetes de estad de en%a&e de G?+. en#$a %as tab%as de enrutamient a&tua%i3adas a % s r uters G?+ y EG4 Jen(Ba los paquetes de estado de enlace indi(idual a la interfa) conectada a 7A & nsu%ta a EG4 para #er si tiene una ruta me7 r s'% %a a2re2a a %a tab%a de enrutamient % &a% y n rea%i3a nin2una tra a&&i'n 10 -9u) es % *ue a2i%i3a %a & n#er2en&ia en una red *ue usa enrutamient de estad de en%a&e. Jlas actuali)aciones se desencadenan cuando se producen cam%ios en la red %as a&tua%i3a&i nes se en#$an a inter#a% s re2u%ares %as a&tua%i3a&i nes se en#$an s'% a % s #e&in s & ne&tad s a&tua%i3a&i nes *ue in&%uyen tab%as de enrutamient & mp%etas 11 -9u) 1un&i'n pr p r&i nan % s pr t & % s de estad de en%a&e m dern s para minimi3ar e% pr &esamient y % s re*uisit s de mem ria. Rdi#idir t p % 2$as de enrutamient en ,reas m,s pe*ueHas asi2nar pri ridades de pr &es m,s ba7as a &,%&u% s de ruta uti%i3ar temp ri3ad res de a&tua%i3a&i'n para restrin2ir %as a&tua%i3a&i nes de enrutamient restrin2ir %as re2%as de h ri3 nte di#idid para redu&ir %as entradas de %a tab%a de enrutamient 12 -Cu,nd % s pa*uetes de estad de en%a&e se en#$an a % s #e&in s. &ada 30 se2und s &ada 1B0 se2und s despu)s de *ue termine e% tiemp de espera Jcuando un enlace se acti(a o desacti(a &uand &urre un r utin2 % p 13 -Cu,%es s n % s e#ent s *ue har,n *ue e% r uter de estad de en%a&e en#$e +40 a t d s % s #e&in s. 6!%i7a d s p&i nes8. e% temp ri3ad r de 30 se2und s e"pira Jcada (e) que la topologBa de red cam%ia inmediatamente despu)s de e7e&utar e% a%2 ritm Ee%%man=< rd inmediatamente despu)s de *ue <4@ (>A+ & nstruye %a base de dat s de t p % 2$a Jen la puesta en marcha inicial del router o del protocolo de enrutamiento 14 -9u) base de dat s tab%a debe ser id)nti&a en % s r uters de en%a&e de dat s dentr de un ,rea para & nstruir un ,rb % 40< pre&is . tab%a de enrutamient

b. tab%a de adya&en&ia c. J%ase de datos de estado de enlace d. tab%a de #e&in e. base de dat s de t p % 2$a 1: -9u) d s pr t & % s de enrutamient uti%i3an e% primer a%2 ritm de ruta m,s & rta de (i7Kstra. 6!%i7a d s p&i nes8. a. ?/0#1 b. ?/0#2 c. J! 1! d. EN0 e. !/N?0 f. JA "F 1; -Cu,% es e% 5%tim pas en e% pr &es de enrutamient de estad de en%a&e. a. % s su&es res se & % &an en %a tab%a de enrutamient %. J "F calcula la me+or ruta a cada red destino &. + s +40 se inundan ha&ia t d s % s #e&in s para & n#er2er %a red d. !% a%2 ritm (>A+ se e7e&uta para ha%%ar %a me7 r ruta ha&ia %as redes de destin 17 -Cu,%es s n %as a1irma&i nes *ue des&riben & rre&tamente e% pr &es de enrutamient de %inK=state. 6!%i7a d s p&i nes8. a. Jtodos los routers en el rea tienen %ases de datos de linC1state %. Jcada router en el rea inunda los L " hacia todos los (ecinos &. % s +40 uti%i3an %a dire&&i'n mu%ti&ast reser#ada de 224.0.0.10 para a%&an3ar % s #e&in s d. % s r utin2 % ps se e#itan a% e7e&utar e% a%2 ritm de a&tua%i3a&i'n di1usa 6(>A+8 e. e% 0r t & % de Cransp rte C n1iab%e 6?C08 es e% pr t & % uti%i3ad para e% en#$ y %a re&ep&i'n de +40 1B -9u) a&&i'n t ma inmediatamente un r uter de estad de en%a&e a% re&ibir un +40 de un r uter #e&in . a. Jsatura el L " a los (ecinos b. &a%&u%a e% a%2 ritm 40< &. e7e&uta e% a%2 ritm Ee%%man=< rd d. &a%&u%a %a me7 r ruta a %a red destin 1F C nsu%te %a presenta&i'n. 4i t d s % s r uters e inter1a&es est,n & n1i2urad s para uti%i3ar un pr t & % de enrutamient de estad de en%a&e, -desde *u) r uters re&ibir, e% ? uter ( % s pa*uetes de sa%ud . a. A y ! %. J7 y * &. A, E, C, y ! d. C s %amente

CCNA 2 Chapter 10 2011 V4.0 Answers 100%

June 13, 2011 by admin 17 C mments

Our Sponsors CCNA 2 Chapter 10 2011 V4.0 Answers 100% 1. #hat action does a link7state router take i 0,! fro a neighboring router? floo s the 4S' to nei"h#ors calculates the S'* al"orithm runs the 9ellman<*or al"orithm computes the #est path to the estination networ$ 2. #h" is it difficult for routing loops to occur in networks that use link7 staterouting? (ach router #uil s a simple !iew of the networ$ #ase on hop count. 0outers floo the networ$ with 4SAs to isco!er routin" loops. (ach router #uil s a complete an s)nchroniDe !iew of the networ$. 0outers use hol < own timers to pre!ent routin" loops. $. ediatel" upon receipt of an

Refer to the exhibit. #hat kind of infor sent fro hop count uptime of the route router F/J to router /T0?

ation would be seen in an 0,!

cost of the lin$ a list of all the routin" protocols in use (. To achieve network convergence, what three steps does each link state router take? %&hoose three.' use automatic summariDation to re uce the siDe of routin" ta#les #uil a 4in$ State 'ac$et ;4S'= containin" the state of each irectl) connecte lin$ floo the 4S' to all nei"h#ors6 who then store all 4S's recei!e in a ata#ase isco!er nei"h#ors an esta#lish a Gacencies usin" the hello pac$et sent at re"ular inter!als construct a complete map of the topolo") an compute the #est path to each estination networ$ use the @AA4 *S/ to select efficient6 loop<free paths6 an insert routes into the routin"ta#le *.

Refer to the exhibit. #hen Router 4 is configured to use a link7 state routingprotocol and is added to the network, what is the first thing that it does to begin learning the network topolog"? &t sen s 4S' pac$ets to 0outers 9 an C. &t sen s 4S' pac$ets to all routers in the networ$. &t sen s 3ello pac$ets to all routers in the networ$. &t sen s information a#out its irectl) connecte nei"h#ors to 0outers A an (. &t sen s information a#out its irectl) connecte nei"h#ors to all routers in the networ$. &t learns a#out its irectl) connecte networ$s when its interfaces reach the up state. -. / new network ad appropriate d"na develop equip ent co inistrator is given the task of selecting an pan" has over 155 routers, uses &I4R and pan"? ic routing protocol for a software pan". The co

<0,6, requires fast convergence, and uses both &isco and non7&isco ent. #hich routing protocol is appropriate for this co 0&' !ersion 2

&B0' (&B0' OS'* 9B' .. #hat two events will cause a link state router to send 0,!s to all neighbors? %&hoose two.' 80 secon timer e%pires whene!er the networ$ topolo") chan"es imme iatel) after the 9ellman<*or al"orithm has run imme iatel) after the @AA4 *S/ has #uilt the topolo") ata#ase upon initial startup of router or routin" protocol 2. #hat is the final step in the link state routing process? successors are place into the routin" ta#le S'* computes #est path to each estination networ$ 4S's are floo e to all nei"h#ors to con!er"e the networ$ @AA4 al"orithm is run to fin #est path to estination networ$s 3.

Refer to the exhibit. #hat does F/J do with link7state packets fro sen s out its up ate routin" ta#le to #oth O04 an 9OS routers sen s out the in i!i ual lin$<state pac$ets out the interface connecte to 9OS queries 9OS to see if it has a #etter route onl) a s it to the local routin" ta#le an performs no other actions 15. #hat two state %&hoose two.' each router in the area floo s 4S's to all nei"h#ors all routers in the area ha!e i entical lin$ state ata#ases 4S's use the reser!e multicast a ress of 224.0.0.10 to reach nei"h#ors

+R0?

ents correctl" describe the link state routing process?

routin" loops are pre!ente #) runnin" the @iffusin" Ap ate Al"orithm ;@AA4=

0elia#le Transport 'rotocol ;0T'= is the protocol use #) for the eli!er) an reception of 4S's 11. #hich database or table routin" ta#le a Gacenc) ta#le lin$<state ata#ase nei"h#or ta#le topolo") ata#ase 12. ust be identical on all link7state routers within an area in order to construct an accurate ,!: tree?

Refer to the exhibit. #hich state would take fro

ent correctl" describes the path traffic

the 15.5.5.5?2( network to the 132.1-2.1.5?2( network if

a link7state routing protocol was in use? 9OS <H AT4 #ecause this path is the least hops 9OS <H AT4 #ecause this path is hi"hest cost 9OS <H O04 <H PA2 <H AT4 #ecause this path is the lowest cost traffic woul loa #alance across all lin$s 1$. #hat feature do processing and e odern link7state protocols provide to or" require ents? ini iCe

splittin" routin" topolo"ies into smaller areas assi"nin" lower process priorities to route calculations usin" up ate timers to restrict routin" up ates strict split horiDon rules to re uce routin" ta#le entries 1(. #hat speeds up convergence in a network using link7state routing? up ates tri""ere #) networ$ chan"es up ates sent at re"ular inter!als

up ates sent onl) to irectl) connecte nei"h#ors up ates that inclu e complete routin" ta#les 1*. #hich algorith @AA4 @iG$stra 9ellman<*or @iffie<3ellman 1-. #hat are so e of the advantages of using a link7state routing protocol instead of a distance vector routing protocol? %&hoose two.' The topolo") ata#ase eliminates the nee for a routin" ta#le. *requent perio ic up ates are sent to minimiDe the num#er of incorrect routes in the topolo"ical ata#ase. 0outers ha!e irect $nowle "e of all lin$s in the networ$ an how the) are connecte . After the inital 4SA floo in"6 the) "enerall) require less #an wi th to communicate chan"es in a topolo"). 4in$<state protocols require less router processor power than istance !ector protocols. 1.. is run b" link7state routing protocols to calculate the shortest path to destination networks?

Refer to the exhibit. If all routers and interfaces are configured to use a link7state routing protocol, fro packets? A an ( 9 an C A6 96 C6 an ( C onl) 12. #hich two routing protocols use 4i;kstraDs shortest path first algorith ? %&hoose two.' which routers will router 4 receive hello

0&'!1 0&'!2 &S<&S 9B' (&B0' OS'* 13. #hen are link7state packets sent to neighbors? e!er) 80 secon s e!er) 1-0 secon s after the hol own time e%pires when a lin$ "oes up or own when a routin" loop occurs 25. #hat are two advantages of using a link7state routing protocol instead of a distance vector routing protocol? %&hoose two.' The topolo") ata#ase eliminates the nee for a routin" ta#le. (ach router in epen entl) etermines the route to each networ$. 4in$<state protocols require less router processor power than istance !ector protocols. After the inital 4S' floo in"6 the) "enerall) require less #an wi th to communicate chan"es in a topolo"). *requent perio ic up ates are sent to minimiDe the num#er of incorrect routes in the topolo"ical ata#ase. 21. To achieve network convergence, what three steps does each link state router take? %&hoose three.' use auto atic su ariCation to reduce the siCe of routing tables #uil a 4in$ State 'ac$et ;4S'= containin" the state of each irectl) connecte lin$ floo the 4S' to all nei"h#ors6 who then store all 4S's recei!e in a ata#ase sen hello pac$a"es at re"ular inter!als to isco!er nei"h#ors an esta#lish a Gacencies construct a complete map of the topolo") an compute the #est path to each estination networ$ use the @AA4 *S/ to select efficient6 loop<free paths6 an insert routes into the routin"ta#le

CCNA 2 Chapter 11 2011 V4.0 Answers 100%

June 13, 2011 by admin 13 C mments

Our Sponsors CCNA 2 Chapter 11 2011 V4.0 Answers 100% 1.

Refer to the exhibit. /ll routers are running +,!:. #hat cost would F/J put in its routing table for the 15.5.5.5?2( network? 2 157 1574 1:-5 1:-: 2.

Refer to the exhibit. Router1 and Router2 are running +,!:. The show ip ospf neighbor co and reveals no neighbors. #hat is a possible cause? OS'* autonomous s)stem &@s o not match. OS'* process &@s o not match. OS'* networ$ t)pes are i entical. OS'* hello or ea timers o not match. $. / full" converged five router +,!: network has been running successfull" for several weeks. /ll configurations have been saved and no static routes are used. If one router looses power and reboots, what infor ation will be in itsrouting table after the configuration file is loaded but before +,!: has converged? All routes for the entire networ$ will #e present. @irectl) connecte networ$s that are operational will #e in the routin" ta#le. 9ecause the S'* al"orithm has not complete all calculations6 no routes will #e in the ta#le. A summar) route for all pre!iousl) learne routes will automaticall) appear in the routin"ta#le until all 4S's ha!e #een recei!e #) the router. (.

Refer to the exhibit. #hat configuration state 9;confi"=> int fa5?5 9;confi"<if=> router7id 132.1-2.1.* 9;confi"=> int lo5 9;confi"<if=> ip address 132.1-2.1.* 9;confi"=> router ospf 1 9;confi"<router=> router7id 132.1-2.1.* 9 ;confi"=> router ospf 1 9;confi"<router=> ip address 132.1-2.1.* *.

ents would give the results and?

that are shown in the output of the show ip protocols co

Refer to the exhibit. #hen +,!: is operational in the exhibited network, what neighbor relationship is developed between Router1 and Router2? A *A44 a Gacenc) is forme . A 2.A1 a Gacenc) is forme . 0outer2 will #ecome the @0 an 0outer1 will #ecome the 9@0. 9oth routers will #ecome @0OT3(0S. -. #hat does +,!: use to calculate the cost to a destination network? #an wi th #an wi th an hop count #an wi th an relia#ilit) #an wi th6 loa 6 an relia#lit) ..

Refer to the exhibit. The routers in the exhibit are using default +,!: configuration settings to advertise all attached networks. If all of the routers start at the sa e ti e, what will be the result of the 4R and 84R elections for this single area +,!: network? %&hoose three.' 3M will #e @0 for 10.4.0.0+17. 0outer A will #e @0 for 10.4.0.0+17. 3M will #e 9@0 for 10.4.0.0+17. 0outer A will #e @0 for 10.5.0.0+17. 0emote will #e @0 for 10.5.0.0+17. 0emote will #e 9@0 for 10.5.0.0+17. 2. #hat does +,!: use to reduce the nu of routinginfor root router #ac$up root router omain router #ac$up omain router esi"nate router #ac$up esi"nate router 3. present? %&hoose two.' ber of exchanges bers of neighbors are ation in networks where large nu

Refer to the exhibit. /ll routers have been configured with the interfacepriorities that are shown. /ll routers were restarted si ultaneousl". The results of the 4R?84R election are shown. #hat can be concluded about this network? 0outer C cannot win a @0 election un er an) circumstances. &f the lin$ for interface 1,2.17-.1.4 "oes own6 router 9 will #ecome the new @0. The hi"hest router &@ was most li$el) etermine !ia an OS'* router<i statement or statements. &f a new router is a 15. e with a hi"her router &@ than router @6 it will #ecome the @0.

Refer to the exhibit. Router / is correctl" configured for +,!:. #hich +,!: configuration state ent or set of state ents was entered for router 8 to generate the exhibited routing table? 9;confi"<router=> network 132.1-2.1.5 5.5.5.$ area 5 9;confi"<router=> network 15.1-.1.5 5.5.5.22( area 5 9;confi"<router=> network 15.1-.1.5 2**.2**.2**.22( area 5 9;confi"<router=> network 132.1-2.1.5 2**.2**.2**.2** area 5 9;confi"<router=> network 15.5.5.5 2**.2**.2**.2** area 5 11.

Refer to the exhibit. /ssu

ing that the routers have default interface ent? %&hoose two.'

+,!:priorities and no configured loopback interfaces, what two roles will router 8 pla" on each network seg @0 for networ$ 1,2.17-.1.200 9@0 for networ$ 1,2.17-.1.200 @0OT3(0 on 1,2.17-.1.200 @0 for networ$ 1,2.17-.1.204 9@0 for networ$ 1,2.17-.1.204 @0OT3(0 on networ$ 1,2.17-.1.204 12.

Refer to the exhibit. Routers /, 8, &, and 4 are all running +,!: with default router I4s and +,!: interface priorities. 0oopback interfaces are not configured and all interfaces are operational. Router 4 is the 4R and router & is the 84R. #hat happens i co ands are entered on router /? A;confi"=> interface fa5?5 A;confi"<if=> ip ospf priorit" 2** A will #ecome the @0. @ will #ecome the 9@0. A will #ecome the @0. C will remain the 9@0. @ will remain the @0. A will #ecome the 9@0. @ will remain the @0. C will remain the 9@0. 1$. #hat range of networks will be advertised in the +,!: updates b" the co 155? 1,2.17-.0.0+24 throu"h 1,2.17-.0.15+24 1,2.17-.0.0+24 throu"h 1,2.17-.15.0+24 1,2.17-.15.0+24 throu"h 1,2.17-.81.0+24 1,2.17-.15.0+24 throu"h 1,2.17-.255.0+24 1,2.17-.17.0+24 throu"h 1,2.17-.255.0+24 1(. and Router1%config7router'B network 132.1-2.5.5 5.5.1*.2** area ediatel" after the following

Refer to the exhibit. Router/, Router8, and Router& in the diagra

are

running +,!: on their 9thernet interfaces. Router 4 was ;ust added to the network. Routers are configured with the loopback interfaces %0o 5' that are shown in the exhibit. #hat happens to the +,!: 4R?84R after Router4 is added to the network? 0outer9 ta$es o!er as @0 an 0outer@ #ecomes the 9@0. 0outer@ #ecomes the 9@0 an 0outerA remains the @0. 0outer@ #ecomes the @0 an 0outerA #ecomes the 9@0. 0outerC acts as the @0 until the election process is complete. 0outer@ #ecomes the @0 an 0outer9 remains the 9@0. There is no chan"e in the @0 or 9@0 until either current @0 or 9@0 "oes own. 1*.

Refer to the exhibit. )ow the co

an" +,!: ad;acencies

ust be for

ed to build

plete topolog" if a 4R or 84R were not elected in this +,!:

network? 4 5 7 : 10 1-. #hat is the default ad ,0 100 110 115 120 1.. inistrative distance for +,!:?

Refer to the exhibit. #hich co

and sequence on Router8 will

redistribute a gatewa" of last resort to the other routers in +,!: area 5? 0outer9;confi"=> router ospf 15 0outer9;confi"<router=> gatewa"7of7last7resort 1.2.1-.-.0outer9;confi"=> ip route 5.5.5.5 5.5.5.5 serial 5?5?5 0outer9;confi"=> ip route 5.5.5.5 5.5.5.5 1.2.1-.-.0outer9;confi"=> router ospf 15 0outer9;confi"<router=> default7infor 0outer9;confi"=> router ospf 15 0outer9;confi"<router=> default7network 1.2.1-.-.- 5.5.5.$ area 5 0outer9;confi"=> ip route 5.5.5.5 5.5.5.5 1.2.1-.-.0outer9;confi"=> ip default7route 5.5.5.5 5.5.5.5 1.2.1-.-.0outer9;confi"=> router ospf 15 0outer9;confi"<router=> redistribute ip default7route ation originate

12. #hich two state %&hoose two.'

ents describe the use of +,!: 4R?84R elections?

(lections are alwa)s optional. (lections are require in all .AN networ$s. (lections are require in point<to<point networ$s. (lections are require in #roa cast multiaccess networ$s. (lections are sometimes require in N9/A networ$s. 13.

Refer to the exhibit. #hat does the K2L stand for in the router ospf 2 state ent? The num#er 2 is the autonomous s)stem num#er. The num#er 2 in icates the num#er of networ$s a !ertise #) OS'*. The num#er 2 i entifies this particular instance of OS'* on this router. The num#er 2 in icates the priorit) of the OS'* process on this router. 25.

Refer to the exhibit. The network ad acco plish this?

inistrator wants to set the router I4 inistrator take to

of Router1 to 132.1-2.155.1. #hat steps can the ad shut own the loop #ac$ interface use the OS'* router<i 1,2.17-.100.1 comman use the clear ip ospf process comman nothin"6 the router<i of 0outer1 is alrea ) 1,2.17-.100.1

21. Refer to the exhibit. #hat the dead ti ust be received between neighbors to prevent reaching Cero? e that is shown in the exhibit fro

an) traffic throu"h the router interfaces routin" ata#ase up ates hello pac$ets 9'@A pac$ets 22.

Refer to the exhibit. #hat does the K+M92L fro an internal t)pe 2 OS'* route. an e%ternal OS'* route at least two hops awa). an e%ternal OS'* route from two ifferent sources. an e%ternal OS'* route that will not increment in cost. a efault route.

the K+M92 5.5.5.5?5

@115?1A via 132.1-2.1.1, 55>5*>$(, ,erial5?5L line represent?

The route was istri#ute into OS'* from a t)pe 2 router. 2$.

Refer to the exhibit. #hich network co subnets?

and or set of co

ands will

cause +,!: to be enabled for an" R1 interface connected to the exhibited 01;confi"<router=> network 15.5.5.5 5.5.5.5 area 5 01;confi"<router=> network 15.1.5.5 5.5.5.2** area 5 01;confi"< router=> network 15.1.1.5 5.5.5.2** area 5 01;confi"<router=> network 15.1.2.( 5.5.5.$ area 5 01;confi"<router=> network 15.1.5.5 5.5.5.2** area 5

01;confi"<router=> network 15.2.5.5 5.5.5.2** area 5 01;confi"<router=> network 15.5.5.5 5.5.2**.2** area 5 2(.

Refer to the exhibit. #hat is the cost of the route to the 15.5.5.5 network? 2 110 1:-7 1.544 2*. #hat three para order to for area i R<!alues metric !alue hello inter!al networ$ t)pe interface t)pe eters ust be indentical between +,!: routers in an ad;acenc"? %&hoose three.'

a. b. c. d.

1 C nsu%te %a presenta&i'n. -9u) senten&ias de & n1i2ura&i'n dar,n % s resu%tad s *ue se muestran en e% resu%tad de% & mand sh w ip pr t & %s. E6& n1i28A int 1a0D0 E6& n1i2=i18A r uter=id 1F2.1;B.1.: E6& n1i28A int % 0 E6& n1i2=i18A ip address 1F2.1;B.1.: J7.config/0 router ospf 1 7.config1router/0 router1id 1&2.13'.1.8 E 6& n1i28A r uter sp1 1 E6& n1i2=r uter8A ip address 1F2.1;B.1.: 2 C nsu%te %a presenta&i'n. -9u) es % *ue se debe re&ibir entre #e&in s para e#itar *ue e% tiemp muert *ue se muestra en %a presenta&i'n %%e2ue a &er .

a. &ua%*uier tr,1i& a tra#)s de %as inter1a&es de % s r uters b. %as a&tua%i3a&i nes de %a base de dat s de enrutamient c. Jlos paquetes de saludo d. % s pa*uetes E0(> 3 C nsu%te %a presenta&i'n. -Cu,ntas adya&en&ias G40< se deben 1 rmar para &rear %a t p % 2$a & mp%eta si n 1ueran e%e2id s un (? E(? en esta red G40<. a. 4 b. : c. J3 d. 7 e. 10 4 C nsu%te %a presenta&i'n. Ceniend en &uenta *ue % s r uters tienen pri ridades G40< de inter1a3 p r de1e&t y nin2una inter1a3 % pba&K & n1i2urada, -*u) d s 1un&i nes desempeHar, e% r uter E en &ada se2ment de red. 6!%i7a d s p&i nes8. a. J=- para la red 1&2.13'.1.200 b. E(? para %a red 1F2.1;B.1.200 &. (?GCI!? en 1F2.1;B.1.200 d. (? para %a red 1F2.1;B.1.204 e. J7=- para la red 1&2.13'.1.205 1. (?GCI!? en %a red 1F2.1;B.1.204 : C nsu%te %a ima2en. -9u) & mand de red 2rup de & mand s har,n *ue G40< est) habi%itad para en#iar y re&ibir pa*uetes para &ua%*uier inter1a3 ?1 en %as subredes e"hibidas. a. ?16& n1i2=r uter8A netw rK 10.0.0.0 0.0.0.0 area 0 %. J-1.config1router/0 net#orC 0.0.0.0 288.288.288.288 area 0 &. ?16& n1i2=r uter8A netw rK 10.1.0.0 0.0.0.2:: area 0 ?16& n1i2=r uter8A netw rK 172.1;.1.0 0.0.0.3 area 0 d. ?16& n1i2=r uter8A netw rK 10.0.0.0 0.0.2::.2:: area 0 ?16& n1i2=r uter8A netw rK 172.1;.0.0 0.2::.2::.2:: area 0 ; -Cu,% es %a distan&ia administrati#a p r de1e&t para G40<. a. F0 b. 100 c. J110 d. 11: e. 120 7 -9u) ran2 de redes se pub%i&ar,n en %as a&tua%i3a&i nes G40< p r e% & mand ? uter16& n1i2=r uter8A netw rK 1F2.1;B.0.0 0.0.1:.2:: area 100. a. de 1F2.1;B.0.0D24 a 1F2.1;B.0.1:D24 %. Jde 1&2.13'.0.0/25 a 1&2.13'.18.0/25 &. de 1F2.1;B.1:.0D24 a 1F2.1;B.31.0D24 d. de 1F2.1;B.1:.0D24 a 1F2.1;B.2::.0D24 e. de 1F2.1;B.1;.0D24 a 1F2.1;B.2::.0D24 B -9u) usa G40< para redu&ir %a &antidad de inter&ambi s de in1 rma&i'n de enrutamient en %as redes en %as *ue hay una 2ran &antidad de #e&in s. 6!%i7a d s p&i nes8. a. r uter ra$3 b. r uter ra$3 de respa%d

&. r uter de d mini d. r uter de d mini de respa%d e. Jrouter designado f. Jrouter designado de respaldo F C nsu%te %a presenta&i'n. -9u) representa SGR!2S en %a %$nea SGR!2 0.0.0.0D0 T110D1U #ia 1F2.1;B.1.1, 00J0:J34, 4eria%0D0S. a. una ruta G40< tip 2 interna. b. una ruta G40< e"terna a d s sa%t s de distan&ia & m m$nim . &. una ruta G40< e"terna desde d s r$2enes di1erentes. d. Juna ruta A "F e,terna que no se incrementar en costo. e. una ruta p r de1e&t . 1. +a ruta se distribuy' en G40< desde un r uter tip 2. 10 C nsu%te %a presenta&i'n. -9u) se&uen&ia de & mand s de% ? uterE redistribuye %a 2ateway de 5%tim re&urs a % s tr s r uters de% G40< ,rea 0. a. ? uterE6& n1i28A r uter sp1 10 ? uterE6& n1i2=r uter8A 2ateway= 1=%ast=res rt 172.1;.;.; b. ? uterE6& n1i28A ip r ute 0.0.0.0 0.0.0.0 seria% 0D0D0 c. J-outer7.config/0 ip route 0.0.0.0 0.0.0.0 192.13.3.3 -outer7.config/0 router ospf 10 -outer7.config1router/0 default1information originate d. ? uterE6& n1i28A r uter sp1 10 ? uterE6& n1i2=r uter8A de1au%t=netw rK 172.1;.;.; 0.0.0.3 area 0 e. ? uterE6& n1i28A ip r ute 0.0.0.0 0.0.0.0 172.1;.;.; 1. ? uterE6& n1i28A ip de1au%t=r ute 0.0.0.0 0.0.0.0 172.1;.;.; ? uterE6& n1i28A r uter sp1 10 ? uterE6& n1i2=r uter8A redistribute ip de1au%t=r ute 11 C nsu%te %a presenta&i'n. !% ? uter1 y e% ? uter2 est,n e7e&utand G40<. !% & mand sh w ip sp1 nei2hb r n re#e%a nin25n #e&in . -Cu,% es %a &ausa p sib%e. a. N & in&iden %as /( de% sistema aut'n m de G40<. b. N & in&iden %as /( de% pr &es G40<. &. + s tip s de redes de G40< s n id)nti& s d. J?o coinciden el saludo A "F o los tempori)adores muertos. 12 C nsu%te %a presenta&i'n. ? uterA, ? uterE y ? uterC de% dia2rama e7e&utan G40< en sus inter1a&es !thernet. !% ? uter ( a&aba de a2re2arse a %a red. + s r uters est,n & n1i2urad s & n %as inter1a&es % pba&K 6+ 08 *ue se muestran en %a presenta&i'n. -9u) %e &urre a %as e%e&&i nes (?DE(? de G40< despu)s de a2re2ar e% ? uter( a %a red. a. ? uterE a&t5a & m (? y ? uter( se & n#ierte en e% E(?. b. ? uter( se & n#ierte en e% E(? y ? uterA si2ue siend e% (?. &. ? uter( se & n#ierte en e% (? y ? uterA se & n#ierte en e% E(?. d. ? uterC a&t5a & m e% (? hasta *ue se & mp%ete e% pr &es de e%e&&i'n. e. ? uter( se & n#ierte en e% (? y ? uterE si2ue a&tuand & m e% E(?. f. J?o se produce ningKn cam%io en el =- o 7=- hasta que el =- o 7=- actual de+e de funcionar. 13 >na red G40< de &in& r uters & mp%etamente & n#er2entes se ha e7e&utad & n )"it durante #arias semanas. C das %as & n1i2ura&i nes se han 2uardad y n se uti%i3an rutas

a. %. &. d.

a. b. &. d.

a. b. &. d.

a. b. &. d.

a. b. c. d.

a. b. &. d. e.

est,ti&as. 4i un r uter se apa2a y se reini&ia, -*u) in1 rma&i'n habr, en %a tab%a de enrutamient despu)s de *ue e% ar&hi# de & n1i2ura&i'n se &ar2ue per antes de *ue G40< haya & n#er2id . !star,n presentes t das %as rutas de %a red en su t ta%idad. JLas redes conectadas directamente que estn operati(as estarn en la ta%la de enrutamiento. (ebid a *ue e% a%2 ritm 40< n ha 1ina%i3ad t d s % s &,%&u% s, n habr, rutas en %a tab%a. >na ruta de resumen para t das %as redes aprendidas anteri rmente apare&er, aut m,ti&amente en %a tab%a de enrutamient hasta *ue e% r uter haya re&ibid t d s % s +40. 14 C nsu%te %a presenta&i'n. !% ? uter A est, & rre&tamente & n1i2urad para G40<. -9u) senten&ia de & n1i2ura&i'n G40< & n7unt de senten&ias se in2res' a% r uter E para 2enerar %a tab%a de enrutamient e"hibida. J7.config1router/0 net#orC 1&2.13'.1.0 0.0.0.4 area 0 E6& n1i2=r uter8A netw rK 10.1;.1.0 0.0.0.224 area 0 E6& n1i2=r uter8A netw rK 10.1;.1.0 2::.2::.2::.224 area 0 E6& n1i2=r uter8A netw rK 1F2.1;B.1.0 2::.2::.2::.2:: area 0 E6& n1i2=r uter8A netw rK 10.0.0.0 2::.2::.2::.2:: area 0 1: C nsu%te %a ima2en. !% administrad r de red desea estab%e&er %a /( de r uter de% ? uter1 en 1F2.1;B.100.1. -9u) pas s debe &ump%ir. des& ne&tar %a inter1a3 % pba&K uti%i3ar e% & mand r uter=id 1F2.1;B.100.1 de G40< uti%i3ar e% & mand &%ear ip sp1 pr &ess Jnada6 la router1id del -outer1 ya est esta%lecida en 1&2.13'.100.1 1; C nsu%te %a presenta&i'n. Cuand G40< est, perati# en %a red e"hibida, -*u) re%a&i'n de #e&in se desarr %%a entre e% ? uter1 y e% ? uter2. J e forma una adyacencia F$LL. 4e 1 rma una adya&en&ia 2MAV. !% ? uter2 se trans1 rmar, en e% (? y e% ? uter1 se trans1 rmar, en e% E(?. Amb s r uters ser,n (?GCI!?4. 17 C nsu%te %a presenta&i'n. C das % s r uters se han & n1i2urad & n %as pri ridades de inter1a3 *ue se muestran. C d s % s r uters se reini&iar n simu%t,neamente. 4e muestran % s resu%tad s de %a e%e&&i'n (?DE(?. -9u) se puede & n&%uir a&er&a de esta red. !% ? uter C n puede 2anar una e%e&&i'n (? ba7 nin2una &ir&unstan&ia. 4i e% en%a&e para %a inter1a3 1F2.1;B.1.4 se des& ne&ta, e% r uter E ser, e% nue# (?. JLa != de router ms alta pro%a%lemente se determin por medio de una sentencia o sentencias router1id de A "F. 4i se a2re2a un nue# r uter & n una /( de r uter m,s a%ta *ue e% r uter (, )ste ser, e% (?. 1B C nsu%te %a presenta&i'n. C d s % s r uters est,n e7e&utand G40<. -9u) & st p ndr, JAL en %a tab%a de enrutamient para %a red 10.0.0.0D24. 2 1:; 1:;4 17B: J19'9

a. b. &. d. a. b. c. d.

a. b. &. d. e. 1.

a. b. &. d. e. a. b. &. d. a. b. &. d.

a.

1F C nsu%te %a presenta&i'n. + s ? uters A, E, C y ( est,n e7e&utand G40< & n /( de r uter p r de1e&t y pri ridades de inter1a3 G40<. +as inter1a&es % pba&K n est,n & n1i2uradas y t das %as inter1a&es est,n perati#as. !% ? uter ( es e% (? y e% r uter C es e% E(?. -9u) su&ede inmediatamente despu)s *ue % s si2uientes & mand s se in2resan a% r uter A. A6& n1i28A inter1a&e 1a0D0 A6& n1i2=i18A ip sp1 pri rity 2:: A se trans1 rmar, en e% (?. ( se trans1 rmar, en e% E(?. A se trans1 rmar, en e% (?. C se2uir, siend e% E(?. ( se2uir, siend e% (?. A se trans1 rmar, en e% E(?. J= seguir siendo el =-. * seguir siendo el 7=-. 20 C nsu%te %a presenta&i'n. -9u) representa e% S2S para %a senten&ia r uter sp1 2. !% n5mer 2 es e% n5mer de sistema aut'n m . !% n5mer 2 indi&a %a &antidad de redes pub%i&adas p r G40<. JEl nKmero 2 identifica esta instancia particular de A "F en este router. !% n5mer 2 indi&a %a pri ridad de% pr &es G40< en este r uter. 21 -Cu,%es s n % s par,metr s *ue deben ser id)nti& s entre % s r uters G40< para 1 rmar una adya&en&ia. 6!%i7a tres p&i nes8. J!= de rea #a% res W #a% r m)tri& Jinter(alo de saludo Jtipo de red tip de inter1a3 22 -9u) d s a1irma&i nes des&riben e% us de %as e%e&&i nes G40< (?DE(?. 6!%i7a d s p&i nes8. +as e%e&&i nes siempre s n p&i na%es. +as e%e&&i nes s n ne&esarias en t das %as redes MAN. +as e%e&&i nes s n ne&esarias en t das %as redes punt a punt . JLas elecciones son necesarias en las redes de acceso mKltiple de %roadcast. J*on frecuencia las elecciones se requieren en redes ?7<2. 23 C nsu%te %a presenta&i'n. -Cu,% es e% & st de %a ruta ha&ia %a red 10.0.0.0. 2 110 17B; 1.:44 24 -9u) es % *ue usa G40< para &a%&u%ar e% & st ha&ia una red de destin . Jancho de %anda an&h de banda y & nte de sa%t s an&h de banda y & n1iabi%idad an&h de banda, &ar2a y & n1iabi%idad 2: C nsu%te %a ima2en. + s r uters de %a presenta&i'n uti%i3an %as & n1i2ura&i nes de G40< para pub%i&ar %as redes & ne&tadas. 4i t d s % s r uters arran&an a% mism tiemp , -&u,% ser, e% resu%tad de %as se%e&&i nes de (? y E(? para esta red G40< de ,rea 5ni&a. 6!%i7a tres p&i nes8. I9 ser, e% (? para 10.4.0.0D1;.

%. J-outer 2 ser el =- para 10.5.0.0/13. c. JIO ser el 7=- para 10.5.0.0/13. d. ? uter A ser, e% (? para 10.:.0.0D1;. e. J-emoto ser el =- para 10.8.0.0/13. 1. ?em t ser, e% E(? para 10.:.0.0D1;.