计网-第四章作业_第1页
计网-第四章作业_第2页
计网-第四章作业_第3页
计网-第四章作业_第4页
计网-第四章作业_第5页
已阅读5页,还剩1页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、精选优质文档-倾情为你奉上精选优质文档-倾情为你奉上专心-专注-专业专心-专注-专业精选优质文档-倾情为你奉上专心-专注-专业Chapter 44.1,4.2,4.3节后作业(R3)What are the two most important network-layer functions in a datagram network? What are the three most important network-layer functions in a virtual-circuit network?答:forwarding and routing.forwarding, routin

2、g and connection setup.(R2)What is the difference between routing and forwarding?答:Forwarding is about moving a packet from a routers input link to the appropriate output link. Routing is about determining the end-to-routes between sources and destinations.(R9)Describe how packet loss can occur at i

3、nput ports. Describe how packet loss at input ports can be eliminated (without using infinite buffers).答:The queue size at the input port grows large because of slow switching fabric speed and exhausting routers buffer space. It can be eliminated if the switching fabric speed is at least n times as

4、fast as the input line speed, where n is the number of input ports.4.4,4.5,4.6,4.7节后作业(R12)What is the 32-bit binary equivalent of the IP address 223.1.3.27?答: Do routers have IP addresses? If so, how many?答:Yes. They have one address for each interface.Consider Figure 4.34. Starting with the origin

5、al table in D, suppose that D receives from A the following advertisement. Will the table in D change? If so how?答:No. If the advertisement said that A were only 4 hops away from z by way of C, then D would indeed change its forwarding table.(P8)Consider a datagram network using 32-bit host addresse

6、s. Suppose a router has five links, numbered 0 through 4, and packets are to be forwarded to the link interfaces as follows:Destination Address Range Link Interface Through 0 Through 1 Through 2 Through 3 Otherwise 4a. Provide a forwarding table that has five entries, uses longest prefix matching, a

7、nd forwards packets to the correct link interfaces.b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: 答:a.IPLink interface 0 123Otherwise4b. Prefix match for first address is 4th entry: link interface 3 Prefix match for second ad

8、dress is 2nd entry: link interface 1 Prefix match for first address is 3rd entry: link interface 2 (P9)Consider a datagram network using 4 bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table:Prefix MatchInterface000011102113For each of the four in

9、terfaces, give the associated range of destination host addresses and the number of addresses in the range.答:Destination Address RangesNumber of addressLink Interface640641642643(P11)Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces i

10、n each of these three subnets are required to have the prefix 220.2.240/20. Also suppose that Subnet 1 is required to support up to 2000 interfaces, and Subnets 2 and 3 are each required to support up to 1000 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these cons

11、traints.答:223.1.17.0/25223.1.17.128/26223.1.17.192/26(P14)Consider a subnet with prefix 101.101.101.64/26. Give an example of one IP address (of form xxx.xxx.xxx.xxx) that can be assigned to this network. Suppose an ISP owns the block of addresses of the form 101.101.128/17. Suppose it wants to crea

12、te four subnets from this block, with each block having the same number of IP addresses. What are the prefixes (of form a.b.c.d/x) for the four subnets?答:The IP address in range is from 101.101.101.64 to 101.101.101.128The four equal size subnets (extends 18 and 19)101.101.128/19101.101.160/19101.10

13、1.192/19101.101.224/19(P15)Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at l2:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F.FEDCBAa. Assign network addresses to each of these six subnets, with the followin

14、g constraints: All addresses must be allocated from214.97.254/23; Subnet A should have enough addresses to support 250 interfaces; Subnet B should have enough addresses to support 120 interfaces; and Subnet C should have enough addresses to support 120 interfaces. Of course, subnets D, E and F shoul

15、d each be able to support two interfaces. For each subnet, the assignment should take the form a.b.c.d/x or a.b.c.d/x - e.f.g.h/y.b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching)for each of the three routers. 答:From 214.97.254/23, the assignments areSub

16、net A: 214.97.255/24(28=256 addresses)Subnet B: 214.97.254.0/25-214.97.254.0/29(27-8=120 addresses)Subnet C: 214.97.254.128/25(27=128 addresses)Subnet D: 214.97.254.0/31(21=2 addresses)Subnet E: 214.97.254.2/31(21=2 addresses)Subnet F: 214.97.254.4/30(22=4 addresses)Assume that no datagrams have rou

17、ter interface as ultimate destinations. Also, label D,E,F for the upper-right, bottom, and upper-left interior subnets, respectively.Router1:Outgoing Interface Longest Prefix MatchA F D Router2:Outgoing InterfaceLongest Prefix MatchF E C Router3:Outgoing InterfaceLongest Prefix MatchB D E (P16)Consi

18、der sending a 4,000-byte datagram into a link that has an MTU of 400 bytes. Suppose the original datagram is stamped with the identification number 422-How many fragments are generated? What are their characteristics?答:The maximum size of data field in each fragment = 380(20 bytes IP header). Thus t

19、he number of required fragments = (4000-20)380=11Each fragment will have identification number 422. Each fragment except the last one will be of size 500 bytes (including IP header). The last datagram will be of size 120 bytes (including IP header). The offsets of 7fragments will be 0,60,120,180,240

20、,300,360. Each of the first 6 fragments will have flag = 1; the last fragment will have flag = 0 . (P25)Consider the network fragment shown below. -r has only two attached neighbors, w and y. w has a minimum-cost path to destination u (not shown) of 5,and y has a minimum-cost path to u of 6. The complete paths from w and y to z (and between w and y) are not shown. All link cos

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

最新文档

评论

0/150

提交评论