CCNA E CHARPTER 【DOC精选】.docVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Take Assessment - ERouting Chapter 10 - CCNA Exploration: Routing Protocols and Concepts (Version 4.0)? Time Remaining:? ? 1 窗体顶端 What speeds up convergence in a network using link-state routing? updates triggered by network changes updates sent at regular intervals updates sent only to directly connected neighbors updates that include complete routing tables 窗体底端 2 窗体顶端 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 network 窗体底端 3 窗体顶端 A new network administrator is given the task of selecting an appropriate dynamic routing protocol for a software development company. The company has over 100 routers, uses CIDR and VLSM, requires fast convergence, and uses both Cisco and non-Cisco equipment. Which routing protocol is appropriate for this company? RIP version 2 IGRP EIGRP OSPF BGP 窗体底端 4 窗体顶端 To achieve network convergence, what three steps does each link state router take? (Choose three.) use automatic summarization to reduce the size of routing tables build a Link State Packet (LSP) containing the state of each directly connected link flood the LSP to all neighbors, who then store all LSPs received in a database send hello packages at regular intervals to discover neighbors and establish adjacencies construct a complete map of the topology and compute the best path to each destination network use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table 窗体底端 5 窗体顶端 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 destin

文档评论(0)

taotao0b + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档