LearningOutcome

BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Bytheendofthischapter,studentswillbeabletocreate h d f hi h d ill b bl

dynamicroutingtablesbasedonroutingalgorithms

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

ChapterContents
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

RoutinginPacketSwitchedNetwork i i k i h d k Routingstrategies

Fixed Flooding Random Adaptive Dijkstras algorithm

Least Cost Algorithm LeastCostAlgorithm

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

Routing
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Routing
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Akeydesignissueinswitchednetworkssuchascircuit k d i i i i h d k h i i

Routingincircuitswitchingnetworksaretraditionally i i i i i hi k di i ll

switching,packetswitching,framerelayandATM networksisrouting networks is routing Routingfunctionseekstodesignroutesthroughthe networkforindividualpairsofcommunicatingendnodes t k f i di id l i f i ti d d suchthatthenetworkisusedefficiently

involvedastaticroutingstrategywiththeuseofalternate pathstorespondtoincreasedload paths to respond to increased load Theroutingfunctionofapacketswitchingnetwork attemptstofindtheleastcostroutethroughthe tt t t fi d th l t t t th h th network,withcostbasedonnumberofhops,expected delayorothermetrics. delay or other metrics

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

RoutinginPacketSwitchedNetwork
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

PerformanceCriteria
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Complex,crucialaspectofpacketswitchednetworks l i l f k i h d k Characteristicsrequired Correctness Simplicity Robustness Stability Fairness Optimality Efficiency

Usedforselectionofroute df l i f Minimumhop Shortestpath/fewerhops Leastcost Minimumdelay

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

ExamplePacketSwitchedNetwork
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

RoutingStrategies
Alargenumberofroutingstrategieshaveevolvedfor l b f i i h l df

dealingwiththeroutingrequirementsofpacket switchingnetworks switching networks Severalstrategies:

Fixed Flooding Random Adaptive

Node1tonode6: Node 1 to node 6 : Shortestpath(fewerhops):136(cost=5+5=10) L t Leastcostpath:1456(cost=1+1+2=4) t th 1 4 5 6 ( t 1 + 1 +2 4)

[email protected]
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

FixedRouting
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

FixedRoutingTables
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Singlepermanentrouteforeachsourcedestinationpair i l f h d i i i Determineroutesusingleastcostalgorithm Djikstras Algorithm BellmanFordAlgorithm Routesarefixed,atleastuntilachangeinnetwork

topology Advantage:simplicity,workwellinareliablenetwork withstableload Disadvantage:lackofflexibility,doesnotreactto networkcongestionorfailures

[email protected]
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

Acentralroutingdirectoryiscreated,usuallystoredatanetworkcontrol

center
The directory shows the identity of the next node on the route for each Thedirectoryshowstheidentityofthenextnodeontherouteforeach

sourcedestinationpairofnodes Fromthisdirectory,routingtablescanbedevelopedandstoredateach node

[email protected]
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

FixedRoutingTables
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Flooding
Nonetworkinforequired ki f i d Packetsentbynodetoeveryneighbor Incomingpacketsretransmittedoneverylinkexcept

Eachnodeneedonlystoreasinglecolumnofroutingdirectory Thenodesdirectoryshowsthenextnodetotakeforeachdestination
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

incominglink Eventuallyanumberofcopieswillarriveatdestination Eachpacketisuniquelynumberedsoduplicatescanbe discarded Nodescanrememberpacketsalreadyforwardedtokeep p y p networkloadinbounds Canincludeahopcountinpackets p p

[email protected]
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FloodingExample
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

PropertiesofFlooding
Allpossibleroutesaretried ll ibl i d Veryrobust Atleastonepacketwillhavetakenminimumhopcount

route
Canbeusedtosetupvirtualcircuit

Allnodesarevisited Usefultodistributeinformation(e.g.routing) Disadvantage:Hightrafficload,directlyproportionalto

theconnectivityofthenetwork

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

RandomRouting
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

AdaptiveRouting
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Simplicity&robustnessoffloodingwithfarlesstraffic i li i & b f fl di i hf l ffi

Usedbyalmostallpacketswitchingnetworks db l ll k i hi k Routingdecisionschangeasconditionsonthenetwork

load Nodeselectsoneoutgoingpathforretransmissionof incomingpacket Selectioncanberandomorroundrobin Canselectoutgoingpathbasedonprobabilitycalculation Nonetworkinfoneeded Routeistypicallynotleastcostnorminimumhop yp y p

change
Failure Congestion

Requiresinformationaboutnetwork Decisionsmorecomplex

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

AdaptiveRouting
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

LeastCostAlgorithms
Mostleastcostroutingalgorithmsinuseinpacket l i l ih i i k

Tradeoffbetweenqualityofnetworkinfoandoverhead d ff b li f ki f d h d Themoreinformationthatisexchanged,andthemore frequentlyitisexchanged,thebetterwillbetherouting f tl it i h d th b tt ill b th ti decisionsthateachnodemakes However the information is itself a load on the networks However,theinformationisitselfaloadonthenetworks, causingaperformancedegradation

switchingnetworksarevariationsofoneoftwocommon algorithms
Dijkstras algorithm B ll BellmanFordalgorithm F d l ith

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

Dijkstras Algorithm
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Dijkstras Algorithm
Findshortestpathsfromgivensourcenodetoallother i d h h f i d ll h

Namedafteritsinventor,Dutch

nodes,bydevelopingpathsinorderofincreasingpath length
N=setofnodesinthenetwork s=sourcenode d T=setofnodessofarincorporatedbythealgorithm

computerscientistEdsger Dijkstra Analgorithmthatsolvesthesingle sourceshortestpathproblem

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

Dijkstras Algorithm
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Dijkstras Algorithm
Step1[Initialization] [ i i li i ] T={s}Setofnodessofarincorporatedconsistsofonly sourcenode d L(n)=w(s,n)forns I ii l Initialpathcoststoneighboringnodesaresimplylinkcosts h i hb i d i l li k Step2[GetNextNode] FindneighboringnodenotinTwithleastcostpathfroms IncorporatenodeintoT Alsoincorporatetheedgethatisincidentonthatnodeand anodeinTthatcontributestothepath
[email protected]
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

w(i,j)=linkcostfromnodei tonodej (i j) li k f d i d j w(i,i)=0 w(i,j)= ifthetwonodesarenotdirectlyconnected w(i,j) 0ifthetwonodesaredirectlyconnected L(n)=costofleastcostpathfromnodestonoden

currentlyknown
Attermination,L(n)iscostofleastcostpathfromston

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

Dijkstras Algorithm
BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING

Dijkstras Algorithm
Attermination,valueL(x)associatedwitheachnodexis i i l ( ) i d ih h d i

Step3[UpdateLeastCostPaths] [ d h] L(n)=min[L(n),L(x)+w(x,n)]foralln T Iflattertermisminimum,pathfromstonispathfromsto xconcatenatedwithedgefromxton Algorithmterminateswhenallnodeshavebeenaddedto l h h ll d h b dd d

cost(length)ofleastcostpathfromstox. Inaddition,Tdefinesleastcostpathfromstoeachother node Oneiterationofsteps2and3addsonenewnodetoT

Definesleastcostpathfromstothatnode

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

ExampleofDijkstras Algorithm ExampleofDijkstras

BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING
FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

ExampleofDijkstras Algorithm ExampleofDijkstras

[email protected]

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA

ExampleofDijkstras Algorithm ExampleofDijkstras

BENT317 73DATACOM MMUNICATIO ONS&NETW WORKING Iteration 1 2 3 4 5 6 T {1} {1,4} {1, 2, 4} {1, 2, 4, 5} {1, 2, 3, 4, 5} {1, 2, 3, 4, 5, 6} L(2) 2 2 2 2 2 2 Path 1 2 12 12 12 12 12 1-2 L(3) 5 4 4 3 3 3 Path 13 1-3 1-4-3 1-4-3 1-4-5 3 1-4-5 3 1-4-53 L(4) 1 1 1 1 1 1 Path 1 4 14 14 14 14 14 1-4 L(5) 2 2 2 2 2 Path 1-45 1-45 1-45 1-45 1-45 L(6) 4 4 4 Path 1-4-5 6 1-4-5 6 1-4-56

[email protected]

FACULTYOFELECTRONIC&COMPUTERENGINEERING UNIVERSITITEKNIKALMALAYSIAMELAKA