0% found this document useful (0 votes)
34 views4 pages

CNS Assignment6

1. The document discusses the Distance Vector Routing protocol, which is an iterative and distributed routing algorithm. 2. In Distance Vector routing, each node calculates the distance to reachable nodes and shares this information with directly connected neighbor nodes. Nodes then calculate and distribute the shortest paths through the network. 3. The algorithm works by having each node maintain a routing table with distances to every other node and periodically share this information. Nodes update their tables when shorter paths are discovered.

Uploaded by

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

CNS Assignment6

1. The document discusses the Distance Vector Routing protocol, which is an iterative and distributed routing algorithm. 2. In Distance Vector routing, each node calculates the distance to reachable nodes and shares this information with directly connected neighbor nodes. Nodes then calculate and distribute the shortest paths through the network. 3. The algorithm works by having each node maintain a routing table with distances to every other node and periodically share this information. Nodes update their tables when shorter paths are discovered.

Uploaded by

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

Manas

200G0
Assionoent - 6 D D M M

OTtle ite a pngam to implemeot liokstato/


Distance yector KothinapKatoca to-tind_
Sutable path os anSmissioo

lobiechvesTo To undestand Coonkia ot Oistane


yectar Kounq praocol.
Theon i
Routina algosithm

rg
he pancess_cshich fs use to establish the
i.o
tes btolloconqthe data packets to ach
ed
the deehnato ieaset ot step-by-step
iv
dw

pocees usedon dinechoq he tatio dt the


mtenet_ eficientlp
ra

ODce a dacta packset lene-


study.narendradwivedi.org
nd

omthe SOUTCe
re
na

Roctiog Alacmithm
y.
ud
st

Adaptile Alaanitnms. Non-Ada pmve Alaaati

Holated
Hlooding8
Centalized
Rondorn alk
Oistibute
D D MM Y Y Y Y

Adaphive algrthons
Usedo chatae he decisionG actno uhen
Hxattic loanKnehtuonk opaloay_chanaesSoth
change ull be etlecha Loithio the opoloqyy
Detcomonk tctuCThis s kpaun0 as_dunamio
OuHna o)hico il mcke uSe ot deenamic data
nk oas mreattopolog dlelay fa eelech

Non- Adaptug Alamthms


rg
i.o
Naa- adaptuie algasithms do oat modiy the
ed

gathogdecisiena uhenAhey baNe been pmeter-


iv

h i s Thia kind ofaloamitbm ía also called state


dw

autH1ng becauce he o t e uhich s usa can


ra

study.narendradwivedi.org
nd

be calculate D adsane dowaloade to autes


re

Once he matec ís þocte


na
y.
ud

Disaoce alectorgOLtina-
st

h e Distane vectoí alaonthms ís iBexative


anchTOnous and isteibuta
eibuked i is dshibuted ia that eah nOse
geceiues iotaaHn rom one c mee its
dicectly atachgl oegbloukspexstorms coalcdlatia
and th disdoibutes the mesult
eatiue: TL fe teaive in dhat its pracss
Comoules nh no mDe Drmatim is aVailoble
o oeezchange betrOeen neghbouxs
Asadorooousit deesAat oeqLime that al at ts
podes 2peTahe în tbe loclk step oth each_aher
rg
i.o
ed
iv
dw
ra

study.narendradwivedi.org
nd
re
na
y.
ud
st

o c)
DD MM Y Y YY

Algomithm

Stst
2By DOslentian the distane at-the nodeto iteett
i s acs@ned so zeso and aoben a node isun
eachable the distace is accept cs g99
Accept the Snput dictance matriz from the
usen lcdm O that_Aepmtsents the distance
aetueen ach nodein the nettooxk

rg
Stu thedistance betuueen nodes ina sulta-
i.o
ble tmiable2
ed

SCalalate the minimum distance betuween to


iv
dw

ndes iesaing
ra

study.narendradwivedi.org
6TE he Oistane bettoeNr2 nodes is lapaer
nd

han
thanhecacuats allecnae aaiable path-
re
na

epae the ezisheq ostance cwith he alcu


y.

late distance
ud

Pin the shostest path_mlculakes


st

Cooshsion =
Thus e e bauetudied omking of
Distance ecton ounng prdtooloio
Stable patbtos ta mission

You might also like