0% found this document useful (0 votes)
26 views30 pages

Sppu 5 Unit Endsem Solution

Sppu

Uploaded by

rushigirhe00
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
26 views30 pages

Sppu 5 Unit Endsem Solution

Sppu

Uploaded by

rushigirhe00
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 30
J Ss Jayawant Shikshan Prasarak Mandal’s M’s Group of Institute Name of Institute [varied & all the entries found correct JeSuperviso's Name, Signature & Date a Roll No. (In Figures) Centre Roll No. (In Words) _ Day, & Date ese eae {©xamination,; Subject sat te) 8s ny Sections June C2020) | Basic of Computer _‘Netwosr LeenCamuns) | F ee >. = 2u play /sune- 2° CS ‘Supervisor's Name Se bey Signature & Date | ______—— 7 ane ee Roll No a ind ; -96l_0]_| discuss oisance vectox Routing psoracol i waa 8 | SN ———O| Disrance_vectas_Ra i= + Distance _vectox Rousing i9_a_dynarnic_xouting aigonithi nly designed fox sma nenuas Topoiog! tao coed as Benman -Foxd / Fox } Such tables gives the ner Known distance to eacn dro tnattan 2 information abour_usnich une tobe used so wench tere j Fach toutes Knows tre identity o: Fevesy others woures inthe nw Sur the Shontest path to each xoutes iS natnawn +} fis nedes._eschange infoxmatfon only with them nefghbousing des pOlstance vector ia ~defined ne_she iret of < distance cast? tuples ———|4. tele pes destinatron, supervisor's Name Signature & Date Roll No. Pg./SupplNo: [Date: ee ee Entzy.in each squaxe sepresents _|Node +0 distinatfon +} Roures_pestodtcally sends. a _copyof i's distance vector +0 all ite Cost to destination fsom_A via 8 = Cosy 10 destination A vio B ___ = _Cussent cost t0_destinatfan fram QQ ___ -tapie ne sees that soures ¢ has o——— soure to. A _unth_2 hopes —_— + ‘The _peablem_is_that 8. doee- _Know_that"¢ nae wourts"6-08 Successoa_in_hre waurng maple 0h the soutes_to_a%——— Pe /Pa./Suppl.No: ‘Supervisor's Name __—— Date Signature & Date _—_____—_— Seah Roll No. —— “¢-G9b)_| fepiam E1mRP Pxotocolin det — a >| £l@R° in stand fox‘ ennanced_isnk Stare Routing protocal isa [Bouting_pxotocel designed 10 improve the_effictenciy and ——_ ttanal Psatoca) _ —— seabihty, of netuiexk nouttng compaxéd_ta_tsads oo ——+\Ke a1P ond erare while lage eee is nor widely necagnized .s} aereaxG tobe | 0 conceprie) evolution os a vasiant of enhanced intestor | gareway Routing protocol Cei@Re] which ¢_used_Psimasili_within Te nl Key Peasunes of Fimge Oiffiising update _Algowtthm coualli — a 4) | Huyjoxid_pousing pxntocar:~ ~ |-- ElGee compines feaiumes of path distance vectox and ink srare j Pxorocol_. Tt uses.a distance vector Appwoch fox sauting 1 Nfoxrmaation | disseminatfon ond itnk-Srore fox_mamiatoing toPology Imfoxmatton. Ud! classiess Roun Whis_aigonitiam uses uci to compure the pest path toa destination _ Ht olgamtihnm allows routes to_quicikiy Converge on tne pest xaure | Metsics: — — | Thi alows firs move psecise xoure sei ectran___ | Mnis_allows fox moxe_effrctent xP addwess allocation scomPonenis_of _eimgp — _= Neighboss _ - Topology, Tabie + Routing Table. Heo’ Pxdtocor Supervisor's Name Pg./Suppl.No: Signature & Date ie [Det Roll No. on ate: ~ } ©_| Chaxactesisucs of eimee I +|Advanced opexational_efficten _-|capaniuttes of beth unk crate and distance wecrox. |G. diffusing update algozitinn cova.) _,vpdates_and updated —___ |_ information o.bour neighbors. Fasier conuexging because sx Pxtcaicuiates_esoures an d_—claes — —_ + | unique frasuse _inciuding use of —geira bie “TeanSpost CRIP) __ 2 | no + _benadcasr_heid- down timex packets _befoxe Convexging—— | pF a | Advantages _of FigRe ___+ | FI@ge has _guick covergence —____ ___-| Ravid convewage ttmesfox_changes_in the Netujonk _ropalogiy— -| flee uses Low network xefouxceg | wewy lou) sag eof niin _sesauxceg _duzing_nasmaj_opexasian }—_—— | oniy hella packets axe *wansmitted —On_A_Sra late — ob) Supervisor's Name Signature & Date Pg./Suppl.No: Roll No. prix |Date: | Discuss_OSPF Psotacol in_detaf) tard) | ‘the ogee ie o_intso-domain____ | touting pearocol basedan ink Stare our ng Jin smeiny i {At ail_ contained ___ ______|with of the boxdex of on oxeo. Se — {SPeria\ wouress colled as _arsPO bowders z.cubee —___+|Am.ag_tine_owsea. inside on. awignamaus system must ne connecied. | to the backbane. seectalaxea_caned the’ backbone” | the moutex inside the hacxbane is caljed a& backbone soubess —__ ____- | Ff pecauge of same seasons ,the connectivity heiueen O. backbone ____|and area is_pxoKen_,o vfstial it | Coeared by an _admminiatsatos ro oliau\ Continuity of tine Funcom __ ______| of the _packbone _a&_peimoaiy oxen Ps : Asea Aveo2 (ea—&}— re HK. Ger) Ga Zee) a 7 Boa oy eseo Bourdes souls Bouades Route: ed Sse tana nn cee >) + CEO) = Ase. oCBacKwone ) Fig... fesea. Supervisor's Name —_ Cy Pa.tSuppl No: Roll No. ————————— ——©_} Types of Links:- 1m _oseF a _connectron fs caued anh and type |_oF Link: - — > Point to Pant + Transient — + Stup Linn ut > wistual 1 |eaint 0 point:= 4 1 2 5 Roures Roures jt _connecrs tuo woutese thacugn -any othes hoer ox poure~r Pe | : © @ @) esa nework ith Several Webi wourese oitacned wok —_— the dato_can_entex through anyof the noutes and leave though —_j-dny souse: ~ = BS [Pas I & a se ey Supervisor's Name 205 Pa Supe: Signature & Date SSE [one Roll No, he t (x) 2 g Eiheaner @_desrgnaed Rowe “tr 18 a netwonk thar {9 connected +0 ony one xouter {The data Cackere entex the niu though this single soutesand ete : : | \eave the ga. vista — | Age ! an | exPlain_uink Gtare Rating esotacal Inder i——_Cam) > Supervisor's Name ——saapeasanemeee Signature & Date Roll No, link. stare 19.4 outing paotocol iris adynamic type SOuting —largosittana— —+ | 0'Stance_vecros souting was usedin ARP. —} Psoject Agencyt Ss pea foranrese weal gee aacern La —| unk crate souttng Leen ee Ee —+~ortents of tn1s_aigomithons axe _wtdely Used SN ESS TY VF CNY tf tle —} nenwosk_addaeas :- I The Link stare south gsc simpe and each routes has +o eesFosm } Each zoures smauid_discouen ite neignoura and abtarn there fWnen one moutex sendeo packer to each point-t0- Point ine _inen tthe woures on the oth. ex_end 18 expected to Send back | a 20. Sl] tr snouid_canstct_o packet _canraining the nerwost_addseGs———— | and_tae_deiays of ail_oergnbauz i= a ame_srqnifecan +| Srare enc event accu: 7 ro all_othes wourer ! 6] compute tne enontest path to_euemy atta 2a—Bousbee = [ughen a new ine ane Packer siasat!_com@ init 1 cnecked_agaiast——— the \icit of pacers alseady seen 4 Aon + | SE Is dupitcare at 16 _drscanded - © licnx tase sounng enpiocois use event dsiven_uedotes_xathex than, Supervisor's Name Signature & Date Roll No, ™ C2023 —os)a3| > eS Pg./Suppl.No: Date: }Expiain_stntesdomoin_and inrademain soutma pxorocol CaN] in_deran. }sotesner ts_chutded into autonomous system ;Sutonamoue_cysiem is a group of niw_and wouters vnden —__| }tne outhostty ofa cingie _adminiseraton =| Rousing anade As 12 _ moan sOustng cS j Routing penueen 6 te seemed as sntendamain_souring tr ete - aaa P eteidomat es ed i 7 = | (ee —Olstance vectos __sik ee | es a BaP Rie __ospr : handle woaing = }Onyone_intewdomain_xauting! be jomaUs. System __ | As _ As i =) O—————@ 2! Oo => [ 7 Q I 5 —_ ee I | | | | | Sp = ~ Sieg ee == a Ht I sna Ge Sela RS — ste —————— = = aaa eis] | Pg JSuppl.No: iy m3 Date: SPerVisorg re Sign, en 7 No, 7a \ a ‘Supervisor's Name : rath Date: CO ee 53 Roll No, at G6.0), | SxPtain ate message fosmat in_detar) v 5 st Pfennig sntencti. eie- among cso — USinga R1e «espanse messa: —+THS_vesy simpie pzoracol based on drstance vectou outing Caromend ion Resexved os Foros Auo": = nen eee ose : serra | — Alt o* 7 Ai o' oy —— pista —}________ fg aze a Bi freid Speafies type of mes: age" = fou mequeat and‘o- Fox sesponse™ it Freid + | Faron i = _ : —}- —16_bit_fteid_deftnes faminy_, fe 2 fTepl te valu 25 Pg /Suppl.No: Date: 95.0] of May!tune- 202u Jayawant Shikshan Prasarak Mandal's . JSPM’s Group of Institute Name of Institute \Varified & ail the entnes found correct. A- JeSuperviso’s Name, Signature & Date Roll No, (In Figures) Centre ~ Roll No. (In Words) — — Day & Date Examination 7 subject: BON Unit 5 section Course / Paper No, Medium of Answer Main Ans. Book + No. Of Suppliments Total ‘Quest No. ad 1 2 3 4 5 6 7 8 9 10 Total |Sign.of 1 r Examiner] Marks Obtained Use of coloured pencil or ink is strictly prohibited except in case of diagrams and sketches (Write on both sides and start writing on this page. ) LES PPL-ENDSEM PBS FER ! Compare Tnita Domain & Tnler Domain & iting — Protocol Toira Domain Routing Protocal J —_i} operate within single Autonomous syslem (As) — ee os_inietioy galeway protocols iil examples ~ Protocc!) ,ETGRP - I) charac tea'stics’ = =|focus on finding optimal paths within o single | nit domasn Prjositize taster Convergence & lower to Hog Ovethead within an As 2L 1 Inter Domain Routing Protocal 4 | petale_bedutcen_ol'iFerent Aulonomoussysbem Cis — ti} }480_known as Exterior Galewoy _ Protocols CEGPd i {Examples 3 — {BGP (Border Galeu oy—Prolace je —___—— - St a | ospe (open Shotlesd Poth First) ete oul formation i Supervisor's Name Te Pa./SUPpLNg, Signature & Date _ loa ~ Roll No, = —— ee ae iy) characlerishics @ = 1 2 =| focus on policy-based Youling belween _ fe —Ldifferenl Nses | —feonsider security Sealabilily & administalive G] Mer a . \ 2 a) pelictes fo cress~ domain Communication —_& + v s a men Hkey Fecal ves of OSPF thal malee lt Superior —|—-to_ RTP Faster Convemences = EY SS es pOSPF_Uses Di jksioe's_ shorles! Palh first bsp ep) -|-algoaid hmasclilowing_i Lto LOH NOG. Then RTP ss — Q) Scalability s - —_ at }OSPE_Supporls larges_plwis_lilLh ils hierarch)col —|Slauclares,Kibich organizes th enh Into —|A7ecvy, _ tal e Ndverlise men is (sn je. =}OsPP_uses lo fis_lo_ share delailed heluiork —f-lepslogy intormadian tahich of her roulers, — [improving occasacy B reliability C= Based Rourliing% = {OSPF Calcalales pads Coss _beised_on —bandvaldth — pleadi'ng.lo more. efficient. palh selection ~ mites ete gs 3 [RTP only uses hop _tounlasa_mebie_,whith can lead lo Subopll'nal_pelhs- —— ay mit | See Serta ee ‘Supervisor's Name — PgSuppl.No: Signature & Date Se eee Sox [pate: Roll No. 3) [Explain Bell man-Ford Algorithm With help of example also utile Advantages & Disadvantages of Bellman's — ford alqosithm - 8m >| the bellman: ford algotib mo Is _q shoiles! -padth algosithm that finds “the shores} Paths froma ingle source Vertex to all other vertices in a welghled gsq¢pb - unlike dipskstna's—alganithm it con handle graphs [jth hegativ ‘ghts_- : =| this mokes it useful in scenaros Where We need __| to consider both positive 8 negadive derghts - example of Bell man: Ford Algorithm _. *lConsidet the following graph With verices 1,8 ,¢,D b edges latth kLelghk ede] HI y Supervisor's Name Pa/Suppling Signature & Date es Roll No, ate Hea EA ae ae -|sel_ the dislance from a (source) 40 ifsdf aso!) Y di'si CA) = -| Sei _c %- dist Co) = minlos,o42)=2 ot eat ne eps ming .2419=3 | BSD? di'st CD) = min Coo, 315 )=2 ~]| D> c2- dist (c) = miner, g-2) =2 ue 3-| Negative Cycle check ¢ - dun another Telaxatt'on for each edge - Cie? distance change ere! egotiv eed Ze pew [eo ro _ a gam. [Pate haven fages of Bell man- Ford algorithm. be | Handles Negative plerghhs | delecks Negative Cycles |_ simpli Thy m a { es Disadvantages of Bellman = Fotd algoatthma. || Time —Comple: Hy _ | inefficient B27 Jorge gigphs | not suitable foy al! q¢aphs- Xt roy Y [fompare & Conciate the adverlisemeni used by RIP |&£ OSPF touting pvotocal - Dn aac iva [ete (wouding infasmation Prdtocal) £ OSPF | (open shored path Firsd) are beth outing pretocals lused to determine the best paths for data packets across. neluoiks - Cach ptofoce/ uses a differen! | method-ot —aduerticement which inact thelr —— _| perfotmance & efficiency = ‘.—lT-—r | Aspect [Rte Coislance verdos) |ospe (link-slole ) | Rdvertisemen| Dislonce vertos __| lini = slate Copolasy ‘ype Ceniire table) updates) -) Indvertisement| Evew 3 ecand only on topology —|fequency | Changes Supervisor's Name Signature & Date _ |PoSuppiins As Date: Roll No. SS=— 3} |Adverlisement| entire routing | _)inle shale Contend able Change serene eee | an converge nite lower Faslex time SJlealabiity — [yeni ed (1S-hap High (nd hop tount may) Jimike eos) Ja! n__me. e formal of RTPV & RI yo. Lex Dp sag RIPV| message format - Cem] Rott tery AY) 6 _Netulork addres Sobset—irn 4. Allo! apd? i= s, for sequesd 201 Fesponse - peciiiers the Iyer of msy Supervisor's Name Signature & Date Pg./Suppl.No: Roll No, eee Date: ) | version Cibyle) 7 | specifies the RTP version fo RIPV) this fied Is) a) | Resetved C2hyjes)?- Reserved foi future use | usually fos] enh tea 7 ) FRowing eniotes (family) 20 byje * = i td fie tes: e ty Sel to ahviP é] Network addres2=- 1/1 js 32 bit addres¢ : _| using fo network address QNnislance ?= Calculate the all distance - 4| RT Py2 mescage fotmat projoce | Command Ners/on : Reserve of | Fermi} 2 Rouledag 5 Netutorls qold ress . sub Set oddress soy y) next-ho S, l be Dic ce erie we ee 1) conomann of we 2.> spect typeof emsqrl tay 4 —| teques) & 2 fey vespyn Version (Jby je)? “specifies the RTP wersinn fox =~ — RIpw2 , this field 15 =2 ~ ‘Supervisor’s Name —___________ Sa ?—o , er | Date: wed (obyles)? ~ vesenved usually sel 4p 29 4) Tauthentication (ébyles option a)? — — = |4nis field Con be-used for — authentication making RIP More secure a Fae oe a ‘amily ?-(2 bytes)? = identifies the address ty ——6\|subned Mask (ubytesJ?- specifies thi Biel rpask enabling classless routing 3] Next Hop (4 byles/:= speaifies the ned hop IP address if there isa heltey rout. = 0-C a 8) Plas Ie otliges Baeble ges aE a@eL [BGP Fout!ng a > fadventage of ospr L fasl_Convergentet- ospF Isa Jink=slale prot oct) that Can quick) anges in nlw to ; lyclelecd Chi polegy aking it suitable fox dynamic enuirunmenl ¢ i 2) Pipop tree * —0sPE—usesDijiksiaa's_alyonth m — tocol culate the Shoglest path. muhich ensure jn rpding Joeps meee SH 3) [Hierarchteal Design 2= 052P allows fou | pierqrchical nui Structure us. Mag areas, kih | recluce S wuting table size 8 “nl toeiféy ee — ——d Supervisor's Name E Signature & Daeg = sty, Rall No. Ea bs Pg./Suppl.No: 4) lopen_slanderd®. being an_open_slandard, 059 F cunbe | Usecl across ei Mt 1.” en of tls tag ttin ely enki Delin ~_[Linleroperabitit Jy i —h 7/7 Disadvantages of OSPF Paotocs) Ne mplex Configuration: = OSPP's aren 4 hievarchica desig Can Make it Complex to Configure & maintain especialiy in large netuorl. i] Highe Cou B remory usage 2— aso link= Slale protocal ,osPE equi res more Sf prstessing & Memary _gesources tp store 8 Calculal —| nedworle topology - a1 Advanlages of Rap Protocel I Scalabilily + ~ BGP t's designed for larg e = écale nelworks Such_as the interme! 4h Can handle a vast no- of Toules eMficiently Jl Path vector Protocol? - B4P U path attihutes tathey —| than just hop Count, which gives hetmorle adminishato —{greoles Condtol over outing policies 4) |p licy> Based Routing ¢- B¢p allows the setiing of —|touting policies enabiling Conitel over dyaffic flow 4 —| preference foo certain path slidea fot_inder-Pomatn Routings= = —__. 1 B4p is yew well = suifed for spuding hebuiven —dflerent \ Supervisor's Name —________ iS Pg.tSUppNo Signature & Date Sa |Date: Roll No. ysiem +-+h ese_pmnciply ——= |) 1 poncifp! ey sans |_ esearch a. here are Com monly _used_epiimally | | Borel Optimally, ‘ncrple_%&= a solution S_Pareto optima) if no —} indiwisugl can be made b eller off bithou4 making) | example’ = ID_Vesoutce se —allecakion imu tne fwo—| (_food_- oe ypervisor’s Name 5 sire & Date [ParsupptNe oll NO. grit, |Date: peilman's Principle of optimality, pmnciple?='n_dynami'c_progral mrnin.g th. € pinciple _ Slaies thot an opkimal solution too psoblem Con. [1S fahspbleme ——AR Sae | is Subs paoblem ; Nigar eas Economic order Quatity CE Iprinciple* Og FOS I eee > Use ch to | detetmine-+the Optimal order guanily that minimize ee nic dac is ast MIE ecai a alenag Ae holding Cash fer= A Yefailer hlants to ordey stock thak ae holding Cast & otdenng Costs E09 calewlaty L the precise quantity to ofder so that these Costs | Qre minimized i aa | f | PEGRERTER ERLE ele X {ee ash Equilibrium _ | princ'ple * = lin_game theory Nash « ash eguill bot tun —~l_occurs when each._play per's stratergy 1S 0 pilin ql, given the slvaleg! ae other | xq mple? — Ee ene 5s Com pefitlon two Companies may choose prices where oeithey benefits fmm Changing it pmice unless th € othet does . > 8 a eee fe Signature Roll No, ee Japiiv eb adap tite Woutng Compare —_Pon=aa * oo & Non- adaptive auuting Adaptive Routin (Static ) (Dy poms Routes are pre- Con fi eer ange bared « in| red & fixed 9 real-time nwt Condit. ; ; ns mee | lability! Poot Scalability not idea) for lame nly | RTP_Manually Configured routes |

You might also like