aX 2 1, True/Ralse Questions: [10x 2=20] 1. Before sending a packet into a datagram network, the source must determine all of the links that packet will traverse between source and destination. True (False 7 II. Internet provides its applications two types of services, a TDM service and a FDM s wt oe ae) III, With ADSL, each subscriber gets more downstream bandwidth than upstream bandwidth and the bandwidth is shared. ( ») Broek GE IV. Dial-up Internet uses DM between the Internet modem and the ISP’s central office. True, (False, Rn ee SS) V. With FTP, itis possible to send files over the same TCP connection. True) (False) x VI. Given two nodes are connected by a single physical link; the propagation delay experienced by a 500B packet is much greater than a 499B packet. True (rang VIL. When a user requests a Web page that consists of some text and two images. For this page. the client will send one requests and receive three response messages. ~\ True) (~ False ) VIII. Consider an HTT? Web server using persistent connections. Suppose the server spawns a separate process for each client that connects to the server. ‘Then each of these spawned processes will have different server port numbers. ae Truc / False / IX. Kazaa is an example of a homogenous P2P application. xm ~ A | True ) “False ) X. SMTP is an e-mail access protocol. % True \ False3 IL. List TWO important differences between [5x4=20) > Hybrid-fiber-coa: Hither honda dtr 1 Ue eistin Hele pong connebo| Converted fo digihk syugh cable network Digital-subscriber-line network users are connected to aw Sond] 2 maited banduid blr weighborkoad POUFEr that 5 + Pmt inden tonnected —f the L5emain (me B Packet-switching Cireuit-switching Bead a dole yromialg used |"] Panuilth iS seserved ly WV connections by n connections (TOM FON FDA 2 | Tttbenmiffenf Connection. Consistent Connection c Client-server architecture Peer-to-peer architecture 1} all clients retrieve From gener | 1] pleat retrieve fom server cleeat cam act 05 server fo Sree with other chert Nake of peer te peer 13 unsecoed 2) delay can increase fo infincte based, 0 WV dlvents 4 D Gnutella Bit Torrent ' fest come frst seve TT ncholce and optimistic unchdee 2 Srork From first packs | get rarest paclee+ first J E 1970’s Network Characteristies 1990°s Network Characteristies ? lager Ost wode( 5 lager protocol 2 did not fake snterwet Internet 15, port of the tato 5 heger protocol 24 mL. a) Consider two 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. i, Express the propagation delay, dry, in terms of m and s. ii, Determine the transmission time of the packet, dlyany in terms of L and R. . Express the end-to-end delay (ignore processing and queuing delays). iv. Suppose s = 2.5x108, L = 1000bits, and R = S6kbps. Find the distance m, so that dyrap dan: [2.5x4=10] ) | pxep = S iv) ii) obrons - - wes Ge 2sx108 ws Lz looobits R>Scohbbers — i \ \ dpnp ~ Sarons "Dong -end ~ (eae tans) 6) dead-end = (4+ £) pplication ronseert retocor' end-to-end diagram, show how an application message (data) from the source is encapsulated into different data units (name each type data unit) at each layer in the source host and how this data unit is modified at the intermediate router and at the destination host. [10] Arraliiadien Trans fore Fei zee| the 'b) Given that a source host is connected to a destination host using a layer 3 router. Using a labeled foe delineton! Nese Lote at Jp Addy 7 Trancmitled pots | pastel sae] Dota _ physica 2 Gestmadten recelees and veassembles (pack ets into origin yh he ; Dota ace to | IS SO syed jy Ye header5 Iv. Suppose within your Web browser you click on a link to obtain a Web page. The IP address for the associated URL is not cached in your local host, so a DNS look-up is necessary to obtain the IP address. Suppose that m DNS servers are visited before your host receives the IP address from DNS; the successive visits incur an RTT of RTT), RTT2,... RTT. Further suppose that the Web page associated with the link consists of a small amount of HTML text and the HTML file references exactly three very small objects on the same server. Let RTT denote the RTT between the local host and the server containing the object. Assuming zero transmission time of the objects, how much time elapses from when the client clicks on the link until the elient receives all the objects: i. with non-persistent HTTP with no parallel TCP connections? ii. with persistent HTTP with pipelining (single TCP connection)? [7.5+7.5= 15] Rip. 76 Boter Rig - Send Pecene between A oad B Wels ww RT, tRrz, +... KT N- numbtrok connedtion >> BIT ERIM, Fi FRM. F2RTo no parule| ) Epes | Qq7 + RIT, +... CRIT, F QRIT + @yarre Tine ~ where A) iS nomber Hf connections 7 CO pipe W) Elapsed © IT ERTL. toe RIM, ER RTT. + RTT, t © o oO Time (ened Sd~ 6 V. Derive the minimum distribution time to distribute a file of size F bits, initially at one server to N other computers using a) Client-Server architecture and b) Peer-to-Peer architecture. ‘Assume that dis the download rate and u, is the upload rate of node i. Also assume that the propagation, nodal processing, and queueing delays are negligible. Assume that 1, is the server upload bandwidth. [75+7.5=15] File, size F dé = dovsnboad tote = dain rote tole 4 MA an con = upload weer ie tees Us = soryer uplod be Ne nowler of pers (ae fle w#e mM bes WE. £ A Dis? G51 don ale minimums desteibvkion 7S sin Tadath and size per peer mmimusr dovnload for elréat serve it depends e WE 15— Rs = Max [z# "Sake on mnber of per oud the co minimem downlood nf 2) Drops mex] am NE ‘ }) P2P te an MES fo account Pht & cleat com beome @) Peer fo peer kes a seeder (server )