計(jì)算機(jī)專業(yè)英語(yǔ)期末綜合題匯總

1、12/12Chapter 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) Rdb) N= Rdprop=8.0c) The bandwidth-delay product of a link is the maximum number of b

2、its that can be in the linkd) w=mN=125(m/b)，1 bit is 125e) w=mN=mRdpropP19Referring 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所以，R=swP20Consider problem P18 but now with a link of R=1Gbps.a) Rdprop=4.0b) N=4.010

3、74.010c) w=mNP21Refer again to problem P18.a) Ta= ttrans + tprop =4.0105b) Tb=10(ttrans +2 tpropc) TP24In modern packet-switched networks, the source host segments long, application-layer messages into smaller packets and sends the packets into the network. The receiver then reassembles the packets

4、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 store-and-forward switching, the total time to move message from source host to destination host =b) T=2000210Time at which 2nd packet is received at th

5、e first switch = time at which 1st packet is received at the second switch = c) NumberArrival1st32nd54000th4002time at which last (4000th) 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 seque

6、nce at the destination.ii.Message segmentation results in many smaller packets. Since header size is usually the same for all packets regardless 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 ar

7、e 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 header 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 fr

8、om 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, one packet is received at destination everyT總=S+40R2+(FS-1)( S+40RTo calculate the value of S which leads to the minimum delay，T總Chapter 2P7The total amount of time to

9、 get the IP address is.Once the IP address is known, elapses to set up the TCP connection and another elapses to request and receive the small object. The total response time isT=P8a) Non-persistent HTTP with no parallel TCP connections:Ta=T+32b) Non-persistent HTTP with parallel TCP connections:Tb=

10、T+2c) Persistent HTTP:Tc=T+P9a)=91051.5107=0.06(s)，=1/(1-)=0.15(s)Ttotal=2+0.15=2.15b) 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 s

11、ec) =1.25625 seconds.Thus the average response time is reduced from 2.6 sec to 1.25625sec.P16F = 5Gbits = 5 * 1024 Mbitsus = 20 Mbpsdmin = di = 1 MbpsClient-ServerDcs = max NF/us, F/dminDcsNu101001000100kps512025600256000250kps512025600256000500kps512025600256000Peer to PeerDp2pNu101001000100kps5120

12、17201.043516.6250kps512011527.919383.6500kps512051205120P19There are N nodes in the overlay 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 mos

13、t M neighbors. Thus the maximum number of query messages is N + NM + NM2 + + NM(K-1) = 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 Therefore, we

14、would need about 100 super-duper peers to support 4 million nodes. b) Each 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 supe

15、r peer. The super peer would respond with matches and then possibly forward 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,

16、 UDPClient does not specify a port number when it creates the socket. In this 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

17、 so that it can send packets back to the correct client socket. Glancing at 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

18、). Thus UDP server will work with any client port number, including 5432. UDPServer 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) SB23513

19、e) Yes.f) No.P3Ones complement = 1 0 0 1 0 1 1 0 0To detect errors, the receiver 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., i

20、f the last digit of the first word is converted to a 0 and the last digit of 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總=總/(100106P24In the second segment from Host A to B, the sequence number is 409, source port num

21、ber is 1028 and destination port number is 80.If the first 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.If the second segment arrives before the first s

22、egment, in the acknowledgement of the first arriving segment, the acknowledgement number is 359, indicating that it is still waiting for bytes 359 and onwards.Host BHost AHost BHost ASeq = 359Seq = 359, 50 bytesSeq = 409Seq = 409, 80 bytesAck = 409Timeout intervalAck Ack = 489Seq = Seq = 359, 50 byt

23、esAck Ack = 489Timeout intervalP28a）Denote for the estimate after the nth sample. b) c)x=0.16 The weight given to past samples decays exponentially.P34TCP slowstart is operating in the intervals 1,6 and 23,26TCP congestion advoidance is operating in the intervals 6,16 and 17,22After the 16th transmi

24、ssion round, packet loss is recognized by a triple duplicate ACK. If there was a timeout, the congestion window size would have dropped to 1.After the 22nd transmission round, segment loss is detected due to timeout, and hence the congestion window size is set to 1.The threshold is initially 32, sin

25、ce it is at this window size that slowtart stops and congestion avoidance begins.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.The threshold