<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: CCNA 2 Chapter 10 V4.0 Answers</title>
	<atom:link href="http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/feed/" rel="self" type="application/rss+xml" />
	<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/</link>
	<description>CCNA Exam Answers, CCNA Final Exam Answers, CCNA Module Answers, CCNA Chapter Answers, CCNA Test Answers, CCNA Questions and Answers, CCNA 1 Answers, CCNA 2 Answers, CCNA 3 Answers, CCNA 4 Answers, CCNA v4 Answers</description>
	<lastBuildDate>Fri, 10 May 2013 16:32:10 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: BOY</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5851</link>
		<dc:creator>BOY</dc:creator>
		<pubDate>Thu, 02 May 2013 10:48:36 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5851</guid>
		<description><![CDATA[question number 16 forgot *]]></description>
		<content:encoded><![CDATA[<p>question number 16 forgot *</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: BOY</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5850</link>
		<dc:creator>BOY</dc:creator>
		<pubDate>Thu, 02 May 2013 10:48:04 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5850</guid>
		<description><![CDATA[What are some of the advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)

The topology database eliminates the need for a routing table.

Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.

Routers have direct knowledge of all links in the network and how they are connected.

*******After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology.

*******Link-state protocols require less router processor power than distance vector protocols.




this is correct answer]]></description>
		<content:encoded><![CDATA[<p>What are some of the advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)</p>
<p>The topology database eliminates the need for a routing table.</p>
<p>Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.</p>
<p>Routers have direct knowledge of all links in the network and how they are connected.</p>
<p>*******After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology.</p>
<p>*******Link-state protocols require less router processor power than distance vector protocols.</p>
<p>this is correct answer</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anony</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5777</link>
		<dc:creator>Anony</dc:creator>
		<pubDate>Mon, 15 Apr 2013 01:55:33 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5777</guid>
		<description><![CDATA[Why is it difficult for routing loops to occur in networks that use link-state routing?

Each router builds a simple view of the network based on hop count.

Routers flood the network with LSAs to discover routing loops.

*****Using the SPF algorithm over identical link-state databases avoids creating loops.

Routers use hold-down timers to prevent routing loops.


Everything else is correct.]]></description>
		<content:encoded><![CDATA[<p>Why is it difficult for routing loops to occur in networks that use link-state routing?</p>
<p>Each router builds a simple view of the network based on hop count.</p>
<p>Routers flood the network with LSAs to discover routing loops.</p>
<p>*****Using the SPF algorithm over identical link-state databases avoids creating loops.</p>
<p>Routers use hold-down timers to prevent routing loops.</p>
<p>Everything else is correct.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nightwing</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5575</link>
		<dc:creator>Nightwing</dc:creator>
		<pubDate>Sat, 02 Mar 2013 13:09:50 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5575</guid>
		<description><![CDATA[#2 Why is it difficult for routing loops to occur in networks that use link-state routing?
Correct Answer: 
Using the SPF algorithm over identical link-state databases avoids creating loops]]></description>
		<content:encoded><![CDATA[<p>#2 Why is it difficult for routing loops to occur in networks that use link-state routing?<br />
Correct Answer:<br />
Using the SPF algorithm over identical link-state databases avoids creating loops</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pat</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5528</link>
		<dc:creator>Pat</dc:creator>
		<pubDate>Fri, 15 Feb 2013 15:27:48 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5528</guid>
		<description><![CDATA[Yeah thank you it`s fantastic!!]]></description>
		<content:encoded><![CDATA[<p>Yeah thank you it`s fantastic!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jim</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5465</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Wed, 23 Jan 2013 20:10:47 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5465</guid>
		<description><![CDATA[What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?

****floods the LSP to neighbors
calculates the SPF algorithm
runs the Bellman-Ford algorithm
computes the best path to the destination]]></description>
		<content:encoded><![CDATA[<p>What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?</p>
<p>****floods the LSP to neighbors<br />
calculates the SPF algorithm<br />
runs the Bellman-Ford algorithm<br />
computes the best path to the destination</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Unknown</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5288</link>
		<dc:creator>Unknown</dc:creator>
		<pubDate>Mon, 03 Dec 2012 01:26:06 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-5288</guid>
		<description><![CDATA[16






Why is it difficult for routing loops to occur in networks that use link-state routing? 





Each router builds a simple view of the network based on hop count.





Routers flood the network with LSAs to discover routing loops.





*****Using the SPF algorithm over identical link-state databases avoids creating loops.





Routers use hold-down timers to prevent routing loops.]]></description>
		<content:encoded><![CDATA[<p>16</p>
<p>Why is it difficult for routing loops to occur in networks that use link-state routing? </p>
<p>Each router builds a simple view of the network based on hop count.</p>
<p>Routers flood the network with LSAs to discover routing loops.</p>
<p>*****Using the SPF algorithm over identical link-state databases avoids creating loops.</p>
<p>Routers use hold-down timers to prevent routing loops.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Light Yagami</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-2872</link>
		<dc:creator>Light Yagami</dc:creator>
		<pubDate>Sat, 22 Oct 2011 09:21:33 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-2872</guid>
		<description><![CDATA[Of the steps given, what is the final step in the link state routing process?
	
successors are placed into the routing table
	
*******SPF computes best path to each destination network
	
LSPs are flooded to all neighbors to converge the network
	
DUAL algorithm is run to find best path to destination networks]]></description>
		<content:encoded><![CDATA[<p>Of the steps given, what is the final step in the link state routing process?</p>
<p>successors are placed into the routing table</p>
<p>*******SPF computes best path to each destination network</p>
<p>LSPs are flooded to all neighbors to converge the network</p>
<p>DUAL algorithm is run to find best path to destination networks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: belal</title>
		<link>http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-2278</link>
		<dc:creator>belal</dc:creator>
		<pubDate>Fri, 17 Jun 2011 11:16:52 +0000</pubDate>
		<guid isPermaLink="false">http://ccnaanswers.com/ccna-2-chapter-10-v4-0-answers/#comment-2278</guid>
		<description><![CDATA[What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)

  ****Each router independently determines the route to each network.

  ****After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology.]]></description>
		<content:encoded><![CDATA[<p>What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)</p>
<p>  ****Each router independently determines the route to each network.</p>
<p>  ****After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic

Served from: ccnaanswers.com @ 2013-05-18 19:21:36 -->