****** 1ask 1: voce Streamng ******* Consder a uncast connecton between a voce source {sender ^) and a voce snk {recever 8) connected through the 1nternet 1v4. 1he coder o1 the voce source generates a 64 kbt1s data stream {.e. a 8 k1o octet1s data stream o1 voce samp1es). 1he octets are co11ectet and sent wthn the pay1oad secton o1 an 81 protoco1 data unt {0u), the 81 0u s encapsu1ated n a 1ransport rotoco1 0u whch tse11 s encapsu1ated n the pay1oad part o1 an 1 packet every 20 ms.
^t the recever sde the 81 0u's are checked wth respect to ther Sequence uumber and ther 1mestamp and nserted nto a 1ayback 8u11er. 1he 1ayback 8u11er s read every 20 ms and de1vers the octets to the voce decoder 1or the 1oca1 synchronous p1ayout to the voce recpent devce. Mssng 81 0u's are rep1aced by a "dummy" pay1oad to guarantee a contnuous p1ayout. 0up1cated 81 0u's are dropped. larger s1ence perods o1 the sender can be e11cent1y transmtted by an ndcator so that the 1 packet stream can be sgn1cant1y reduced.
1he above scenery s contro11ed by the 81C {8ea1 1me Contro1 rotoco1), whch w11 be dscussed n speca1 assgnments o1 art 2.
0ueston 1: Whch 1ransport protoco1 s app1ed ? 0ueston 2: Sketch the prncpa1 protoco1 archtecture at the sender sde, the recever sde, and the ntermedate 1 routers. 0ueston 2: uow 1ong st the pay1oad part o1 an 81 0u ? 0ueston 4: Ior whch purposes s the 1ayback 8u11er used ? 0ueston 5: Whch two man parameters are mportant 1or the 0ua1ty o1 Servce {0oS) o1 vo1 ? 0ueston 6: 0scuss the boundary optons {very sma111very 1arge) 1or the capacty o1 the 1ayback 8u11er and ther consequences wth respect to 0oS.
1ask2: uetwork 0e1ays ****** 0ueston 7: 1ndcate whch constant and whch varab1e de1ay components account 1or the end- to-end de1ay o1 the voce data stream measured 1rom the nstant o1 the samp1ng at the source unt1 the p1ayout o1 the {7a) p1ayback nstant at the 1ayback 8u11er, and, {7b) the voce decoder. 0ueston 8: Sketch the prncpa1 probab1ty densty 1uncton 1{t) o1 the de1ay between the samp1ng nstant at ^ and the arrva1 tme o1 an 81 0u data b1ock at the 1ayback bu11er. 0ueston 9: 0e1ne the "Jtter" o1 the network de1ay.
1ask 2: 0mensonng the 1ayback 8u11er Capacty ******* 0ueston 10: ^ssume that arrvng 81 0u's wth a tota1 de1ay o1 d >= 0max cannot be consdered any more 1or p1ayback and w11, thus, be consdered as "loss". Whch target bu11er 111ng {bu11er 1oad) k {"1ayback ont") o1 the 1ayback 8u11er shou1d be attempted such that a11 arrvng 81 0u's wthn the 1mt d < 0max w11 be p1ayed out ? 0ueston 11: uow s k re1ated to the Jtter ?
1ask 4: 0ea1ng wth Lxceptons ******* 0ueston 12: uow can the case be treated when a sng1e 81 0u s dup1cated ? 0ueston 12: uow can an arrvng 81 0u be treated whch arrves "0ut o1 Sequence" ? 0ueston 12: uow can an arrvng 81 0u be treated whose 1mestamp s 1arger than the expected 1mestamp o1 the regu1ar next 81 0u ?
1ask 5: rocesses ******* 1he operaton o1 the recever 1or processng o1 an arrvng 81 0u's shou1d now be spec1ed by the 1ogc o1 two processes: rocess "^rrvng 81 0u" and rocess "1ayback".
0ueston 14: Sketch the prncpa1 State 1ranston 0agram 1or the process "^rrvng 81 0u", nc1udng the cases o1 - out o1 sequence arrva1 - dup1cate arrva1 {dup1cate sequence number) - extended tmestamp nterva1
0ueston 15: Sketch the prncpa1 State 1ranston 0agram 1or the process "1ayback".