网络工程师应该掌握的44个路由器问题（Network engineers should have 44 router problems）.docVIP

下载本文档

3
0
约1.96万字
约 21页
2017-07-21 发布于河南
举报
版权申诉

网络工程师应该掌握的44个路由器问题（Network engineers should have 44 router problems）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

网络工程师应该掌握的44个路由器问题（Network engineers should have 44 router problems）

网络工程师应该掌握的44个路由器问题（Network engineers should have 44 router problems） Network engineers should have 44 router problems Network engineers should have 44 router problems (irrigation...) When do you use multi-route protocol? When two different routing protocols are exchanged for routing information, multiple routing protocols are used. Of course, routing redistribution can also exchange routing information. The following situations do not have to use multiple routing protocols: Upgrade from the old version of the Interior Gateway Protocol (I G P) to the new version of I G P. You want to use another routing protocol but you have to keep the original protocol. You want to end internal routing to avoid interference from other routers that dont have a strict filtering oversight function. You are in an environment of routers made by multiple manufacturers. What is the distance vector routing protocol? Distance vector routing protocol is designed for small network environments. In a large network environment, such protocols will generate larger traffic and take up too much bandwidth in learning to route and keep routing. If a routing table update is not received from the adjacent site in 9 0 seconds, it is considered that the adjacent site cannot be reached. Every 30 seconds, the distance vector routing protocol sends the entire routing selection table to the adjacent site, which updates the routing table of the adjacent site. In this way, it can collect a list of networks from other sites (directly connected or otherwise) so that it can be routed. The distance vector routing protocol USES the hop count as the metric to calculate the number of routers to go through to the destination. For example, the R I P USES the B e l m a n - F o R d algorithm to determine the shortest path, which is to reach the destination by the smallest jump number. The maximum allowable jumps are usually 1, 5. The terminals that have to go through more than one or five routers are considered unreacha