1st term exam Computer Networks- 1/16/2014

Nombre: _____________________________________________________ 1) A HTTP client uses non-persistent connections. Up to three concurrent connections are permitted. The client downloads an HTM web-pa!e that contains si" embedded ima!es #all ob$ects hosted on the same ser%er). Please answer the &ollowin! 'uestions: a. (hat is the number o& T)P connections re'uired* #+., points) - connections are needed. one per ob$ect # 1 html / 0 ima!es )

b. How man1 2TT3s are needed to &ull1 download all the content i& each ob$ect can &it on a sin!le se!ment #assumin! transmission time is ne!li!ible)* #+., points)

0 2TTs #two &or html / two &or 4 ima!es / two &or the other three ima!es )

c. 5ame as #b) but i& three ima!es are hosted on a di&&erent ser%er. #+., points).

6t does not chan!e &rom b #onl1 tree concurrent downloads are possible. no matter the ser%er)

7) (hat is a 8N5 'uer1 o& t1pe M9* And a )NAM: 'uer1* #1 point) An M9 'uer1 re'uests the 5MTP ser%er &or a !i%en email domain #as in !mail.com)

A )NAM: 'uer1 re'uests the canonical name o& a ser%er !i%en on o& its aliases # as in www.up%.es. where that is not a canonical name but an alias o& ias.cc.up%.es )

4) (hat is se!mentation in the transport la1er* #+., points) (hene%er a an application messa!e #AP8U) is too lar!e to &it inside a sin!le se!ment. it will be di%ided into a se'uence o& them. that3s se!mentation.

1st term exam Computer Networks- 1/16/2014

;) Ne"t !raph shows the e%olution o& the <recei%er window= %alue o& one end o& a T)P connection. 8raw o%er the same !raph the e%olution o& the con!estion and the transmission windows o& the other end. et3s assume there are no communication errors and there is alwa1s application data a%ailable to be transmitted. #Threshold > win at the ori!in). #1 point) The red line shows the e%olution o& con!estion window #which o%erlaps at the be!innin! with transmission window). The !reen line shows the transmission window.

1st term exam Computer Networks- 1/16/2014

,) (hat is the total time needed &or transmittin! a ;+++ b1tes messa!e &rom A to ? usin! the pac@et switchin! networ@ depicted below* Mar@ the e%olution o& the the transmission and an1 intermediate calculation 1ou ma1 see &it. Pac@et header siAe is considered ne!li!ible. #Ma" pac@et siAe > 1+++ b1tes). #+., points)

E p ro p > 7 " 1 + C m D s d> 4++ m

T p ro c> 7 " 1 + -0 s

d> 4++ m

A
E t ra n s> 1 + M b p s

2
E tra n s> 1 + + M b p s

Time it ta@es &or the &our pac@ets to be transmitted > ; B C+++D1+Mbps > 4.7 ms Time the last pac@et ta@es to reach 2 > 4++ D 7:C > 1., usec Time o& router processin! > 7e-0 > 7 usec Time o& transmittin! last p@t #2 to ? ) > ;B C+++D1++Mbps > +.+Cms Time o& that pac@et to reach ? > 4++ D 7:C > 1., usec Addin! all the abo%e 1ou !et > 3.285 millisecon s

1st term exam Computer Networks- 1/16/2014

0) How can be determined Fin Ga%aH whether or not a ser%er is listenin! on port 174;, in 1our computer* #+., points) A 5er%er5oc@et#174;,) could be created. i& it raises an e"ception is because that port number is bein! used b1 another process. there&ore the port is in use. otherwise it is not. -) Host-A ma@es a connection re'uest to Host-? with #initial se'uence numbers) 65N#A)> 4+++ 1 6N5#?)>,+ . Iill in the table below with the se!ments associated with openin! a T)P connection. #+., points) sender #AD?) A ? A 5e' 4+++ ,+ 4++1 Ila!s 5KN 5KN/A)J A)J A)J 4++1 ,1 8ata -

C) How can a bloc@ cipher be used to not produce the same cipherte"t &or the same plainte"t* #how same input does not create the same output in certain bloc@ ciphers) #+., points) 6?M in%ented the cipher-bloc@ chainin! #)?)) mode o& operation in 1L-0. 6n )?) mode. each bloc@ o& plainte"t is 9M2ed with the pre%ious cipherte"t bloc@ be&ore bein! encr1pted. This wa1. each cipherte"t bloc@ depends on all plainte"t bloc@s processed up to that point. To ma@e each messa!e uni'ue. an initialiAation %ector must be used in the &irst bloc@.