f ASSIGNiMenT-4 HO2I65€ N10100 63.0 y KE oe CTH List ont Aifpuence between Virtual Cheait s and datagram FS Netwoore 7) GP Visual Creeutt Networs Datagram Metwove 3 — _ ——— — FA evt ctabines va cleclitarl caf Path NO dedicated path 2, 2 Before the Lommunt Catton takes | tb tablegh a Place ST DE tvoty es ss Btablithm 41 of before fommuncertion, ANCE Phases onncation DL tay ent, date -bean Olver Only date. tansy eg St Comneetion, Lamina tio, Shand toes partes 2, trdependet Dome # 9e GFrrtantees in Bole Packer K Thece sno Juctant cx Be Crovels, Cekuey hi teeture Qe With Atantarn pbstegy explaty the Jenceic router A Souter 4 a neboowking deitietrat brinch lata paket betuses, ee Computer netwoosks . The qeneste Sous o- A OSLEFEEUNE torn he alinticles @ into thre major Component § \tf ne: Stl ysestige 08 \ Snput Posts ‘ ad 2+ Switening falosics & Output Port 95 * | Sn put Port Output Port \s Onput Post: The taput post Tecetwe trtoming data packey fom ely} ed hetoosk taterfotes Lonel Priform Some basic functors Sukias Astor Checking Mosmring ane? Forwarding te Packets tofu Switcring fabric 2+ Syottching Fabwics Ded tte Love Component ay tu Youter 4 ez Yetponsible for receiving data paket from tre input port, g fowusatcling them tothe Output pork - The Switebdtng fabric. ene te fouting abl, Which 1d fe detumtne te bet path fy a data packet tosenr ib destination ; / . 3) QR posts: The dutpud posts ¥ecetve data park ef Hom ty Svithing fabiic ondpifotm Lome fines Precerting Suc ay ery Cheking famtng ond Sencling ti parte’ to te A ppropriae hetoosk interface’ 2) explain Puy datag tar Fotmat pose \PUu tava Protovod erred fox Boullrrg olata parkebs crvoss Gmputes Netoosky » An |PVy clatagtam 44 the basic want bf lata Uansini He BU von I PVy neticork - I tontirks af a hacks and a Payload. 32 bres i Heactet Type 64 Datagram lengths [Netto | (‘espe lengtn | [sin | rea =) ~ | [ 13-ece Feogmentation| Fl lr t | offset | IL x | Teme - To-Live [Opree-leger | | tbat thane, j [Peomoe |p Br- bit Soursee LP addven et 32 -biE Desttnatten IP addxens | I6- bit ddentrgre b Versten( 4 bres): Specifies te Utision onthe IP Protocot biting ied 1 Sn thy tare ib |PUy ,Sote Value fy IHL COntunet Htacke Leng): Speajis 24 dng Y Ue React in 32-bit Weds: The manimum Vale a £ § the dg_ ae - 0630 mMartimum Valu ale . a ar a 3 Type ). Service(@ bits): Spuipier tle quality f Levies Aequtsed for the packet © 4 Total lenin ( 16 bits) + Sperifies tte tolat Aonyin 04 She IP Vy datagran cans bye, An nechiing Ae hliacke and clara, Pasjloacd. s: Tdentificatien Cibbtts) Used to taniguely Specifies tre position, of 4 < Ant ftagment Atlatire to te Higinal volatagram ax, ¢ bules @e e B Time to Ltue - Spertfics the marcimum no- Q hopes tarde @ Potkit Aon take before burg -letarded. , 9: Protocol (8 bit) ! dpecyter the Protocol rid an fre relate , « 4 c ( Pasploas for ew. TP,UDE ICMP etc, lo: Header Checksum (16 big) UStel to Chirk tee beg rity 8) toe heaole.Wp Sourte Rddyen (32 biG) + Specifier te IP add ven x te Sencler [e630 Ns P1>- Destination Addyen( 32 br): Speogia ie |p oe CD i He Vecetver. ') 13, Optters( 0 os moxe bytes) + Optional field used for Various Putpases, duit os edie ‘pute, Lime Stamp etc. DD Explain Dynamite Host Configutatton Psotocel ond Client - my Stuer tek: beetuse. i gqeration Protect a rebowk PSO tocet a Senver to mat e i “ 4 saa at italy watign ond morag, Agee Cong ipetalion Ptametiy tuk Subnet marks, Achowtt Gateway word DVS Sey IP add serses & ctu 414, to dleuitees on a netiort f= FI DHP Discover S Zbuce off | —DHOP Request yous DHCP Ack = The DHEP Sewer mmaintary a Pool Y available | P addins and lors Alon to lark onte netope » When a aliutte lonnest tote netioovk te Stnoly q VAAAALALLURE AS yy) id~mfosmalion to Aenfigate ih netoork Conn etlen, Clieat- Serer cetiterture 2, va moctel fe Network Compeut, feeg eg: Aeactices 3 Vedode te SVE A terTrat deutag yin ee eee oO Vesnecyess frome wn wtih tee volewi a Centtol Sener The tues ANices ae Krty, PLU4orat ComPuters 4 mobr ley Het actors Aitouries or Suvtec, Poovrdecd by a Seer 663D tng —netvek ceapgentin wa broad Last meen AA ees ¢ wnhosmation- The DHCP Suet Atccives yt Ats ponds with ern -avolable IP acllinn rol tte nena, etes The lent ALn~ sw thi, ton figuration Peta The Seu ey ~ 4 thot ax Coste e AsPerurible box maroging Me Se16u¥ vey & Seve being qn ted by Tre Chent, 4 Previcting oe Catub ace fork ate ning “them ._ . Publec IPladds ev wid vente uitunet + MAT Optrarty ot Y Ae —wetroost Layer of He OS) moolet & tan be Emplement of On 0 Aeutes - Frvecvats- a, S Tunneling a wa Hebnigne rnd 1 tmntap Silat: one Netoosk Protcet uvitiin anrotiy eretivork Protos: Ths ellovt-a netoork Pprototel that 4-01 Supportes by a nelvork the Lari nui thet netvork + Ey: Af tom pory has a netorotk Ateat ~onky Suppor | Py, bat wart, to wit LPvgs hey ton entapSilat he IPvy Patlert woitein IPVvy pocket vamcl Send thin ore tHe MM network + Tunneling Aon do be ated Portal a Virtual Privat netvork (VPN) blw two network OVE te Entung. Wi) Switching Terhriques On pn tthecls ured ® trorije, Aato. blo nools vin ca netuork + Thru cue Various Swot tedinng tehniqua, tncbiding? Climate Switching + A decticat cd Communtiation pate <1 Abtablnhid blo tro meclu in a netoose andl py eating Poth +1 Attensa for the clutatten Q te Communitation +» Onte tip Communi Catlion a1 Lomplet tr pata tr veltared . Poxkest aukst Surtichting: volata ws beoken ap rito Parken, & tare Porket is Ant anclividuall, $014 olertination, Cast packer many toke a chef prsent Aduk Througt tre neticovt & He packs —_ vERETTER EEE Freeida ae 0425. — 0 Ou Krartembbtes! ot tu duttnation ; Menage Swttabing # volat ao UA dittdid Cro meinags, Lore = ao menage A At ndividuelly thvougs tee netooyk > The < mm tage A Atoud ot tart tnrtumecliak necks 1d rg ae Newt Link 2.20 path bileres available ae — Ce Switebing: data ANS eto Pinu - Syed Cely & 7 “ honk Keuiig Art winctivicluiatt, throug tte retwork - Cela ae went thormimitted nm a Speific oro § ty bxom digjens Te Sours tan be antultavist an tu ttonimirle,. Cet hr —— ' . — 0 ABamon ty ited an ATM netoork — 6. Explain —_ WPug datagram Format. The \PUy Aarogtarn Posmat 4 Ltd fox Sending data oug Ane emtune muing te Yntunet P¥ototel Ueute, 6 UIPV¢) addr ening Scheme The IPC dlatagvam Posmat Consign Qe heaclet ancl a pau oad. Br bhy ThE IPUL Constits Q the follastrg fretds: being uted, which y alony Set fog TBafpic clon, Tr & bolt field tind to Spratly Metaped Seiten eu — X Ueution: This Y- bit iete Specifies te Version J the 1PUC protoce ¢ q & & & ae ; fo the Pocket, Such .o4 high Prloprity, lous latency OX best Effost - :I Plostabel: Thy 2o-bie field sud, to identify paris to F* 0630 Oe ce a cine pte ad epee, Spud Pang 06 or Psocewing . ‘ &S Paxyload length: Thea Noe bit field Geeifies te lengt p te paylo et ‘ CR Uatey en ty clatagren CD Next header Ths B bit field (derntifics Te protocol rel to the Peuload: data, Ska; TLR LP ov LEMPVE- pan Hop limit: Tho 8-bit field Sperifies tLe marimum no- J hops ET Hot he pavers som travel befose it os AA laid ed pppp) DP Source Addvers: Tho 128 bit fielol Sptrifien tre JPUC add ¥ tn 4) ot ot tre Senoley e™ Dutination Addven: Ke 128-bit Held Sperifies fee [Pub addvers aa De veupedt: = a = 32 bits = nas Vision | [Peabbic Clava | | Flow label = Faxjlondllengtt | [Next head Hop Limi ¢ — : — Gouste Addses (128) bth -s Destination adelsen (128) big - a a Datta. als : a - uw ——4) Vipperentiate bebour D Routing and foravdling 630 W) Link State and distant Vector routing algoritin, 2) Routing and Forwarding Routing | Fosusaxding be The peoven d Selecting the path| The prot 9 atiall; tmcling tr thet netoork wt Lt folloro fom patkets along the hove Th Scouse tp tu tlerttnat fon. path, fsorm tre nebooxt nade to He next + 2" Dektumnine te most efficient | divuh the packet tpoaids ther, SORL baud On netoosd Lonclittony packet, A Utinatitn baud 07 Such 24 Lenguition, bandwid t. |enfosmatlon obtotned (vom dhe outta Psovew- 3° Deteumtnes the Path 9, the (Caves fle packet {som Bre Packet netoosk device fo anotiu: u Paubotmed by Youre oc Sriten, Pufosmed by soukees ov Surtees, & Mignes Lom plenit, how lows 24 Com pleaity how Furouding SoutingSU) Link State and ‘Distant Utetor. Routing Algortihnn = W Link State te Routing > dD Bouting algosttivn tok Auta = wm Hr formetion about He entive > netoosk topology +o Coltulate tre > beat patr fox 2ack pocket - 7 2 > Foster Aonvegtner as tack > Abita tos a Complete Uta tte : Netioosk topology c © 3) Orley updote shin thee 4 ve. 2 Change nth netooxk topology 4) Higher Complenily due to tue oly tination vse eo od 8 5) Examples protocol opr US |p ‘outing algoxizhin rot MMs oa L235 © Diston ce \becto aay Simplee Approach where toe Sout ont Known teditang nel oliyertlon +p 16 negrbours. | | Slower Conitigtnocs Fouly |ynust bxebange tr foma tlen to Arn about te netoosk topology. Pusodéc Updat, ore Sent even, When tren 1 ro honge m tre Retboosk topology. Lowe Lom ple, Aut to te one netoosk node fonext- Example Protocaby art BIF, BGP& Liat owt th Susties provided by network hayes The netoosk doer, Abo know vas the Hid Meagan in She Qs) model, provicles Seierat Suuives that are tential bes Communitation bw desis Ona netwoosk- VWAAA\\\\JS Addseming : The netioosk Layer povicls Logical add tenting Auch 24 |Pacdyeing fad Faentt{ies tek due (a4 ono netoosk & thables Communttatlenr blo Aeuty, - Routing » The netoox & dope cetimina Le best Pele fe. data to travel Geom te Source to tu olestinatlon Oleuice- Jue, eee Selecting the Opproprlal netoosk path, aNotding Congestion g minimizing clelays Fragmentation axel Reavembly The netoose Aowyer a Aorge Potkets Prto Salta pak Aatlel Yvagrnent fP ensure Sueceen fet Clorsmiuiien ver the nekoovk + The [agment, wae Ctomembled ct te destination Aeuice . PEFRETITTY Quattty § Soslee: The netoos k Aonper PrOVidy meelanss fe, Prior Ltytng 4 Controlling Me flow 9 nétoork xa pyie foernsure thet Criti Cot taffic Secewes PeiOBIty Lenel ba, . nol wid ty. <, heel eppiccrnty: Exsor Petation The natoore Jaap lomdlded tuey 2, hargmitltd olota ,Such-ar Cherkiwn eros OX parkas, fos r bake Lorsetwe ortion And -» ap apgpeeePppPpphpig yet Lon . Conct Ty Stewie Routing Algor | Dynamic Routing Algpatthn 2 t . s . u 2 aon . mm > Axouting algoxithm in Which | B Sorting o.\gorithm nets mm te neboyk adrvinitratoy manual Souting fable 4) auctommectica ly ~~ Conpigutts ie couting ate UpdeNtd by network outers i D Configurator 2 done manual Con pigaraliion <4 autora ed § mee Dy te Netwosk AdministYato, Lact Youtis tuchange tnpormation Le alee must be Lonpiqued With tack oer te clynarl Calh, ae cndlvvictisalty Update tree Youting table. DMR Arnot Satable (9b 4% Salable 4) Maintance is high | Matntenu i, too S) Mes Aen lomplen than dynamic Str move Complex thon outing | Statte Xouting 6) 9a fost than Ay manat c 19824 Sloowe Pron atte routing, Souatinng | SSM MMNVENMUUVV EER EE ERAASDce State. V 063p ¥ W) Explain (> Link Stabe vouting (UW) Distonte Watoy De g w . ¢ Plapsttn (ww) Hiuackiat outing - ‘ € D Link Stare Boutin algositin, as eutype Aouting algoe btton « ieteel bby Wouter fo Caleulak dre Shovi Ge path ta detend tar : netoort * In thy alqovithm , Lore Foutu burles a om plet rape Al te netisort Fopology & exchange thes Enpowration wd Of, Aeurtiy eer) a lnk State advetlsement * Steps Cruolved? a Link State algorithm: Discovery. Cask tout ee fist clr toven WG cdinwky tonrntcteys Nn eXoploours Ete cme Ye link t tack ne“ahbour Link State Rdvedtlument: Ere Sout tat Jenciaty an LIA Hat en ely enferrmation about Ue neighbour te tot Yo Veackd tary newarbour, & ths State Q He Uns Hooeltng: botk souter fooes ob LSA t AU otter Kouty at, —- te network, tntuving thet wiry dertu hey in Complete map Ye network topology PPPRPRRPARRPSHRRHSRHRRRRARRAN|KE Shostyt path Gt . st : host pa Cutatlenr:. US' ng te nfosmatla, te S45, Ag Souk Colertat, fre Shostut Pate to Teare Lark olejtingtlar nel 0x4 & Fosoarding: The Youty formic packet fo He newt hop Tuk, Along fle Shortest pale bite destinaton netrord. PRARPAARRRSVS MSV SUSUMU OM UUUATTARCTTCTECSC CTU UV Ue ee ee HY kan uw ing i 5 a 63D actin lgoxithrn £ U) Digante Veutos Nouting -algositem 3 a type § outing ov item wd by Boutey to dettumine tt Shot ut Pats too dey ttnatton netioosk + Jn tack voutu maintany a pened Hhlert Aonrtonrs te clifton teyeek Leck dythedy hetwosk , MOueU-ay Tu nerct hop Touts te Veeck fle Adeatinaten, Steps involusd ou : Dott Yaliyatlen: Cac Youtu Pnitialys ub Boutlag table wit, tle sere Sark & olivettly Connected nceghbour $ Dutane Vutory Clrrlations €aet VYorty Ca ltuletion wh necro oats talble by Comparing fuditnu tp tact aetinatle, neroosk ay Adu ected by % Meee oueS OPdat ¢ fosuniding table: Gack Voutu Updaty 4 fovwateling table tp veflet ta net hop tuts jowence Lark clejtina tle, netoosk Repeat: Step > -y¥ ace Veputed at eget Antunes allourty, wis 4 a Bout ty updak tren Couting tables Forecasting table; 2, Ne nttoorvk topology Change UL) Htevartter MOuting 1a metrecl d OManijing Te netooys “opalogy fnto hiearcal Sirutuse fo trrpvoue te fficrenss Q Souting we Forge networks s Jn hitcavetial Youting 7 ie retook 4 disided Pnto multiple lel oy tics with tack leuet Veprerenrting ao cbge Atogeaphic 4a 61 adlmlautratwe Amat,0630 The malin néla behind hieatebtal Youting 1 te veduw te Aorount ) Touting Updats thar nud to be Prop agai Foughout The netoork, as wrllag te Sie Ye netooye + outing Jatoler th Bart Soutu » Thi 4 attromplih ty by 1 grouping neticorks into larger Ag qregat, at tart levd J pe hiaacry, dotradt Touting Updlaty red only be Set b/es nerghbousing Soutiy withta te Same agg reget - fo Example . On w ht warebieat fouling Scheme fot The tnt tinct, He meksort A divided into Blevel: tre Crvelwel, He olityt bi tle level 5 he ALC eulevel> Tle Cove lewel Voutey WAick Oe YQpomsta le tow Boutlny Wo fpic blo Obg purent Gog vaphical Vea lons 1 WK Te AsAN i outhon level toutes aggregate Laggic - Prom maliple atten levetnetoovk | out 1+ to fie Cove level The Alt ag lev ey Noutis aus ¥erporutble fox Connettry Crelivicliah Lage Usey so the netopy & PPPCEFFPPPPPP EPEC TPCT TT TLL yyyyggyqygyyys