Scribd
Upload
83 views

Routing Information Protocol

RIP is a routing protocol that uses hop counts as its routing metric. It broadcasts routing updates every 30 seconds and maintains only the route with the lowest hop count to a destination in its routing tables. The maximum number of hops allowed in a path is 15, after which a destination is considered unreachable. RIP has limitations in only supporting small networks due to its maximum hop count and generating frequent updates that consume bandwidth.

Uploaded by

Arun Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
83 views

Routing Information Protocol

RIP is a routing protocol that uses hop counts as its routing metric. It broadcasts routing updates every 30 seconds and maintains only the route with the lowest hop count to a destination in its routing tables. The maximum number of hops allowed in a path is 15, after which a destination is considered unreachable. RIP has limitations in only supporting small networks due to its maximum hop count and generating frequent updates that consume bandwidth.

Uploaded by

Arun Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Routing Information Protocol (RIP)

1. Routing..1
2. Background...1
3. Basic capabilities and features of RIP..1
4. RIP Packet Format2
5. !tension of RIP"s capabilities.3
#. $uestions...3
%. Bibliograp&'..3
Routing
Routing is t&e act of mo(ing information across a net)ork *)it& at least one node in
bet)een+
Routing occurs at la'er 3 of t&e ,-I model *net)ork la'er+
Routing in(ol(es t)o basic acti(ities.
/etermining optimal routing pat&s
Protocol use metrics for e(aluation of pat&s
Routing algorit&ms initiali0e and maintain routing tables *contain route
information+
1ransporting information groups *packets+
Background
Routing protocol RIP )as defined in
Re2uest For 3omments *RF3+ 1455
Internet -tandard *-1/+
It uses distance (ectors to mat&ematicall' compare routes to identif' t&e best pat& to
an' gi(en destination address
6it& t&e e!pansion of IP based net)orks *more numerous and greater in si0e+
7pdate in 1884
RIP2 defined in 1884 in RF3 1%23
RIP
,nl' addresses
Broadcast onl'
Basic capabilities and features of RIP
1. Routing update process
2. RIP routing tables
3. Routing stabilit'
4. Routing timers
Routing update process
9essages are send in regular inter(als as )ell as )&en t&e topolog' c&anges
*generall' e(er 34 s+
If t&e router recei(es c&anges t&e routing table is updated
RIP routers maintain onl' t&e best route to t&e destination
1&e ma!imal number of &ops is 15
Is a net)ork destination more t&an 15 &ops a)a' t&e destination is not reac&able
RIP routing tables
-ingle routing metric *&op count+ to measure t&e distance
ac& &op in a pat& from source to destination is assigned a &op count (alue *t'picall'
1+
7pdate )it& ne) or c&anged destination net)ork entr' :; router adds 1 to t&e metric
(alue
Routing stability
Routing loops from continuing indefinitel' b' implementing a limit on t&e number of
&ops allo)ed in a pat& from t&e source to a destination
9a!imum number of &ops in a pat& is 15
If increasing t&e metric (alue b' 1 causes t&e metric to be infinit' *t&at is 1#+< t&e
net)ork destination is considered unreac&able
Routing timers
Routing:update timer clocks t&e inter(al bet)een periodic updates *34 s+
Route:timeout timer
ac& entr' &as a route:timeout timer associated
1imer e!pires route marked in(alid
Route:flus& timer
In(alid route remo(ed )&en e!pires *after 3 min+
RIP Packet Format
3onsist of nine fields
Figure 1: RIP
Figure 2: RIP2
3ommand *re2uest or response+
=ersion number *RIP1 or 2+
>ero *unused? pro(ide back)ard compatibilit'+
@ddress:famil' identifier *@FI+*-pecifies t&e address famil' used+
IP @ddress *specifies t&e IP address for t&e entr'+
9etric *indicates &o) man' internet )ork &ops *routers+ &a(e been passed on a trip+
Route tag *pro(ides a met&od for distinguis&ing bet)een internal routes *learned b'
RIP+ and e!ternal routes learned from ot&er protocols+
-ubnet mask *contains t&e subnet mask *for t&e entr' 0ero no subnet mask++
Ae!t &op *Indicates t&e IP address t&e ne!t &op to )&ic& packets for t&e entr' s&ould
be for)arded+
Extension of RIPs capabilities
RIP messages carr' more information
@ut&entication mec&anism to secure table updates
-upport subnet masks
3an use multi cast
Questions
1. !plain to t)o disad(antages of RIP closer
Bimited number of &ops *onl' small net)orks+
1alkati(e *broadcast e(er' 34 s+
-ubnet mask *)it& RIP2+
2. !plain t&e routing update process )it& RIP
-ee Routing update process
Bibliography
Internet)orking 1ec&nologies Candbook publis&ed b' 3isco

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy