ImageVerifierCode 换一换
格式:DOCX , 页数:12 ,大小:62.59KB ,
资源ID:9709708      下载积分:8 金币
验证码下载
登录下载
邮箱/手机:
验证码: 获取验证码
温馨提示:
支付成功后,系统会自动生成账号(用户名为邮箱或者手机号,密码是验证码),方便下次登录下载和查询订单;
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝    微信支付   
验证码:   换一换

开通VIP
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【https://www.zixin.com.cn/docdown/9709708.html】到电脑端继续下载(重复下载【60天内】不扣币)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录   QQ登录  

开通VIP折扣优惠下载文档

            查看会员权益                  [ 下载后找不到文档?]

填表反馈(24小时):  下载求助     关注领币    退款申请

开具发票请登录PC端进行申请。


权利声明

1、咨信平台为文档C2C交易模式,即用户上传的文档直接被用户下载,收益归上传人(含作者)所有;本站仅是提供信息存储空间和展示预览,仅对用户上传内容的表现方式做保护处理,对上载内容不做任何修改或编辑。所展示的作品文档包括内容和图片全部来源于网络用户和作者上传投稿,我们不确定上传用户享有完全著作权,根据《信息网络传播权保护条例》,如果侵犯了您的版权、权益或隐私,请联系我们,核实后会尽快下架及时删除,并可随时和客服了解处理情况,尊重保护知识产权我们共同努力。
2、文档的总页数、文档格式和文档大小以系统显示为准(内容中显示的页数不一定正确),网站客服只以系统显示的页数、文件格式、文档大小作为仲裁依据,个别因单元格分列造成显示页码不一将协商解决,平台无法对文档的真实性、完整性、权威性、准确性、专业性及其观点立场做任何保证或承诺,下载前须认真查看,确认无误后再购买,务必慎重购买;若有违法违纪将进行移交司法处理,若涉侵权平台将进行基本处罚并下架。
3、本站所有内容均由用户上传,付费前请自行鉴别,如您付费,意味着您已接受本站规则且自行承担风险,本站不进行额外附加服务,虚拟产品一经售出概不退款(未进行购买下载可退充值款),文档一经付费(服务费)、不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
4、如你看到网页展示的文档有www.zixin.com.cn水印,是因预览和防盗链等技术需要对页面进行转换压缩成图而已,我们并不对上传的文档进行任何编辑或修改,文档下载后都不会有水印标识(原文档上传前个别存留的除外),下载后原文更清晰;试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓;PPT和DOC文档可被视为“模板”,允许上传人保留章节、目录结构的情况下删减部份的内容;PDF文档不管是原文档转换或图片扫描而得,本站不作要求视为允许,下载前可先查看【教您几个在下载文档中可以更好的避免被坑】。
5、本文档所展示的图片、画像、字体、音乐的版权可能需版权方额外授权,请谨慎使用;网站提供的党政主题相关内容(国旗、国徽、党徽--等)目的在于配合国家政策宣传,仅限个人学习分享使用,禁止用于任何广告和商用目的。
6、文档遇到问题,请及时联系平台进行协调解决,联系【微信客服】、【QQ客服】,若有其他问题请点击或扫码反馈【服务填表】;文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“【版权申诉】”,意见反馈和侵权处理邮箱:1219186828@qq.com;也可以拔打客服电话:4009-655-100;投诉/维权电话:18658249818。

注意事项

本文(计算机专业英语期末综合题汇总.docx)为本站上传会员【人****来】主动上传,咨信网仅是提供信息存储空间和展示预览,仅对用户上传内容的表现方式做保护处理,对上载内容不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知咨信网(发送邮件至1219186828@qq.com、拔打电话4009-655-100或【 微信客服】、【 QQ客服】),核实后会尽快下架及时删除,并可随时和客服了解处理情况,尊重保护知识产权我们共同努力。
温馨提示:如果因为网速或其他原因下载失败请重新下载,重复下载【60天内】不扣币。 服务填表

计算机专业英语期末综合题汇总.docx

1、Chapter 1P18Suppose two hosts, A and B, are separated by 10,000 kilometers and are connected by a direct link of R =2 Mbps. Suppose the propagation speed over the link is 2.5*108 meters/sec.a) dprop=ms=0.04(s) Rdprop=8.0104(b)b) N= Rdprop=8.0104(b)c) The bandwidth-delay product of a link is the maxi

2、mum number of bits that can be in the linkd) w=mN=125(m/b),1 bit is 125 meters long, which is longer than a football fielde) w=mN=mRdprop=mRms=sRP19Referring to problem P18, suppose we can modify R. For what value of R is the width of a bit as long as the length of the link?依题意,w=m=1.0107(m),又w=sR所以

3、R=sw=25(bps)P20Consider problem P18 but now with a link of R=1Gbps.a) Rdprop=4.0107(b)b) N=4.01074.0105 Nmax=4.0105c) w=mN=0.25(m/b)P21Refer again to problem P18.a) Ta= ttrans + tprop =4.0105R+ms=0.2+0.04=0.24(s)b) Tb=10(ttrans +2 tprop)=1(s)c) TaTbP24In modern packet-switched networks, the source

4、host segments long, application-layer messages into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into original message.We refer to this process as message segmentation.a) Time to send message from source host to first packet switch =. With st

5、ore-and-forward switching, the total time to move message from source host to destination host =b) T=20002106=0.001(s)=1ms Time at which 2nd packet is received at the first switch = time at which 1st packet is received at the second switch = c) NumberArrival1st32nd54000th4002time at which last (4000

6、th) packet is received=. It can be seen that delay in using message segmentation is significantly less (almost 1/3rd). d) Drawbacks:i.Packets have to be put in sequence at the destination.ii.Message segmentation results in many smaller packets. Since header size is usually the same for all packets r

7、egardless of their size, with message segmentation the total amount of header bytes is more.P26Consider sending a large file of F bits for Host A to Host B. There are two links between A and B, and the links are uncongested. Host A segments the file into segments of S bits each and adds 40 bits of h

8、eader to each segment, forming packets of L=40+S bits. Each link has a transmission rate of R bps. Find the value of S that minimizes the delay of moving the file from Host A to Host B. Disregard propagation dealy.Time at which the 1st packet is received at the destination:T=S+40R2(s),After this, on

9、e packet is received at destination everyS+40RsecT总=S+40R2+(FS-1)( S+40R)= (FS+1)( S+40R)To calculate the value of S which leads to the minimum delay,T总=0Chapter 2P7The total amount of time to get the IP address is.Once the IP address is known, elapses to set up the TCP connection and another elapse

10、s to request and receive the small object. The total response time isT=P8a) Non-persistent HTTP with no parallel TCP connections:Ta=T+32RTT0b) Non-persistent HTTP with parallel TCP connections:Tb=T+2RTT0c) Persistent HTTP:Tc=T+RTT0P9a)=91051.5107=0.06(s),=10,=0.6/(1-)=0.15(s)Ttotal=2+0.15=2.15(s)b)

11、the average access delay is /(1-0.6) =(0.06 sec)/1 (0.6)(0.6) = 0.09375 seconds.the average response time is0 .12 sec +2 sec =2.09375 sec for cache missesthe average response time is (0.4)(0 sec) + (0.6)(2.09375 sec) =1.25625 seconds.Thus the average response time is reduced from 2.6 sec to 1.25625s

12、ec.P16F = 5Gbits = 5 * 1024 Mbitsus = 20 Mbpsdmin = di = 1 MbpsClient-ServerDcs = max NF/us, F/dminDcsNu101001000100kps512025600256000250kps512025600256000500kps512025600256000Peer to PeerDp2pNu101001000100kps512017201.043516.6250kps512011527.919383.6500kps512051205120P19There are N nodes in the ove

13、rlay network. There are N(N-1)/2 edges.P21Alice sends her query to at most N neighbors. Each of these neighbors forwards the query to at most M = N-1 neighbors. Each of those neighbors forwards the query to at most M neighbors. Thus the maximum number of query messages is N + NM + NM2 + + NM(K-1) =

14、N(1 + M + M2 + + M(K-1) ) = N(1-MK)/(1-M) = N(N-1)K- 1/(N-2) P23In this problem we explore designing a hierarchical overlay that has ordinary peers, super peers, and super-duper peers.a) 100400=4104 41064104=100Therefore, we would need about 100 super-duper peers to support 4 million nodes. b) Each

15、super peer might store the meta-data for all of the files its children are sharing. A super-duper peer might store all of the meta-data that its super-peer children store. An ordinary node would first send a query to its super peer. The super peer would respond with matches and then possibly forward

16、 the message to its super-duper peer. The super-duper peer would respond (through the overlay network) with its matches. The super-duper peer may further forward the query to other super-duper peers.P24With the original line, UDPClient does not specify a port number when it creates the socket. In th

17、is case, the code lets the underlying operating system choose a port number. With the replacement line, when UDPClient is executed, a UDP socket is created with port number 5432 .UDPServer needs to know the client port number so that it can send packets back to the correct client socket. Glancing at

18、 UDPServer, we see that the client port number is not “hard-wired” into the server code; instead, UDPServer determines the client port number by unraveling the datagram it receives from the client (using the .getPort() method). Thus UDP server will work with any client port number, including 5432. U

19、DPServer therefore does not need to be modified.Before:Client socket = x (chosen by OS)Server socket = 9876After:Client socket = 5432Chapter 3P1source portnumbersdestination portnumbersa) AS46723b) BS51323c) SA23467d) SB23513e) Yes.f) No.P3Ones complement = 1 0 0 1 0 1 1 0 0To detect errors, the rec

20、eiver adds the four words (the three original words and the checksum). If the sum contains a zero, the receiver knows there has been an error. All one-bit errors will be detected, but two-bit errors can be undetected (e.g., if the last digit of the first word is converted to a 0 and the last digit o

21、f the second word is converted to a 1).P140.8=(0.008n)/30.016n=3002P23There are possible sequence numbers.a)b)n=,66n=194,156,028总=总/(100106)=359.1(s)P24a. In the second segment from Host A to B, the sequence number is 409, source port number is 1028 and destination port number is 80.b. If the first

22、segment arrives before the second, in the acknowledgement of the first arriving segment, the acknowledgement number is 409, the source port number is 80 and the destination port number is 1028.c. If the second segment arrives before the first segment, in the acknowledgement of the first arriving seg

23、ment, the acknowledgement number is 359, indicating that it is still waiting for bytes 359 and onwards.d.Host BHost ASeq = 359, 50 bytesSeq = 409, 80 bytesAck = 409Timeout intervalAck = 489Seq = 359, 50 bytesAck = 489Timeout intervalP28a)Denote for the estimate after the nth sample. b) c)x=0.16 The

24、weight given to past samples decays exponentially.P34a) TCP slowstart is operating in the intervals 1,6 and 23,26b) TCP congestion advoidance is operating in the intervals 6,16 and 17,22c) After the 16th transmission round, packet loss is recognized by a triple duplicate ACK. If there was a timeout,

25、 the congestion window size would have dropped to 1.d) After the 22nd transmission round, segment loss is detected due to timeout, and hence the congestion window size is set to 1.e) The threshold is initially 32, since it is at this window size that slowtart stops and congestion avoidance begins.f)

26、 The threshold is set to half the value of the congestion window when packet loss is detected. When loss is detected during transmission round 16, the congestion windows size is 42. Hence the threshold is 21 during the 18th transmission round.g) The threshold is set to half the value of the congesti

27、on window when packet loss is detected. When loss is detected during transmission round 22, the congestion windows size is 26. Hence the threshold is 13 during the 24th transmission round.h) During the 1st transmission round, packet 1 is sent; packet 2-3 are sent in the 2nd transmission round; packe

28、ts 4-7 are sent in the 3rd transmission round; packets 8-15 are sent in the 4th transmission round; packets15-31 are sent in the 5th transmission round; packets 32-63 are sent in the 6th transmission round; packets 64 96 are sent in the 7th transmission round. Thus packet 70 is sent in the 7th transmission round.i) The congestion window and threshold will be set to half the current value of the congestion window (8) when the loss occurred. Thus the new values of the threshold and window will be 4.

移动网页_全站_页脚广告1

关于我们      便捷服务       自信AI       AI导航        抽奖活动

©2010-2025 宁波自信网络信息技术有限公司  版权所有

客服电话:4009-655-100  投诉/维权电话:18658249818

gongan.png浙公网安备33021202000488号   

icp.png浙ICP备2021020529号-1  |  浙B2-20240490  

关注我们 :gzh.png    weibo.png    LOFTER.png 

客服