《路由协议》ppt课件

《路由协议》ppt课件

ID:40109206

大小:70.50 KB

页数:8页

时间:2019-07-21

《路由协议》ppt课件_第1页
《路由协议》ppt课件_第2页
《路由协议》ppt课件_第3页
《路由协议》ppt课件_第4页
《路由协议》ppt课件_第5页
资源描述:

《《路由协议》ppt课件》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、RoutingGraphabstractionforroutingalgorithms:graphnodesareroutersgraphedgesarephysicallinkslinkcost:delay,$cost,orcongestionlevelsinglecostGoal:determine“good”path(sequenceofrouters)thrunetworkfromsourcetodest.RoutingprotocolAEDCBF2213112535“good”path:typicallymeansminimu

2、mcostpathotherdef’spossible1NetworkLayerALink-StateRoutingAlgorithmDijkstra’salgorithmnettopology,linkcostsknowntoallnodesaccomplishedvia“linkstatebroadcast”allnodeshavesameinfocomputesleastcostpathsfromonenode(“source”)toallothernodesgivesroutingtableforthatnodeiterativ

3、e:afterkiterations,knowleastcostpathtokdest.’sNotation:c(i,j):linkcostfromnodeitoj.costinfiniteifnotdirectneighborsD(v):currentvalueofcostofpathfromsourcetodest.Vp(v):predecessornodealongpathfromsourcetov,thatisnextvN:setofnodeswhoseleastcostpathdefinitivelyknown2Network

4、LayerDijsktra’sAlgorithm1Initialization:2N={A}3forallnodesv4ifvadjacenttoA5thenD(v)=c(A,v)6elseD(v)=infty78Loop9findwnotinNsuchthatD(w)isaminimum10addwtoN11updateD(v)forallvadjacenttowandnotinN:12D(v)=min(D(v),D(w)+c(w,v))13/*newcosttoviseitheroldcosttovorknown14shortest

5、pathcosttowpluscostfromwtov*/15untilallnodesinN3NetworkLayerDistanceVectorRoutingAlgorithmIterative(重复):continuesuntilnonodesexchangeinfo.Asynchronous异步:nodesneednotexchangeinfo/iterateinlockstep!Distributed分布:eachnodecommunicatesonlywithdirectly-attachedneighborsDistanc

6、eTabledatastructureeachnodehasitsownrowforeachpossibledestinationcolumnforeachdirectly-attachedneighbortonodeexample:innodeX,fordest.YvianeighborZ:D(Y,Z)XdistancefromXtoY,viaZasnexthopc(X,Z)+min{D(Y,w)}Zw==4NetworkLayerDistanceVectorRouting:overviewIterative,asynchronous

7、:eachlocaliterationcausedby:locallinkcostchangemessagefromneighbor:itsleastcostpathchangefromneighborDistributed:eachnodenotifiesneighborsonlywhenitsleastcostpathtoanydestinationchangesneighborsthennotifytheirneighborsifnecessarywaitfor(changeinlocallinkcostormsgfromneig

8、hbor)recomputedistancetableifleastcostpathtoanydesthaschanged,notifyneighborsEachnode:5NetworkLayerDist

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。