计算机网络作业一

合集下载
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

Computer Network 2015fall

Homework 1

作业提交地址: ftp:///~zhgf/ComputerNetwork2015/

1. What is the difference between a host and an end system? List several different types of end systems. Is a Web server an end system?

答:(1) 基本相同,经常互换。

(2) web 服务器、PC 机、手机、平板电脑。

(3) 是的。

2. What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers?

答:(1) 应用层、运输层、网络层、链路层和物理层。

(2) 应用层是网络应用程序及其应用层协议存留的地方;运输层提供了在应用程序端点之间传送应用层报文的服务;网络层将称为数据报的网络层分组从一台主机移动到另一台主机;链路层将分组从一个节点(主机或路由器)移动到路径上的下一个节点;物理层将该帧中的一个一个比特从一个节点移动到下一个节点。

3. What is an application-layer message? A transport-layer segment? A network layer datagram? A link-layer frame?

答:(1) 应用层报文是位于应用层的信息分组。(2) 运输层报文段由应用层报文和运输层首部信息构成。(3) 网络层数据报由运输层报文段和网络层首部信息构成。(4) 链路层帧由网络层数据报和链路层首部信息构成。

4. Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R 1 = 500 kbps, R 2 = 2 Mbps, and R 3 = 1 Mbps.

a. Assuming no other traffic in the network, what is the throughput for the file transfer?

答:R 1=0.5Mbps

b. Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B?

答:s Mbps Mb 85.04=÷

c. Repeat (a) and (b), but now with R2 reduced to 100 kbps.

答:R2=0.1Mbps ,所以thoughput 为0.1Mbps ,s t 401.04=÷=

5. This elementary problem begins to explore propagation delay and

transmission delay, two central concepts in data networking. Consider two hosts, Hosts A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B.

a) Express the propagation delay, d prop in terms of m and s.

答:s m d prop /=

b) Determine the transmission time of the packet, d trans in terms of Land R. 答:R L d trans /=

c) Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.

答:R L s m d d t trans prop delay //+=+=

d) Suppose Host A begins to transmit the packet at time t=0. At time t=d trans , where is the last bit of the packet?

答:刚离开主机A 。

e) Suppose d prop is greater than d trans . At time t=d trans , where is the first bit of the packet?

答:在链路上,距离主机A :)/(R L S •。

f) Suppose d prop is less than d trans . At time t=d trans , where is the first bit of the packet?

答:已到达主机B 。

g) Suppose s=2.5*108, L=100 bits and R=28 kbps. Find the distance m so that

d prop equals d trans .

答:R L s m //=,km R L s m 86.89210

*2810*10*5.232

8==•=∴

6. Suppose two hosts, A and B, are separated by 10,000 kilometers and are connected by a direct link of R = 1 Mbps. Suppose the propagation speed over the link is 2.5*108 meters/sec.

a) Calculate the bandwidth-delay product, R*t prop .

答:bits s d R t R prop 410*4/**==

b) Consider sending a file of 400,000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time?

答:文件大小为400,000 = 4*105 bits > 4*104 bits ,所以最大字节量应为4*104。 c) Provide an interpretation of the bandwidth-delay product.

答:the maximum number of bits that will be in the link at any given time 。即在给定时刻,链路中字节数的最大值。

d) What is the width (in meters) of a bit in the link? Is it longer than a football field? 答:m 25010*4104

7

=。是。 e) Derive a general expression for the width of a bit in terms of the propagation speed s, the transmission rate R, and the length of the link m. 答:

R s s

m R m =* 7. Referring to problem 6, suppose we can modify R. For what value of R is the width of a bit as long as the length of the link?

答:设一个bit 的长度为m ,由6(e)知,R s m =,m

s R =∴。

8. Refer again to problem 6. a) How long does it take to send the file, assuming it is sent continuously? 答:s t prop 04.010*5.21087==,s s L t 44.004.010

10*404.010*1656=+=+=总 b) Suppose now the file is broken up into 10 packets with each packet containing 40,000 bits. Suppose that each packet is acknowledged by the receiver and the transmission time of an acknowledgment packet is negligible. Finally, assume that

相关文档
最新文档