Scribd
Upload
74 views14 pages

ACN Notes Unicast Routing Protocols

Advanced Computer Network Notes for Unicast Routing Protocols (I scheme 5th sem MSBTE)

Uploaded by

sthapana
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
74 views14 pages

ACN Notes Unicast Routing Protocols

Advanced Computer Network Notes for Unicast Routing Protocols (I scheme 5th sem MSBTE)

Uploaded by

sthapana
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/ 14
ACN (Comp. /Sem. 5/MSBTE) 3.8 __Bellma ‘ord Algorithm Let us suppose that node 1 is the “destination node and consider the problem of finding a shortest path from ‘every node to node 1, We assume that there exists at least cone path from every node to the destination, 1. To simplify the presentation, let us denote dy = if (i, is not an are of the graph. Using the convention we can assume without loss of generality that there is an are between every pair of nodes, since walks and paths ting of true network arcs are the only ones with consi less than ==, 2. A shortest walk from a given node i'to node 1, subject to constraint that the walk contains at most ‘h’ arcs and gees through node 1 only once, is referred to as shortest (s h) walk and its length is denoted by D”. Note that such a walk may not be a path, that is, it may contain repeated nodes. We will later give conditions under which this is not possible. 3. Byconvention, we take » D) = 0 forallh We will prove that D” can be generated by the iteration. oe “ {6+ 0}), foralliz1 (3.8.1) Starting from the initial conditions, D, =e forallied (382) This is the Bellman Ford algorithm illustrated in Fig. 381. oles Dine hora pa ung at moat ate Unicast & Multicast Routing Protocols, 2 2 nf oe 2 " = 4, 314 BE cn (comp. Sem SMSBTE) 6. Proposition : on 383) Consider the Bellmen-Ford aigartm Equation witeonditens OF ie 1. Then Ina conditions DY = « forall oe ed by the algorithm are equal (a) The scalars D} genera et the shorter ( tay + fora 87) D, = 0 This is called Bellman’s equation and expresses that the shortest path length from node i to 1 is the sum of the length of the arc to the node following i on the shortest path plus the shortest path length from that node to node 1. 2. From this equation it is easy to find the shortest paths {as opposed to the shortest paih lengths) if all cles not including node 1 have a positive length (as opposed to zero length). To do this, select for each i # 1, one arc (3) that attains the minimum in the equation. D= ir [d, + Dy and consider the subgraph consisting of these N- 1 ares as shown in Fig. 383, 3. To find the shortest path from any node i, start at i and follow the corresponding arcs of subgraph until node 2 's reached. Note that the same node cannot be reached twice before reaching node 1, since » cycle would be formed that (onthe basis of equation 0, =" 14, + oy) 5 would have zero length let (i in. i i) be the cycle and add the equations. Di = dy +0, 20, D, = dy,+D, Obtaining (dd, +. + dy, = 0) =, er ag #D, 4, Since the subgraph connects every nade to node 1 and has Ni 1 arcs, it must be a spanning tee. We call his subgraph the shortest path spanning tree and not that it has a special structure of having a root (node 2), with ‘every arc of the tree directed toward the root, Shortesipath a= 4 spanning tree (61378) Fig. 383 5, Using the preceding construction, it can be shown that if there are no zero (or negative) length cycles, then Bellman’s Equation (386) and (38.7) (Viewed as a system of N equations with N unknowns) has a unique solution. This fact is useful when we consider the Bellman-Ford algorithm starting from initial conditions other than & (Cf Equation (3.8.2) N, are another For a proof we suppose that O, i = 2, solution of Bellman’s Equation (3.8.6) and (2) with 0, = 0 and we show that B, are equal to the shortest path lengths D,, Let Us repeat the path construction of the preceding paragraph with B, replacing D. Then B, is the length of the corresponding path from nade i to node 1, showing that D, 2 D, To show the reverse inequality, consider -the Bellman-Ford algorithm with two different intial conditions. The first initial condition is D; = w, for i # 1 and P| = 0. in which case the true shortest path lengths D, are obtair it ined after at most N~ 1 iterations, as shown earlier, © Scanned with OKEN Scanner we ober cost path betwoan soulee node oan Fo. 382 Son let node 4A 2+8,3-+C440.5955-9F 2ares distance [Gre 8) [40108 5 (Os0 19) (Ove 106) [20860 icine sembra nants 3.9 _Path Vector Routing = idee from beth ae AS 12, AS 2, AS 56 15 20, AS 57 ASCE Sout an internet contin autonembus sens: trough As. senda path vector message te adertae ht to ate Reuter Ron ze ts routing tate ten ae ts Ignore ~ Thee knoan states me re sified nt wo categories: 1 Wallenoan manda ates 2. Watenonn icretnary ates ~The eponl nibs ase elses into two PH 1 Anepiorl vane ambute 2 Ancptonal ronson tint 3.10 _Unicast Routing Protocols : foe me urea communtation as the ication betean ove Sender ant one rece. 120 discs a te nee Mak in edminstratve areas called Aaoromess Systems which helps io hanling the fsehonge fring oemion ett, — nth fooning sets we ae going 1p dics sme Inponant routing reels 3.404 Routing : = tm tere! consist af many neers connected 2 ach ater by routes. farm passes throws (erent routr: when hom te surce 82 3.40.2 Cost or Motric : router it cennected 10 many networks i€ RAE 18 imate a decison when i receives a packet for one OF these nemorte as to wbich network snow pans TE poset 07 = The router mokes this decision on the Ba ‘Optimization. Thot msn i finds out whieh P= ‘optimum path to send the packet, Bur Now does ‘define the ters optimum ? = One ways tat a cont is asigne’ for passing throug) ‘nonwce.Tis coat salsa cae a the mete> = ta connection with finding the optimum path, retwork having a high cost is considered to be bag te have alow cart is considered to be good. — So in order te maxinize the throughput the should choose the networks (paths) having tow © wy © scanned with OKEN Scanner — rior PTS! 2 the age tere nin nen st ol et 2 sent naaatneg rant, - nae eet FE Ando |= ee 6 te ti wt | Re ig eh ‘hone pt = sede ertoal os9 1. ih a9 AS. & bas to deal wth pees a4na poe Ton: i amet cose |. = emerge a orate ei crny rene sisson or 8 cmt east Routing Protocols = ancat cng PIAS TE Shop, a4 U etre isan nt ne rode, Wow the cession in 2 reung table Ik 8 eter That wi he neo se Add e abvesied bvomaton to he ae I we Aesinaon etree in he ge aioe ey he ie with he advrned one — + wie 8 {endian Soke sentop fa ae Secrest ton eee = etc ety roving tbe ring . eecntectnenpes eee iter PCE ERG 2 le Wit in RP is aed a the ‘tut cla than oneal, 1 Sterna aes 2 Oymaierving we roel an OSPF OPEN Shoes| Iran Protocol Pay count and ery simp oo caplet ape Fst. Sta 3.122 Initiatizing the Routing Table ~ Te efemaen inthe ste rong WEEE Eras the eo PFE HM POR ig yy 4. INP the ae of tty i decded to be sre maa The eof «FR | gary PD, feet (0 16 Tati uty the moma hop | ~ When anew reread oa netwo Winns ts Snsraion eed ho te tse 87 Be] revere pres fount for any eta nie an AS ang avean | rsing aD sine tess = Sicha bie consis of he tomato ony abot he = is raudng le carn wpe eet con 5 The nex node coovn is uses to dene the | cect arachs netwoksae he conspondig Mep axtoraaty Bhatt be changed rary as | er sesressctherortowmen th pacts tobe | cout Te ret Rep Feld Wh ees te Fe hen estes ‘pate router inenety. = Hence sate restng ie ue fr sal |r ofr bor =m " outing b+ 3423 Updating the Routing Tablo: 2 Dyrumtcroaing be: ~ Te dai routing abies can get serscaly pce by wing a ami ong rete ch BSP. OSPF or 28 = Mesoutre ofa emi ating abl shown inate 3303 a Table 3301 :Format of dam ronting table S11 Routing Protocols: Roving protces ae designed othe bass ofthe amend or ae eutrg ebes - The restr in an tenet ar supposed t infer exh other sbout changes. Roving protoas combine the (wis and procedes which alow the rates to | ~ ‘sure oman sat bs ges See themselves, * We can divide the rowing proses into wo | ~ config 134.1: Dale etng protocols AP ad OF ae used 10 vps the ring lg fide an AS end EGP i Sed for Upgrading rowing tte er the outers whlch pin mute ag rope, 2 RIP (Routing Information Protocol): ‘yi outing ao show in Table 3.122. Cy eaters spared to gp such tbl th Table 332.1; Routing table = ‘Ober Information Hop count reente message These messages ae aio known a he RP abeiomens, ‘ese messages re sent by the routers or hosts. They ‘rnin 3 St of mutiple destinations within an Autonomous Sy (AS Pi an lotesor routing protocol used inside ‘Atorcmous Stem (5). ts operation Is based tee vetoing, "nthe dssance vector routing each router paredaly share it knaledge about the whole Intemet with sighs, AS ated exer Pig 2 very simple neadomdin& 3.424 RIP Updating Algorithm IP updating grit: 1 mPresponte message rece 2 ‘estan clans coms of the destination netacre arn const of tho addres ofthe nest outer to which the pact isto orate, ‘he etre iefermaon in Table 3124 may incite information th a surat masa the ine is nty wes last peated ‘he fouig 1ble is opted hen 8 RP response menagsis recived a tated ear ‘The upeting algorithm ue by RP sas allows, ‘Add one hop tothe hop cout fer each sévetes Whe i messages ar eine, each tng tbe updated wing the IP updating ago as dacused ei. 3.424 RIP Operation : RP wes is» combination of 2 vuting datas that ‘ors infomaton on te fetes route From compare to cermpuer, an update process that enables each - router to tl the outers whieh ote thefts. = RP ie fo upaing te rutng tables. The ou ert p sre The hp count colin cons he shot | fem its poe of ew, adn wpe gah tat Maer rag eee plates ae exchanged beeen the oS as top [emac rc] "ree e tanged between the neighbovrig diane te veach the desinaton and hee roster | ees ch ower to wpe dase wh te z acre ‘ves afer 30 seconds with he lp of he forest route communicate om nigh outs. = tach ruteron te Iter ep a nase sores the folowing Information for every compute in the save RP rebore = adress: The IteretPotcl adres of te compu. = Gatenay : The bet guested 2 message serait acres. = Distance: The ramber of outers between this router and the router a on send the mesg (Svc to ha Paes Rute change fag: og that iat Informa fas ehngea vied by ober overs to piste ter oum dbase {tego nero protocols ord etre prac _ Inefar roving protcel wich works inside 2 TT ee ‘destrston . wien @ scanned with OKEN Scanner 32 B soveese on 588 5 apne bY MEAS kt rege a peak ‘about is routing et ‘io ponde backward COMPatlity “io SE Tacs a ee] et 1 me ly nd ney on eg connected tot Some oa Sen ony 3 ce 9 Sheep rn = to es be 0? a gt neo rey be were pers ne (Sedae yer ss bn 3128 AP Meetge Foret: ESSE = ese ne ety ln roger ea rut arg on ‘rye egos oman vent heed on i a ee ed ‘pw cose Pe ne ig. 3122 RP menage oma ‘he summary ofthe RIP paket fort fee Busraed Fa.2121 barons ‘Command dota epee gt ‘pane wt tated Pte stan Te wpe ce rote rey Up 3 ty tr Rapowt hs. ee Mate WY pits ed ooh aon, ton ge rarg ur Version: This Feld species the RP vesion used Ths signal dierent penal erputse verre ‘ieee esha aera Eth ety WAS 39 adhe ater oe of ates beng sper Networkadeess ie eet aise Fld 5 USES Tor defining en eth desition network. InP thi ald tyes og oat an Be ved foray rotac. fun the Bot ade is onty 4 Bit long. Hence he raming sce inthe 25 lds led vith ag, 6 olstanee: The fed Ines the suber of hope (router te have been tava in the tp tothe destination. Thy ‘abies bteeen 1 an 15 for ail ote, or 18 orp avec. 3.13 Request and Response Messages (RIP) RP hos to pes of messages namely Request and Response Mesa 3.43.1 Request Message he request message is created in the following tno a {it ceated bya router wie has just come 2 ust come vp, anced bby a router which has some time Ira reques *#9¢, infomation about some spade erties oral the ents i asked Fo. 323100) shons te format of the request mesiogt for one aa 38330 shows the frat af gut ‘mesiage for ail hs eee Se atone SF ncn comp Sen. sores = a hea ora ais (63109) Format of suet menage uP forone | 2 Cont ese Tomar Rape e210 @) Formato equet message IP fora 9.43.2 Response Message : = evporse message in RIP an be ene othe flowing monpes: 1, Soleeed reponse or 2. Unsokited respon, —Asficited response the one whichis sent sly a arswet 10 9 request message, It cares with the Intoreaton about the westinaton spactied in the request mesage = Anunsolited response, snot sent ery once bu it ser pricey (every 30 seconde of sl when tte any change in the reting ble. Ts respone ease ‘ale ste update packet, 3.43.3 Timers in RIP: =P Uses hoe teen timare a flows for supporting ‘septions 1. Te periodic timer to cont the process of sending messoges, 2. The expzation timer i sed for governing the validity of route 3. The garbage collection timer is used for 2everting the fale oF route 1. Periodic Tier: The tak of the period ter is to contrl the advertising ofthe update messoges regula, As per protocol pecfeton. hs ime should be eto 20 se, but prctaly is set randomly between 25 and 35 see. Each router hae one etod te. ‘Wis ert coun down om the et abe 2 40 35 me) an sends an pate menage wh 2520 to 4 random value Beineen 25 end 36 ~The segortiy of exiason te io govern = Winey route gies out the update nlormation bout ute, tevin of he Svar eto 182 sect 3 mines, This tne i reset eventing anew update for hat route ' teceved which ander nomial werting ‘ondtons happen aor ery 304. = But dueto rome problem onthe. new Update for tht route i nok rece within 28D st then that out considered exe and the yop count of hat fou i set 1036, This & an Ineation thatthe destinon ts not encae = Tere ia separate eatin tier french route Garboge Collection Tine = The router doesnot purge a pan route tom lis table even when the information about that inal, tnstesd the router continues to adverts that route by increaag itt etic valu 16 (estiation not eachable). rete becomes — AC the same tin, the router sts arate timer called garbage collection timer to 120 ec, for this route ~ As soon a6 this count goss to 28, hat route ‘urged fom the rout able, Due ti ters the neighbours become avarethat‘a parila rot has becomelneat before ks purging. 4. Disedvantages of RiPV4 = = Some of the Inponam cistantages of the ‘gral RP version Le Rv ae a flows: 1. PAL only understands the shoes ute © 2 ‘esinaion, whichis baked on tiple count of umber of routerReps. 2. independ on ether routers fr computed routing panes @ scanned with OKEN Scanner 6 eohe one ten and ATHENS 3.93.4 RIP Version 2: = be enter 1, Fos ed sere roar) evesne some of Soncorings A yerson lbs evr ad conte f cuurber OSPF newest The rodied RP clad AP verso 2 roel = Vesen 2 i bcs compute man weson 22 coats lo ta aati fhe version 2 SE [> ween 2mperertd te fli eat: st with 28 = Autentton by mean of plete pasword = Mutcaing esd to afow for vabidength tne mats tebe nplemere Rove ap provide a metodo separing AP ees from enenslylesmed ates ~ Cemacibity sito allow fr iaropenity with serio Lute Nore that he sme frais ed fot IMM and RV? ent Compl te frat roving tbe a rede A ‘ing FUP pretecs! forte owing near. Assure cost ot hop court (e-som Fig P2183 2 Subnet mask: Ts ld i 4 byte ong and it ent 3 Next hep ede a Next Hop Woxt router) tesage rat 12) vemaage oral D3 SNOW AB 3, ez ig. 3122 Message format of NZ ew Flds = There ae sont new fel In the message format ps2 compared to that in RIV. They ar ftom 1 Rovteug 2 Subreemask 5. Nethop adres. Leute tag: This new Seld is useful in coma leoraion sch as atoremous system mumbet Li thse we can enable RP to race information fe aninerdomainpretoa the subret mart x prefix Tis shows thatthe dese ‘ressng and CIDR is supported by the RIPV2. is new field contains the add of the neit hop. This feature is useful in a stunt ‘hee the same network is shared by two autonamal ‘tems for ample a backbone. With the help of ‘ed, the message can define a router to which Hf ‘Pockets t0 Be sent next. Note that this router con PH ofthe same AS. or some other AS. Tate = The most important lisence benwten the two ‘esions KI i that IBA ean suport ony ne ‘dsl séresng wheres REN? cn ato suse cls adeesig, = DWE 10 the acon fs cae subnet mas i i posible to dene 2 nese pris length in Rina Hence dassessaddesng becomes posi, ‘mentation = thentaon Is salty mente then by fs? nse He protection ef meiage aginst unto ted serisement = For authentication isnot neeian to ae any ea ell 10 the packet Insend the authenication tavoratonis done a the ex enuy of he nessa, = The voi of FFF is entered inthe famty eld wien inicate tha he ety i 90th rong infomation but the authentication information, as shown in Fig 3033 “=the authentication eld Ia Fig. 383 ie uted for eliing the authentication protocol and the newt eld cara the acual authentation ea ‘Conrana [Vases [Basan ‘cfeE | Aafonieaton ses. (21 Fig 3.13.3 Authenieation Multastng ~ fr RIVI broxeaning Is used for sending EP message 10 all the neighbours Due 10 broadeasing of the -essge all the routers as wells hosts connected to the network would receive the RIP message Putin RINE anal round multeast adress is used to end the RIP messages ony Yo the RIP routers on the Eneapsuiation: ‘The UDP i used to encapslbe the FIP messages. That ‘means REP message is insened Ino the UDP user There ofan RP mesg wach ca nate Ce leagh of the wesage. The feng tas to be ‘erin frm he UDP packet. The wal knw POR has been angted ob in ute, 3.43.5 Problems in RIP: {UP te mos sed ner iti routing proto 1s based on the dance vector roving pn, IP has many tains. Some lhe te tia: aden eertcon Eye 9 At mete COUN rouwer hops t he aes For RP nity defined 23515 which conesponds 0 1S tags. Mo diect subnet support: BP came ints exctance rte subrating an has no tet spon for We can wie Hin the annem emitonment ith some 2 andldth consumptive: Ax BP router wl bresdcast lise of peters and ubrets ican each after every 30 seconds. Ths wil consume «lige amount of bandit 4. Ditfcat 10 alagnos fault: Ute any other dance vector routing protocols RIP ao eco dbus, 5. Weak security: RP éoes not have any secuty fete fits on Looping problem : Being based on ditance veto nce the RIP faces the looping (outing lop, problem Remedies: Some ofthe above mentioned problems are overcome ‘with 72 while the loeping preblem can be overcome by sing itera ink state rxsng protacal ike OSPF ora newa, istance vector outing poteol he BCP, 3.44_OSPF = The long form of OSPF is Open Shortest Path Fis protec. = This another ner reusing protocel Rs ar inredorsin protocol and it ered onthe fink stat touring. Fer handing the voting eficety end In eatagam, timely manne, the CSPF dudes an AS. rt areas. = v @ scanned with OKEN Scanner ‘Ares Kantenton: leentfeaton of the backbone & ze. An avtonomous _yremieas shown fig, 334310) Disadvanages ofthe RIP protocol: the source and destnaion retwos Due to. ths =e connect besnen 2 backbone and 2998 op sre eta Wl yg WE son co non SD eee awe sein cooece ‘Arn torr outers: routes ince ed hese a seek! ope of om interson orders ofan en Tage urs surmice about te read seit eet Becrtene = Appel a ine an asonaens ste’ ae tetaore At the amar aise an AS. show) connected tothe scone, Se tcbone ic he pray ara and her ars 2 cara seedy sea. — Te rovers insie the bacbone se cae 95 te tackbone outers. But backbone eter ean ho noe pa area border oe broken dut to some problem then the arisen sould reste virtual fink Bere ese 9 te eckbone can conte te funetion as prime fuch en has an atea Heniicasen The ea The macinum distance Between ary two son he nee messed in router hop) i 5 hops | cesinaton (two 1D) whose hop count 16 6 mores constered tbe noneschale ‘The cot toa stration network i messed in terms of rumber of hops AP determines 8 ove bed on& hop cunt that does rot take ino conden any ‘other ites other than the murbe of outers between emacs Lee Ce svete ale oF 2PTOACEDSE tran ta ae ore more ees Wan S32 byte, more Sn ois ret TAP update canta over 35 dpe worse se, © FP UP Pepe can ad eS, OP. sav des rtsurgen VSM. iat OSPF cou do): pos un be S8, me fot stecestputvSrt routing protec q, devaped and weed in the ARPAMET packet suit tne ah th way back a 2978. TS FLERE ve vias devtoped and used in many other uty protocol ypes ard peteypes One of hore is OS, ‘ose proves ston to most of the drawbads Ur Wing OSPF we can scale up the rewy rcitecre wll bajend the maximum 16 ha nopene by tate thn exchanging node and netwevk eachaiy ‘formaion, O59 rowers xchange nk sam formation, Twcugh the Ink ate Information, each ret ‘ainsi is enn copy of the network tosolgy =" ths Fokstte cause, itis posible to fre OY stones routing gat For thote of you that are fair withthe O3t ews ‘here many ofthe Feawses supported by OSPT ‘iia the O15 retingprotocc. ‘The crn versions of O59F ae actualy derived 6 some ol theca versions ofthe 1-1 pateéOl eas SF sen Cong som smisere, 3.144 Features of OSPF: ‘ype af serie outing: eis pote congue eifernt exter to support | ferent ypes of Senice requirements. Fer expe, fone router Qn be conigured for RighstweughpUt Iu the other ont is contoured! to support minimal (ive delay for same ther apsaton tote balancing: ‘nen mutipe route re aaa trafe can be evey etibuted ove the route. The would ably result ina righernatworkeficiency. Subdivelon of autonomous ayes = eis powible to further did the sytem ino logical ‘reas. Ths would improve the management of lege buonemau ystems, Security: The daw exchanges in OSPF ore autbertcated Inadvertent or malicious tanamissons from foreign Toto nodes ae carded. Only those hess intended for the routing network ae inhi. The network ist vulnerable to the thet of having sovtag tables orrpted by faulty route information, Host: SF supports specie. network and subnetwrk resing ‘Spec features are provided to support LAN ‘environments: Anough the reatonshps between routers are Maintained ona logical fink basis fink sate wonamissons ate minimized by the architecture Designated gateways are responsible for vansmittng ‘he ink te iformation fora nlrb thle focal aes (OSPF is an open speciation “The OSOF has been publshed as an RFC and not Geined a4 ¢ defacto Rand such a8 RP. Theelore Anyone can implemest the stds, without paring royals, Thr has been dove to ercawage many endor to ute a the users ae not acted ino 2 singe vendor’ eurpment. ser (OSPF divides the network nto groups, caled an are ‘he epslegy ofan aeais not known tothe rst of th Autonomous Sytem. Thi teeique minimizes th routing wate required for the pretecok Wham tip areas are usec each area has iis own copy of th topciooial daratase = Several conceis have Been incorpraed in th (O5PF algorithm. The RP treated an autonomou ‘item 26 2 menothic colecton of reues 89 bres, bot OSPF invoduces the concept of arent “The concept f hiding the rowing informatio: within 2 OSPF rouing domain terme _autonamous system has ako been ntadued = er dividing an avonomous system nto colton of lial areas, the OSFF can spp) Geert ype of roving nodes (outer) such + internal routers tea Border routes, backbon routers and Autonomous Sistem (AS) boundar routers (See Fig 31430). ~The prctcale ied 10 support OSPF route Inde dtabone bronceast packets and Tink sts ange broneats, A “Hello protcel is used Getet changes in the axaabity of aace akin @ scanned with OKEN Scanner Tqherelations? OT en router hac kao Wroicep sen wt ergy 3 EE by cma nt, But ANE array we nighbou Sut HS tape ans Hee poem | 08 nd nonsesc ao ewe rare He Ino = te ot aed fect BO and tals the seer eats wee oT SEE | ame cen 27d 94806 the contig divine wen 8 be used Tis ‘ Sar pee te ca fig 31440) shold is kom “ vot The designated router isn pve ih oe | tse crn ee can nn mie 009 pr oa. Hand gel tase once pe LN eign oe 7 344.3 Types of Links: tenes — the 08 pte eile cost sa tek OSPF etna er pena PORTE on vansen st Sk and we ts 2 Show inp 32030 Tyoeatts —T73 rorempont ensen otal cei. 224ml 1. Pont Ap pb a ad kere Beeler noone oy she one ponte Svat Stomencomecel yotcton ee Schram ae so Stine maton Te ie tere toy Skee myo wen Ot tet tere oe of Be a ra ‘generally the same, or Fee ee Aaa (P3162: Pot pit tk 2 Transeet ink: is neve hing iy rosters atcha ta show n Fig 3.163. Ls a moe se WA of ARC ae he ters. ch ru eights ‘Me nt O OF @ aan @> @: (6300 Fi. 3.243: Taso ink ue he aii aengement of Fig. 3244p as ony one neighbour Le. the reves tas ony eae a, tue rth nomever the Cesiraed os rie in fica reitbous, © TS ® 3, °® (une rpresenttion(b) Realistic representatin (ean Fig. 2.244 = The tealtie arangerent ceduces the mantel _zoeuncavent that ech outer has to make ts ‘uber as erpared tothe unrealistic arrangement = Not that thee 2 metic from each rede esgnied route and ther fe 00. metic fm fe esignted overt anyother rode 2. Astubtok: ~ Asti inks anework that i connected ta one rater asshownin ig 3245. ower oven Tiers esis ml (Sa meteork (ay Representation (Gong 3245. Reuben of Fg. 32451)» spel cst \Wanstot network, The dat packets use the same kt] ‘tere men Tistatonante , bit represented by sing router vty eclacng the network by 8 der reer 9 rete aM I 3145), he Ek cored rate designated router i ui . 0 tr en ng jon at mr | ts ema in cme va SATE te a The sdminstation ean cee virtual nk between {wo reuters, when 3 ink betasen them gets broken on = Such virus coud Be ver 8 lange path wich rout go through many outs, 3.145 Graphical Representation : = tet us nom cause about representing an AS. graphically Consider Fig, 3266) whens 9 sma AS. vith mul network ape outer, = There are some point to point neon, and tension a wa stub netwonts. = The symbols such, a5 Ny and Ny are used for the Ironient and sub networks. No identy should be sstachad tothe point to point netwerks = The graphical representation of the AS. as seen by (OSPF nt been shown nig. 3.1468, 3.148 Link State Advertisements (LSAs) = = ach ently ina nebo cstibutes the Link State ‘Advertisment (USA). An SA announces the stats of inks. = _iferent types of As depending on the typeof enty see shown in ig, 2147. METAS sea, sya (9509247 ype Router in The ovr prec ost rs averiseren ot ts (Wn tea The advent dss the tlecns Sales of Te routers eke to the aren TH soveriserect ao nda the typeof he sve whether isan ats border roster ean AS bound Network Links 1 network Fo advertisement & produced fore Transit mbi-scess cetork, Tis averse produced by the designated router fer the ta etwor It deszries a the OSPF roster fl aac tothe designated router. Summary Links Surrmary ink advertisment dscbe 2 single rou 2 desinatin. The destnrons desenbec ae eters ‘the area but intra wth Autonomeus System So condensing of rowing infomation occurs when cet ‘these summuy nk sate aderemen. (0) Grape epreetnion 62 Fig. 2.246; AS and grape representation @ scanned with OKEN Scanner 3.447 OSPF Packet TYPES: These ae Be Tassos 8 eserbe oes ve gps of S97 pass oe a8 sown rps” Sake ae ne see song. ALLA: OSPF pace se ort pretes nine dicey on ard wes the sig rember 9, Ech OSFF packet eons of 27 (OS bene Sow by the boa of & peer pocteype OSPF packets ed tbe set spec (aie porbrnden mcs ences “Tr OSPF coronene offing 52908 eho ar dacorre by ener of seg “The Hake metane and deste oes a decd in mabaces newer = Ascent roe ae ietlied ond ek ate eaters we ptr =k Ste Aertoemens SA) ae exchanged song he acer ruts 502 to mainte topakgial dxabsses ard ako to adree inet nd rae re. Te eit the Inloreaion i he cabs to gerrate routing [IOS paces have he ame ormen eater whieh {sas shonin Fig 3168 This ener ise fr a he fhe packet pes 0575, PF common header ase enn0 Fs seu OSPF ck AGE 2 oy, version: re core fe SF roel sae sof ha it el ols US ABOU he vei ny version 2 tie: “pis eit Bl define the ype of Ue packet. There ae Toe of Os packess and they cane by ype fel rom 105, ssesing cet te Message og “pus it fd defines th length ofthe tral mesg wesc cues the ade ab wlth boo Source eer adress ‘is 32. eld defies headers ofthe route ut sends te paket re enieation ‘Wis 2b Feld defines the area wihin which ating takes lc, Checksum ‘Thi Fld isued or rer detection onthe enti PI ‘excieg the avthetation type and autenicaton #9 fs ‘Autbanteaton ype: "Wis 6b eld defines he authentication method wt 5 Bs a Eth tine, wo types of autenition # ford 80 inthis fe shows that no avtnenticton ‘ing sed at 91 vepisens the use of passwort uthenation WF An como. rSem saanre oem nen Rang ‘onhenebor ris bit ld the act a of he ntneteion hun the ur, when mere autertcaon ype eal eet th fel il contin th ead he ocean caledstion or roi the ahentieton te, hs ee ea Tehves I the type H 1, his Feld caries an eh character paswens 45.148 Link Stato Update Packet: the heart of OSPF operation H the Unk sate updste tet se let ws dns 19 B.A oer wes chet tae he states of ks Fig, 21410 shows the gener! format ofthe tn sate update packet | csPreonmocrencer | Beye pe Taare ok laa RIESE Ln ate arcane Anema — catty fig 3.3430 Format of fink atte update packet ach updote packet may contin any diferent LSAs Fig 31411 shows the qaneral head whch s commen oat fue types of 54s 3448 Goneral LSA Header : ~ Mt crrnion 4 tate torts ase, ‘mati eh a 2 erg: “ 6 Tahoe He toon tinere toe core yn one pe neaes oe ea se me ne Tlag: ~ Tisinhos 1Oatig 91 «1 tense poster ones onenne Unk staat 1s tld sed etn he Aye Te fe diteren pees aaraemens toe 1 Roser 2 Hes rk 2 Surman exo eo 4 Summary ink to AS Boot roe 5. Berane Link atate10 The contents of his els are decedent one fas show Table 3242 Yeble342 unk ‘Unk state 1. | Roar tnk | aderess ofroter TP adtess of designated 2. | Remon 3 | Summary tk to | Adress afte eter Trisaioage | Rosened [e[ Yuan oe] eto Tink in | Summary tk to | IP adeess of AS boundary Ravenna usr AS bexnday | roxter. Tn ate sun na outer Trkraiechockem [tena _[eteraline | Adesso era Newark 6. Advertsing router: (eeu Fig, 32421 :1SA genera ead Les discuss various feds of SA genera header, 1. Link sat age ~ This fl is wet in icatng the tie Gn second) ‘dapse from te instant of generation of hit message, = This ype of message travels fom router to router hich is cae a Roodng, > Acthe instant of eeation ofthis message by router, We vake of his elds “The field contains the IP address ofthe rovter which vertices thi message Link state sequence number: “Thi ald contain a sequence number that asigned te each ink state update message Lune stata checkaurn ‘The contents ofthe not he usa checksum But the value of his Geld & eaeuated on o spec ype SH hate @ scanned with OKEN Scanner 9 bangin: aaaess ot id nde erg te eg aE MEET gg Tamsert | Head ever pct nes ewok aes To 3.1410, Router Link LSA Tw {| {ne = nse Le isan enced ty nasi | Teaco |B ay Toe ake se yore ert =O promo ost a inks ad a be same 8 | 3 ik sive 246tons info este ney rote tne as oem shomn ng S022 seman Fig, 2142: Roer Bk Tero Ine Skis ed acvering a en ct 34411 Router Link Packet : Fg 22423 stows me fort of ror Ek packet Let ss daa vars erelEe ead ew Poa Te ease] Timer fea (09 Fig. 22443: Fomat fra SA 1. nko: The contents Fld wre pendent onthe tye of Ik Oifeent Une werfeaters on He bss of tok ‘ype ae a shown n Table 3142, ne coe f i eld sce ine Terefre the conten of th tag eeerson ete ik as shown Table 3243 3 Une pe: sso in Table 3242, OSPF dens four Yes ots onthe bao the pe of metWork, the ou crowed. 4 Namba of pes of service (708) re cons of ths fil are Wied for doing the rember ofp of cance that ae announced for enh ie Mavic forT0s0: ‘De dt ype of sence is TOS 0. This eld suse er eigen for he etal seis & Ts: Te contin ths eld are ued for defring the bt 1 Mette = ‘The comers of tis Fld are used for dein the etic fr conesponcing TOS 3.4612 Network Link LSA : ~The lak of a network ae defined by 9 network Sk {SA A cegrated rover dsvbutes ths type of SE Pikes on etal of te warsint network, This pat [eviedfesnsounement of evitence of athe fue? terete wv ou (2200 lg. 2.14.14; Mor inte fig, 31415 hows the fomat of neck ek advertement pati fg. 21618 Network advertement format, he trporant fis ofthe nebork lnk USA ae 35 giensow 4. Network ask “te contents of he fel are wed for cating the oer se 2, Anche router: The contents of thi ld ave ured for defining the ares of ll he ached routers. This fed is a apes el 3.14.13 Summary Link to Notwork LSA : Irede an area, the router fk and etark Fok ‘tverterents provide ample infomation about the router ks and network rks to 8 route = Butts infrmaron not enough tn akon this & router is 0 supposed Yo tnow about the ozeerk futede sare, This information is paved by the border routers = An are boner router receives outer and network In advertiements and create a routing tate fer ech Hea because it is smataneourly ative In more than Fig 31836 shows the format ofthe summary ink t2 network SA = Mergent tn sweatin he ei of a we retin he 1 nc bien Re ert ton a ae wad tenn pc ete Te cons of ts Bld a wad fee deen te 2.14.14 Summary Link to AS Boundary Router LSA. ‘The provius averneent wat Gig ote ey router brow the Con 10 teach 3h te nets Ca betng tan as. utwhat 3 routeinsse a AS warts send packet coutice the AS? I ore to accompli t,t ror must How the ‘path route to an autonome Bouncy oe. Tis nfrmotion i rowed by the summary nk 0 AS ‘boundary outer “he area boundary routers wil ingly food tle ares with this infomation This packet coming the Information about he route tan AS bundy route Fg, 2147 shows the format for summary ik 19 AS Doundary router LSA. ts primary ebecive of this pocket 6 to define the network to wich the AS boundary route as been atached The feds in this format are sme a5 those in the summay Ink tate network adveriemen: meSAgE, CSPFcararen Fence ‘ttqes T9904 LEA pwnerlPastae sotyen Tyee 3 ewok rane Aegon {f 620 Fig, 32427 : Summary nk 19 AS boundary router USA @ scanned with OKEN Scanner 34415 External Link LSA ee creo an dS ch rater eu seit ate rdy mee information isnot sufcent DECISE Pasa tan ateau mei twit Ronen wr Tac e pen vec Dictate nets DOTS y ase oe SSRIS saa amcor sense ic OI aaos tome mabe = acto en CNS crn ne Seoymaeononsoesooa asst acd Tea penairace Boyes Type 7] ees Foor eing Reso (62 Fg 3028: SA There aro fla 5 1. Fervaraingaseess = The corns of ti Fld dete the adn of Ferri rne wich i id by te AS body ‘te Ts fomarsing oct may pov ob abet terming derraton 2. Eatamatroae tg: Tis Fld contr we wed by eter pots exept 3.4448 Other Packets : = Tere ae four eter paket pe in OS They ae ster for he pean cepa een eye, rayare 2 ("95 1 Heaomessge Fgabucedesepten meses Funke nbrnledgement eae caren ane tiede done ard minain nh neieiacon 2 oe On i ri omaten, vit ABBDSIC. SeCietig ages sun sate Rens: Aner the databte descipiy sree Unk se requt BHCkIS AT SEM 2 the Mentor in order 10 rauest f° CDHE Uk st Un Sate Update: 8 wed for Cansmisslon oft save aderbseants bomen routes. Ths oul be in repens ta ink at request packet oF to fod 3 cient net esate averserent Unk Sate Acnowledoment: 1 sed to make be ootrg of rk sat aGveriserents elable. Ech ink ste edetseerresved i exltly acknowedged 3.1417 Encapsulation : = ThetP daagem acs 3 cain for the OSPF packet. ‘Thar ens the OSPF packet i encapslated inthe eager, ~ An OSPF packet caer wih the acknowledgement smecarismf aw and ener eel. Tvs OSPF doe a Feed 2 warspet yer protocol for prowson of thee series. 314.48 Comparison between RIP and OSPF: FonetovFenun | rip | papa | Ose Hancortranoer Ineo rose laec v7a5 IRec 2178 Weta eriocat Ino [ovo eae, "etalon count Hop aut [res ose ‘om sutserey wean Pe con § nue roving Patel FunctonFeatre [rt | mv 348.1 Typos of Autonomous Systems {pterator—[Pewwina tovewwalimaite || - warren Jeo. (rr [ewaera|| ~ eM sendy scons to astrmest tene so cond 0 second leery 29 ‘dea soon eae, (rte, || ~ T8168 cregaes of aanomove sams ave #5 owen feo ee |] fone acre Prensa = 2 Subas 2 tadtnores AS 3, Tans, fe soo foo eel poe Jeccards [seconds |aecenes || 1. subas feat ft ae = Rub 256 tat ype of AS in tas ony ane a ‘encanto ante AS The Roms the Sah roc toss send and teehe da tae wo te hore rn belonging te oer AS. furore ieseoe [uonieton = 81k note that dit aie nt pis ough 3 vara @ ia stub AS. in oer words the tafe an be Fcamergerce timo [vaate Varied [twa lesseden Joesezen_[sctey» thera source ors Inmeerct Juameerst e83¢ |! 5 nomad as outer x fours fren loa \aowe = ANAS which has more shan one connection to ran _verad ‘ther AS nn at muted AS. Bt Invereing to note that a mashored AS stl roowiongs |e ven vue fxtciienoe con sure or iro awe eee For aos nether 5, pore to send fst: fe fre rw Pade tao fom ar an one lapeneting jem ate Ie b But des rot alow he trnaent ae ise ot Saver a ee \ros ~ Tata tmnt entort ata tate coming om one AS to jut pass Jwatosmwing [vs _[No_]vas ‘trough tothe ther AS Inemoreaametr|s5hope | sShons _[eseas . eee || Trananas: lemyous [ves [ves Ine = ANAS whichis 2 mutnomed AS bt also allows he ransent data tfc aed as tant AS, I5_Border Gateway Protocol (BGP) 3.182 CIDR: CSE = Actas interdmsinaddrenng it edn GP. Tat ~ SGP is an eer routing protcol fe a unkast tro prora. B uie Imeans BGP mies se of the pre (Ae dicted ‘o¥ing prac is wed forthe itemsteromeus | Caterer detng dernaton ates stem routing routing among diferent ASE. ot 3.45.3 Path Attriputes : It ma inodced in 2989 and as four von. BP ‘ reraton takes place on the bass of the rautng | ~ The path fora deitnaon adress canbe presented os ‘ethad ced path veto outa. altoftiroutes We get some information rom ich ~ This incites used bacaute the dance vector eee eee este ap of Wi kt ot ‘outing andink ate outing dont rove tobe much | ~ Me fecena fower kes he ep of tis tubes fr ming # better decion when ‘tbl forieteratonomou ster outing spoken, ee SE rlerautonomovs sen exting | @ scanned with OKEN Scanner Saba Types of Atibutes = pea nocanpl e 2 Renken ae 2 tesa abe _ area meee ee ee pot OFF seeing ee rene trees ne iter cl 0 ee nme een wrecer ce nun mean ne hich nope deer fu onthe ter ard 2 we tnows Gui ceed ate one whl ust be eon eve bt ree ot bended in vey a espe eco ao subd topo atrates in Cates a8: wansve an nonteanstve eps iseenany au ae, We my deine the cto! vansve arte a he cere bag be psd to met ote tht {00P Hon 1! exag feo nodes which 8 rae bene J ilo ipaeshown in Fg 36, eerie raiser sown Fig 286 were apap apason ~~ LBGP ene ne sein (cteaction) shown beta inte ag tach essen stew Beg pare peter rites 268, wl xcarge ay Tran wih kc 1 HEM OFT the Ep con = nig 36 rere ote calle oration fom the ct ae aging a ek ont AS. ung the bcp veajow ronn by doe ne Fg. 3 161 346.2 Typos of Messages : ues tour dierent ype of esse, shoe Siciemonmewey sss wnt gannagrtane rept ie reg Pee aren ‘isis 2 32 Fld conte an sthertaton vale that he mesige reer cn prec Lanai is #16 Bi Feld which oats the tl eth of Fermersge in be Toe ve of he length Bld mast ‘peween 120d 4096. ype: “ype an Bi eld wih spectes the message wpe thone ofthe felling: = Open = Update = Notfeaion Keep-alive 3.4164 Open Message: his eninge Is used by 0 outer running BGP to create vqapibourheed relaionsip. To do 30 the router oars» TCP connection with a neighbor router and sevisan open message 10 1th neighbor roster eintetstd thon sponds by Jencig 9 Keepalve mortage Which Is an Wcaion that te rebtonsip between these mo neighbor ters as neon estaited She ros rectes ther eepave ot update Iesge rom te eer aso oes a cee a ofthe mesiage ing tne ol ine. hen he thee route iors tobe deed, A. BaP idemiter: he coments of is yn on el eis the owt whic ase te open mtge 1 Optton ena "Wis one yt ft ee fr dering the enh of he ‘etal option parameter. The wie thst srt 4. Option paramere “isa variable length eld wich conn te option porareters. The nonsera wie of eon parameter length fet an rdieaton tht thee ar some ton ppuameters Authentation is the erly opin pavieler define fa. 3.46.5 Tho Update Message : Ths is the most Important message in BSP, THe mastage is wsed by the outers forthe flowing two pore thre “= Siva an epins!norzantive attbute i defined ataiena “anemia Fora: purposes: foe ee hich mar be cre fe eng ‘aage” “monseae — 216A hows ne fomatol he pen mestge Ly der to witht » prev atvetied amano esiaton - tee aetna esi 1362: BoP mesge pe aera Wye io 32 et res — 2% In order to announce a route to 8 new so noses searamirom ae ae = fr 80? session, the ro routes sng 86? excarat | _ A EGP message pes use te Basie packet rade OP idonafor The SGP can withdraw more than 90m previously ‘tay norton een tan souwcon dee |” Gpea coi oa" sekenon, messes hl == advertised desinton but na single vp mesa08, tmaon ws naan wh hs ben wetind | © Ceuta: entra aay os oe chia itcan deere lone new destin ieee om new cE | mater velar = Fa, 4365 shows tne oa forthe upd mesg = tee to eve eae ston te BGP ues | ~ "E-3282 Mites te Bs ted in he BG? Hoke (6220 Fi 3164; Format ofepen mecage woe re severe. Fach AGP pace contains a header use pte? Thelnponat es ofthe open mestage a3 flew i Cnt aaa] = espe o sn comcion pur tun aca] PUY 0 Hay te fenton afte packet # | 1. Veron imeem rae] z ‘oeger time entl something unusual happens. question. The (ianable long) contents of hi-def he version i = Therefore the 8GP sessions ae caled as the se 1 ‘OFBGP. The current version of BGP 4 — semparen concn. 2 Fanaa hoa Ny autonomous system: Tah at 23.46: External and intemal BGP : ied | Bae ‘arom iota ipo The contents ofthis 2-bjte (16 «Bi fel ae wed to {ease hoa E, jaevotieyoweicg an tne? imo ‘ne te atononous ste ret Cee menneen oe 1. External 05° 860 essen, (©2127 F9. 3.16.3 BGP packet header format Wotd tine = ‘ees rch) 2 teal 86 220m ssn tee npn Fe ss ds in the chet header ‘The contents of th * maximum ‘ten ‘nie oc pact bese Pets ofthis ye Fld sec the ‘gam ig G5: torme of wpe menage sount fine in secands tat co lige unt one — a e Went © scanned with OKEN Scanner ACN (Comp. ‘Sem. SMSBTED ‘The important fields in the update message are as (lows 1L._Unfeasibte route length : Ths 2-byte long field is used for defining the length of the next field, “The contents ofthis variable length Withdrawn routes advertised routes field gives the lst of al the previously which should be deleted. Path attribute length: The contents ofthis 2-byte long field defines the length ofthe nex! Fld. Path attributes : The contents of this field ar defining the ateibutes of the path (route) whose reachability is announced in this update message Network layer reachability Information ; The contents of this variable length field, are used for defining the network which is actually advertised in this update message. BGPA supports classless addressing and CIDR. used for 3.16.6 Keepalive Message : ‘Te keepalive messages are regularly exchanged by all the routers running the BGP protocc, to tell each other that they are alive. The format of keepalive message is as shown in Fig. 3.16.6 which shows that it consists of only the ‘common header. Common header 1abytes Typo: (6-210) Fig. 3.16.6 : Format of keepalive message 3.46.7 Notification Mossage : ~ A router sends the notification message whenever it detects an error condition or when 3 router wants to terminate the connection. Fig. 3.167 shows the format of the keepalive message. ‘Common header sobyes Type: Error subcode Error data (Wariable fangth) (6-219) Fig. 3.16.7 : Notification message The notification message has the following important fields: 1. Error code # The contents of this 1-byte field are used for defining the category of error. 3, Error dat giving more 3.16. 3.16.9 How doe! Error sube used to further defi rigs 8 Muleast Routing Protec, ht The contents of ‘NS L-byre fy ve the type of error in each Catage " the contents cf this Fill can be usa diagnostic information about the err, ie! 8 Encapsulation ge messages are encapsulated I9 TCP segment, using the wel known por: 178. The €FTor Control any ow contrel are therefore not needed, er opening 2 76P connection the UPSDYE, keeping rnd naincation massages are XCMANGED yng notification message is sent. s BGP Solve the Count to Infinity Problem ? ‘The 8G? is basically a distance vector protocol. But ij very much different from the most ether Protocols sup as RP. = Instead of maintaining just the cast of each destination ‘each BGP router keeps track of the path used. Similarly instead of periodically giving each neighbour ated cost to each possible destination, each its esti BGP router tells its neighbour the exact path thet iti: using Fig. 3168 shows a set of BGP routers and Table 3161 shows the information that router F receives from is neighbours about “D”, BGP can solve the count to infinity problem easily. This can be expleined 2 follows : Suppose that the router + in Fig, 3.16.8 crashes, or if the line FG becomes fo4hy, then router F receives routes from the remaining that neighbours ie. 8, Land £. ac A D e H td (512) Flg. 3.16.8: Aset of BGP router ceo As shown in Table 3.16.1, these routes are BCD. and EFGCD. © Scanned with OKEN Scanner

You might also like