Routing Information Protocol 2

8/17/2019 Routing Information Protocol 2

1/30

Routing Information Protocol 2Routing Information Protocol 2 (RIP2) (RIP2)

Study_Group_208Study_Group_208

Shrotri MeghanaShrotri Meghana Dhar parnaDhar parna

!ar"ar Priyan"a!ar"ar Priyan"aDulam #a$undharaDulam #a$undhara

Mondedula %alyaniMondedula %alyani


2/30

gendagenda

RIP &'er'ie *i$tory and #er$ion$RIP &'er'ie *i$tory and #er$ion$RIP2 o'er RIP+RIP2 o'er RIP+,onfiguring RIP and RIP command$,onfiguring RIP and RIP command$Di$tance #ector lgorithm$ and count toDi$tance #ector lgorithm$ and count toinfinity pro-leminfinity pro-lemProtocol Specification and Me$$age .ormatProtocol Specification and Me$$age .ormat

ddre$$ing ,on$ideration$ddre$$ing ,on$ideration$/imer$ Input and &utput proce$$ing/imer$ Input and &utput proce$$ingSecurity con$ideration$ in RIP2Security con$ideration$ in RIP2

hat i$ RIPng ad'antage$ and u$agehat i$ RIPng ad'antage$ and u$ageDi$ad'antage$ of RIP2 and propo$ed $olution$Di$ad'antage$ of RIP2 and propo$ed $olution$,onclu$ion,onclu$ion


3/30

RIP &'er'ie *i$tory and #er$ion$RIP &'er'ie *i$tory and #er$ion$

n interior gate ay protocol (IGP)n interior gate ay protocol (IGP)hich mean$ that it perform$ routinghich mean$ that it perform$ routingithin a $ingle autonomou$ $y$temithin a $ingle autonomou$ $y$tem

(1 terior3 4GP)(1 terior3 4GP)/he original incarnation of RIP a$ the/he original incarnation of RIP a$ the5ero protocol5ero protocol

pple/al" Routing /a-le Maintenancepple/al" Routing /a-le MaintenanceProtocol (R/MP) and the 4anyanProtocol (R/MP) and the 4anyan#I!1S Routing /a-le Protocol (R/P)#I!1S Routing /a-le Protocol (R/P)the$e are -a$ed on the 'er$ion$ of RIPthe$e are -a$ed on the 'er$ion$ of RIP


4/30

d'antage$ of RIP and Di$ad'antage$ of RIP+d'antage$ of RIP and Di$ad'antage$ of RIP+

d'antage$ of RIP3d'antage$ of RIP3

– RIP i$ 'ery u$eful in a $mall net or" here it ha$ 'ery littleRIP i$ 'ery u$eful in a $mall net or" here it ha$ 'ery littleo'erhead in term$ of -and idth u$ed and configuration ando'erhead in term$ of -and idth u$ed and configuration andmanagement time6management time6

– 1a$y to implement than ne er IGP7$1a$y to implement than ne er IGP7$

– Many implementation$ are a'aila-le in the RIP field6Many implementation$ are a'aila-le in the RIP field6

Di$ad'antage$ of RIP+3Di$ad'antage$ of RIP+3

– minimal amount of information for router to route the pac"etminimal amount of information for router to route the pac"etand al$o 'ery large amount of unu$ed $pace6and al$o 'ery large amount of unu$ed $pace6

– Su-net $upport 3 Support$ $u-net route$ only ithin theSu-net $upport 3 Support$ $u-net route$ only ithin the

$u-net net or"$u-net net or"– !ot $ecure anyone can act a$ a router 9u$t -y $ending RIP:+!ot $ecure anyone can act a$ a router 9u$t -y $ending RIP:+me$$age$me$$age$

– RIP+ a$ de'eloped for an S that originally included le$$RIP+ a$ de'eloped for an S that originally included le$$than a +00 router$than a +00 router$


5/30


6/30

RIP Me$$age /ran$ferRIP Me$$age /ran$fer


7/30

Practical u$e in Bahoo ,hat IMPractical u$e in Bahoo ,hat IM

Routing information protocol3 gi'e$Routing information protocol3 gi'e$command 'er$ion ip domain andcommand 'er$ion ip domain andaddre$$ information6addre$$ information6


8/30

RIP ,onfiguring and ,ommand$RIP ,onfiguring and ,ommand$

ip routing 3 ena-le$ the routerip routing 3 ena-le$ the routerrouter rip 3 you can enter configurationrouter rip 3 you can enter configurationcommand$ to define the RIP proce$$ forcommand$ to define the RIP proce$$ forrouterrouter

net or" net or"_addre$$ 3 /elling the routernet or" net or"_addre$$ 3 /elling the routerhich net or"$ it $hould ad'erti$e route$ forhich net or"$ it $hould ad'erti$e route$ for rite rite terminal 3 Sa'ing configurationrite rite terminal 3 Sa'ing configurationC 'ie currently running configurationC 'ie currently running configuration ping addre$$ 3 /o chec" and $ee if theping addre$$ 3 /o chec" and $ee if the

pac"et$ are getting routedpac"et$ are getting routed$ho ip route 3 /o 'ie the router$ current$ho ip route 3 /o 'ie the router$ currentrouting ta-lerouting ta-le$ho ip rip 3 Gi'e$ information a-out RIP$ho ip rip 3 Gi'e$ information a-out RIP


9/30

Di$tance #ector ProtocolDi$tance #ector Protocol

,ompati-le upgrade of RIP'+ including $u-net routing,ompati-le upgrade of RIP'+ including $u-net routingauthentication ,IDR aggregation route tag$ and multica$tauthentication ,IDR aggregation route tag$ and multica$ttran$mi$$iontran$mi$$ionSu-net $upport3 RIP'+ $upport$ $u-net route$ only ithin theSu-net $upport3 RIP'+ $upport$ $u-net route$ only ithin the$u-net net or" hile RIP'2 include$ $u-net ma$" in the$u-net net or" hile RIP'2 include$ $u-net ma$" in theme$$age$6 /hi$ allo $ for $u-net "no ledge out$ide $u-net6 Moreme$$age$6 /hi$ allo $ for $u-net "no ledge out$ide $u-net6 Morecon'enient partitioning u$ing 'aria-le length $u-net6con'enient partitioning u$ing 'aria-le length $u-net6RIP'2 i$ a di$tance 'ector -a$ed routing protocol6 RIP2 $upport$RIP'2 i$ a di$tance 'ector -a$ed routing protocol6 RIP2 $upport$'aria-le:length $u-net ma$"$ (#;SM)6'aria-le:length $u-net ma$"$ (#;SM)6

Di$tance 'ector routing protocol$3 Di$tance:-a$ed 'ector routingDi$tance 'ector routing protocol$3 Di$tance:-a$ed 'ector routingprotocol$ -a$e the optimal route on the num-er of hop$ (i6e6protocol$ -a$e the optimal route on the num-er of hop$ (i6e6de'ice$) a pac"et mu$t pa$$ through to reach a de$tination6de'ice$) a pac"et mu$t pa$$ through to reach a de$tination6

!eigh-oring node$ $end information in regular time inter'al$!eigh-oring node$ $end information in regular time inter'al$

In$tall route$ directly in ta-le$ lo e$t co$t in$In$tall route$ directly in ta-le$ lo e$t co$t in$/he information $ent (the di$tance 'ector$) are all route$/he information $ent (the di$tance 'ector$) are all route$from the ta-lefrom the ta-le

/he $horte$t path tree i$ contained in the routing ta-le/he $horte$t path tree i$ contained in the routing ta-le,alculation$ are -a$ed on the 4ellman:.ord algorithm,alculation$ are -a$ed on the 4ellman:.ord algorithm


10/30

Potential Pro-lem$ and Solution$Potential Pro-lem$ and Solution$

Potential Pro-lem$3Potential Pro-lem$3

– ,ount to infinity pro-lem,ount to infinity pro-lem– Routing loop$Routing loop$

S&;E/I&!3 /riggered Epdate$FSplit *ori on for Pre'enting / o:hop ;oop$S&;E/I&!3 /riggered Epdate$FSplit *ori on for Pre'enting / o:hop ;oop$

Split *ori on3Split *ori on3HSplit hori onH i$ a $cheme for a'oiding pro-lem$ cau$ed -y including route$ inHSplit hori onH i$ a $cheme for a'oiding pro-lem$ cau$ed -y including route$ inupdate$ $ent to the router from hich they ere learned6update$ $ent to the router from hich they ere learned6

– Simple : /he information a-out de$tination routed on the lin" i$ omittedSimple : /he information a-out de$tination routed on the lin" i$ omitted– ith poi$onou$ re'er$e :/he corre$ponding di$tance i$ $et to infinity if theith poi$onou$ re'er$e :/he corre$ponding di$tance i$ $et to infinity if the

de$tination i$ routed on the lin"de$tination i$ routed on the lin"

/riggered update$3/riggered update$3

– Split hori on ith poi$oned re'er$e ill pre'ent any routing loop$ thatSplit hori on ith poi$oned re'er$e ill pre'ent any routing loop$ thatin'ol'e only t o router$6 *o e'er it i$ po$$i-le to end up ith pattern$ inin'ol'e only t o router$6 *o e'er it i$ po$$i-le to end up ith pattern$ in

hich three router$ are engaged in mutual deception6hich three router$ are engaged in mutual deception6– timer i$ a$$ociated ith each entry in the routing ta-le : much longer than timer i$ a$$ociated ith each entry in the routing ta-le : much longer than

the period of tran$mi$$ion of informationthe period of tran$mi$$ion of information– /riggered update$ re@ue$t node$ to $end me$$age$ a$ $oon a$ they notice a/riggered update$ re@ue$t node$ to $end me$$age$ a$ $oon a$ they notice a

change in the routing ta-lechange in the routing ta-le


11/30

RIP 2 Pac"et .ormatRIP 2 Pac"et .ormat,ommand :: /he command field i$ u$ed to,ommand :: /he command field i$ u$ed to$pecify the purpo$e of the datagram6$pecify the purpo$e of the datagram6

#er$ion :: /he RIP 'er$ion num-er6 /he#er$ion :: /he RIP 'er$ion num-er6 /hecurrent 'er$ion i$ 26current 'er$ion i$ 26

ddre$$ family identifier :: Indicate$ hatddre$$ family identifier :: Indicate$ hattype of addre$$ i$ $pecified in thi$ particulartype of addre$$ i$ $pecified in thi$ particularentry6entry6

Route tag :: ttri-ute a$$igned to a routeRoute tag :: ttri-ute a$$igned to a routehich mu$t -e pre$er'ed and read'erti$edhich mu$t -e pre$er'ed and read'erti$edith a route6 /he route tag pro'ide$ aith a route6 /he route tag pro'ide$ a

method of $eparating internal RIP route$method of $eparating internal RIP route$from e ternal RIP route$ hich may ha'efrom e ternal RIP route$ hich may ha'e-een imported from an 1GP or another IGP6-een imported from an 1GP or another IGP6

IP addre$$ :: /he de$tination IP addre$$6IP addre$$ :: /he de$tination IP addre$$6

Su-net ma$" :: #alue applied to the IPSu-net ma$" :: #alue applied to the IPaddre$$ to yield the non:ho$t portion of theaddre$$ to yield the non:ho$t portion of theaddre$$6 If ero then no $u-net ma$" ha$addre$$6 If ero then no $u-net ma$" ha$-een included for thi$ entry6-een included for thi$ entry6

!e t hop :: Immediate ne t hop IP addre$$!e t hop :: Immediate ne t hop IP addre$$to hich pac"et$ to the de$tinationto hich pac"et$ to the de$tination$pecified -y thi$ route entry $hould -e$pecified -y thi$ route entry $hould -efor arded6for arded6

Metric :: Repre$ent$ the total co$t ofMetric :: Repre$ent$ the total co$t ofgetting a datagram from the ho$t to thatgetting a datagram from the ho$t to thatde$tination6de$tination6

Protocol Structure - RIP & and RIP2: Routing Information Protocol

http://www.colasoft.com/resources/protocol.php?id=RIP2

Max pkt size 5 2


12/30

RIP'2 Pac"et .ormat ( ithF ithout uthentication *eader)RIP'2 Pac"et .ormat ( ithF ithout uthentication *eader)

RIP'2 pac"et ith no uthenticationRIP'2 pac"et ith no uthentication RIP'2 pac"et ith uthenticationRIP'2 pac"et ith uthenticationheaderheader


13/30

1 ample and Routing /a-le Structure1 ample and Routing /a-le Structure

IP Routing table for Router R1IP Routing table for Router R1

I!cluded i! RIP routi!" ta#le

$%ddress of &!et/su#!et/host' desti!atio!$Metric associated with desti!atio!

$%ddress of !ext hop router $Rece!tl( updated fla"

$)e*eral timers


14/30

RIP2 1 ten$ion$RIP2 1 ten$ion$

authenticationauthentication

routing per $u-netrouting per $u-net$upport of multiple metric$$upport of multiple metric$routing domain$routing domain$

multica$tingmultica$ting


15/30

ddre$$ing ,on$iderationddre$$ing ,on$ideration IP addre$$ field in RIP2IP addre$$ field in RIP2me$$ageme$$age (Re@ue$tF Re$pon$e )(Re@ue$tF Re$pon$e ) format can -e net or"$format can -e net or"$ho$t$ or a $pecial codeho$t$ or a $pecial codeu$ed to indicate a defaultu$ed to indicate a defaultaddre$$ : e ampleaddre$$ : e ample– 128.6128.6 Network Address Network Address– 128.6.4.1128.6.4.1 HostHost

addressaddress– 0.0.0.00.0.0.0 Default address Default address

Su-net addre$$e$ mu$t notSu-net addre$$e$ mu$t not

-e $ent out$ide the net or"-e $ent out$ide the net or"of hich the $u-net i$ aof hich the $u-net i$ apart6part60606060 i$ u$ed to de$cri-e a0606060 i$ u$ed to de$cri-e adefault route6default route6


16/30

/imer$/imer$Multiple timer$ for performance regulationMultiple timer$ for performance regulation

1ach route contain$ the follo ing timer$61ach route contain$ the follo ing timer$6– Routing:update timerRouting:update timer 6 ::: >06 ::: >0

Second$Second$Every 30 seconds, t e out!ut !rocess "sEvery 30 seconds, t e out!ut !rocess "s

"nstructed to #enerate a co$!lete"nstructed to #enerate a co$!leteres!onse to every ne"# %or"n#res!onse to every ne"# %or"n#routerateway.routerateway.30 seconds u!dates are tr"##ered %y a30 seconds u!dates are tr"##ered %y a

clock not affected syste$ load orclock not affected syste$ load or serv"ce. serv"ce.'o !revent coll"s"ons ( 30 second t"$er'o !revent coll"s"ons ( 30 second t"$eroffset %y add"t"on of a s$all rando$offset %y add"t"on of a s$all rando$

t"$e.t"$e.


17/30

/imer$/imer$– /ime out timer$/ime out timer$ 6 :::: +80 Second$6 :::: +80 Second$

)et route $etr"c to 16 *+nf"n"ty -)et route $etr"c to 16 *+nf"n"ty -oute c an#e fla# "s set oute c an#e fla# "s set

' e out!ut !rocess "s "nstructed to' e out!ut !rocess "s "nstructed to #enerate a res!onse $essa#e *Not"fy #enerate a res!onse $essa#e *Not"fyne"# %ors .ne"# %ors .

– Gar-age collection timerGar-age collection timer 6 ::::: +206 ::::: +20Second$Second$

oute "s deleted fro$ rout"n# ta%le.oute "s deleted fro$ rout"n# ta%le.' e out!ut !rocess "s "nstructed to' e out!ut !rocess "s "nstructed to

#enerate a res!onse $essa#e *Not"fy #enerate a res!onse $essa#e *Not"fyne"# %ors .ne"# %ors .


18/30

InitializationInitialization

Initiali ationInitiali ation– ' "s "s done w en ost f"rst co$es onl"ne.' "s "s done w en ost f"rst co$es onl"ne.– Deter$"ne w o t e ne"# %ors are.Deter$"ne w o t e ne"# %ors are.

– )et co$$and f"eld to 1)et co$$and f"eld to 1– )end re/uest for ent"re rout"n# ta%le fro$)end re/uest for ent"re rout"n# ta%le fro$

ne"# %orsne"# %ors ..


19/30

&peration$ :&peration$ : Input Proce$$ingInput Proce$$ing

Handles t e data#ra$ rece"ved on + !ort * 20 .Handles t e data#ra$ rece"ved on + !ort * 20 .

Do 'alidation ( $uch a$ 'er$ion num-er etc)Do 'alidation ( $uch a$ 'er$ion num-er etc)– +f val"dat"on fa"ls lo# t e error +f val"dat"on fa"ls lo# t e error

,hec" command field (Re@ue$t or Re$pon$e),hec" command field (Re@ue$t or Re$pon$e)*andling Input Re@ue$t Me$$age*andling Input Re@ue$t Me$$age

– +n"t"al" at"on e/uest +n"t"al" at"on e/uest )end ent"re rout"n# )end ent"re rout"n#ta%le.ta%le.

– )!ec"f"c re/uest)!ec"f"c re/uest )end only entr"es )end only entr"esre/uested.re/uested.

– )end res!onse "$$ed"ately )end res!onse "$$ed"ately *andling Input Re$pon$e Me$$age: re$pon$e can -e*andling Input Re$pon$e Me$$age: re$pon$e can -e

recei'ed for one of $e'eral follo ing rea$on$6recei'ed for one of $e'eral follo ing rea$on$6– es!onse to a s!ec"f"c /uery *d"rect D connect"ones!onse to a s!ec"f"c /uery *d"rect D connect"on

for t e router .for t e router .– e#ular u!date * nsol"c"ted res!onse .e#ular u!date * nsol"c"ted res!onse .– 'r"##ered u!date caused %y a route c an#e'r"##ered u!date caused %y a route c an#e ..


20/30

RIP Re$pon$e Me$$ageRIP Re$pon$e Me$$age


21/30


22/30

Interaction -et een RIP#+ andInteraction -et een RIP#+ andRIP#2RIP#2

;imiting !et or"$;imiting !et or"$Di$a-le uto:Summari ationDi$a-le uto:Summari ation

Single Su-netma$"Single Su-netma$"


23/30

Security ,on$ideration$Security ,on$ideration$

uthenticationuthentication+6 Plainte t uthentication+6 Plainte t uthentication

lgorithmlgorithm26,ryptographic uthentication26,ryptographic uthentication+6%eyed Me$$age Dige$t =+6%eyed Me$$age Dige$t =

26*M ,:S* +26*M ,:S* +Peer SecurityPeer SecurityRouter .ilter$Router .ilter$


24/30


25/30

RIPng v/s RIP-2RIPng v/s RIP-2 RIPngRIPng RIP-2RIP-2

Learns IPv6 routeLearns IPv6 routeinformationinformation

Learns IPv4 routeLearns IPv4 routeinformationinformation

Uses port number 521.Uses port number 521. Uses port number 520Uses port number 520

Requires noRequires noaut enti!ation for RIPngaut enti!ation for RIPng

proto!o" pa!#ets.proto!o" pa!#ets.

Requires aut enti!ationRequires aut enti!ationfor RIP proto!o" pa!#etsfor RIP proto!o" pa!#ets

$o support for mu"tip"e$o support for mu"tip"einstan!es of RIPng.instan!es of RIPng.

%upport for mu"tip"e%upport for mu"tip"einstan!es of RIP-2instan!es of RIP-2


26/30

RIP2 : Di$ad'antage$RIP2 : Di$ad'antage$

RIP:2 $upport$ generic notion ofauthentication -ut only Jpa$$ ordK i$defined $o far6 Still not 'ery $ecure6RIP2 pac"et $i e increa$e$ a$ the num-er ofnet or"$ increa$e$ hence it i$ not $uita-lefor large net or"$6RIP2 generate$ more protocol traffic than&SP. -ecau$e it propagate$ routinginformation -y periodically tran$mitting theentire routing ta-le to neigh-or router$RIP2 may -e $lo to ad9u$t for lin" failure$6


27/30

Solution3&SP. ithin an SSolution3&SP. ithin an S

,an $upport fine:grained metric$ ('$6,an $upport fine:grained metric$ ('$6RIP)RIP)Multiple metric$Multiple metric$– /hroughput Delay ,o$t Relia-ility/hroughput Delay ,o$t Relia-ility

,an compute a different routing ta-le,an compute a different routing ta-lefor each metric6for each metric6

&SP.'2 $upport$ an e ten$ion that&SP.'2 $upport$ an e ten$ion thatallo $ the metric to -e u$ed $pecifiedallo $ the metric to -e u$ed $pecifiedin the pac"et6in the pac"et6


28/30

,onclu$ion,onclu$ion

RIP2 offer$ many $u-$tantial feature$u$ed to increa$e the efficiency ofRIP+

RIP2 ha'e one negati'e feature ofRIP+ : the path -et een t o $u-net$i$ -a$ed on the fe e$t num-er ofrouter hop$

RIPng i$ a complete ne protocolde$igned for Ip'A6 It u$e$ the $ameoperation$ a$ that of RIP+ and RIP2


29/30

Reference$Reference$LL http3FF 6pmg6comFot _n $lF? _ _rip+6htmhttp3FF 6pmg6comFot _n $lF? _ _rip+6htm NNLL http3FF 69a''in6comFprotocolRIP6htmlhttp3FF 69a''in6comFprotocolRIP6html NNLhttp3FF 6cola$oft6comFre$ource$Fprotocol6php idORIP2NLhttp3FF 6cola$oft6comFre$ource$Fprotocol6php idORIP2NLhttp3FF 6protocol$6comFp-oo"Ftcpip


30/30

Que$tion$Que$tion$

Routing Information Protocol 2

Documents

Transcript of Routing Information Protocol 2