- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
计算机网络语课件第4章答案
Answer of HW Chapter 4 R12: What is the 32-bit binary equivalent of the address 223.1.3.27? R13: Do routers have IP addresses? If so, how many? Yes. They have one address for each interface R18:Yes, because the entire IPv6 datagram (including header fields) is encapsulated in an IPv4 datagram R21:Link state algorithms: Computes the least- cost path between source and destination using complete, global knowledge about the network. Distance-vector routing: The calculation of the least-cost path is carried out in an iterative, distributed manner.A node only knows the neighbor to which it should forward a packet in order toreach given destination along the least- cost path, and the cost of that path from itself to the destination. Answer of HW P447 P8 a) Prefix Match Link Interface 00000000 0 00000001 1 2 3 otherwise 4 b) Prefix match for first address is 4th entry: link interface 4 Prefix match for second address is 2nd entry: link interface 2 Prefix match for first address is 3rd entry: link interface 3 Answer of HW P448 P9 Destination Address Range Link Interface 0000 ~~ 0011 0 0100 ~~ 0111 1 1000 ~~1011 2 1100~~ 1111 3 number of addresses in each range = Answer of HW P448 10 Address interface through(64 addresses) 0through(32addresses) 1through(32 addresses)
文档评论(0)