CS & IT 6 ENGINEERING _ COMPUTER NETWORKS § Ron Teva eel mer le ele j Ea f rae a se . By- Ankit Doyla SirConsider a 128 x 10° bits/second satellite communication @ link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgment. The minimum number of bits required for the sequence number field to achieve 100% utilization is : GATE-2016 ES Te ENC Ta Tacfvame) = F¥qme siz Fa= ISomsec Banduity a Caen acy Beer a0%4 mci Dremel hts SALI Y SSE eset esei ris Pag bsuls Seon aa ; G Daas aye Tage aS cesta) 1s 364 [en es ney Ws: [568] =6 TUTE TRS AL co Sa a 12 eranA 3000 km long trunk operating at 1.536 Mbps is used to @ transmit 64 bytes frames and uses SWP. If the propagation speed is 6 sec/km, then the nl os (oye emi telt ements sequence numbers be Ste | Cea hice Os O « @: a8 A=Btookm » B= 1536x166 brs] ste » Fram size= 64eite BRS ead Pakegetut ie ree EO ACG Seca otal a LS RUA BeOS eect ARing Tacftame) = Fyame size iE aie rere a Bandwiaty SRI Same (Gi U0) Pee a DUDA cay = 33333xK10 Gee a To sapere 4 = NX 833-33 Hsec Ro Reh hema (Osean PCa eh eee N= 36,333-33 48fc Pee) RE 6d Pie ee N= 4109-09408 Nae POLE) rar Perea RCCL) Sia)Consider selective repeat ARQ is used for flow control, @ frame size is 4000 bits, data transfer rate of channel is 1 Mbps and one way propagation delay is 18 ms then minimum number of bits required for sequence number field for maximum utilization is___. Frame size= 4000 bits » B= AmbPs = lo bitlsoc 5 Pi-temsac ‘Tctsame) Sa eR Ea Ce 2 e rn real war USSSA Kyapack re aS 1= WexTychtame) Draco i Gut) See PE Tus Ws= Abmes Poe Ve =10 Pec oMm lad a Sa RO = 40440 =o PET Pier eS NayConsider the sliding window flow-control protocol operating @ between a sender and a receiver over a full-duplex error-free HTT) a NSTC om ertcm Coot ey alsa « The time taken for processing the data frame by the receiver is sites « The time taken for processing the acknowledgement frame by the Ryle Comper ite) com «The sender has infinite number of frames available for transmission. * The size of the data frame is 2,000 bits and the size of the acknowledgement frame is 10 bits. PR UH I atc be Ce Re-eReeae( WML) a Gwe ie meen * One way propagation delay of the link is 100 milliseconds. + The minimum value of the sender’s window size in terms of the number of frames, (rounded PTectece trom mac em cok: iaVores link utilization of 50% is_(50-52). [GATE-2021 |Peas eer as SCs (ees CnC pear Saeed : 10° bits] Soc fe CSN TS ee ees Tare eek aan eeu f pee AS rT Oy mA cll EAE Ys a Nc SR AEN BadaaU a CG i) De eae) ait Aa) ES PEt a eae ee eS a CES mC Ere USC Rd Ps CEST Sa ty] Ws=54Station A uses 32 bytes packets to transmit messages to @ Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use? @ » fe Be TSR STC) (ca Oo 4 CORE ROSS UTE SECT NTS RSLS Sy runs Oa es AKC LasPa etic ke Se Lh Dn a) UES BP ES peal ie Sa BATONS EET Earn ts i = Usifultime Beret sO (Gh) ‘va1. Calculate RTT = 80%|6 3sec 2. Based on the given Bandwidth and RTT calculate No. of bits we are able to transfer with in RTT and Eauate tat) ase in Skog Cee ee ee ee Sarena Se As ae oe eras lb Ua (ute ct t4) 1) eZ TS CUTTS re Ltn Oke LUNs a ay eA ee Ce ee Coy) Where K = No. of bits required in the sequence number fieldConsider two node A and B round trip delay between ® these is 80 ms and bottle neck bandwidth of link between A and B is 512 KBps, the optimal window size (in packets) ST menee eee cee e Mee Bhat AECL Naor Eo RAL Oe ere oe ey Te | cla Sa Cy errand O RTT = oxlo3s0c ® Wes = S¥RTT= ape Rane a ent a = BIR EHGO, an 2 @ Ve = core paces Crany ar a Pe) a CO ean nes marta) eta: ere et ear Yes We = RTT oS PRs Tacframe) aruP SN E aaa Se eosfe) wed Co } Sf oF ed ey WT 2) ae 4 i Ls diane ad i BodeM-B,¢,D-= TOC, & —» mon to Fri RN eR To pace ae uf Bela eee TTRCU I) Balch A1B,<1D-» CN sot, ATU) ir) Gans Renae Aleal SE eTCVS) CN ay Sct eC ee aC | sat Identification lec 1gEy Fragment offset cot) ec ets) est Bern Time to Live | Protacol| Header checksum Cale iad oo Lana Conan eS ; Relies eset ec) RST eer) Ppfeeetets nn stele lak ts) ie = Phere Obie Tern SS SOU Ce ieee CU Tico wT Sea een ear ByteHeader Length (HL) = 4bit : @ Caer ees Maximum Heads §j2¢= Gopyte | aces (Gama cere (sF) + ¢ay ULE Cree EN SBC) Dey Fa eae) SL mee EIcrs ci Cre ery (5-45) | (aop- 608) a Sige 4000 #Services: @ In this Interpretation the first 3 bit are called precedence bit (Priority bit) and Next 4 bit are called types of services bits and last bit is Not used.Priority : ® eee aC me mic mmm CUNOR Ome S MT My ttiaae Priority field is needed if a router is congested need to discard some datagram , those datagram which have the lowest priority are discarded firstTypes of Services : by It is a 4 bit subfield . Each bit having a special meaning .although a bit can be 0 or 1. One and only one of the bits can have the value 1 in each datagram.Identification Number : rs Each datagram is associated with a sequence no. is called as datagram no. or identification no. 2. Itis used to identify all the fragment of same datagram. 3. All the fragment of same datagram will have the same identification no.SET Tatham laa emo m ie iVeblmeie altaceeran ito Oy Fragment offset indicate no of data byte ahead of this fragment in that particular packet.