计算机网络第四章作业

计算机网络第四章作业计算机网络第四章作业计算机网络第四章作业资料仅供参考文件编号：2022年4月计算机网络第四章作业版本号：A修改号：1页次：1.0审核：批准:发布日期：第四章P450-22:Considerthefollowingnetwork.Withtheindicatedlinkcosts,useDijkstra’sshortest-pathalgorithmtocomputetheshortestpathfromxtoallnetworknodes.Showhowthealgorithmworksbycomputingatable.zzxyVwtus126681483425914AnswerProblem22StepN’D(s),p(s)D(t),p(t)D(u),p(u)D(v),p(v)D(w),p(w)D(y),p(y)D(z),p(z)0x∞∞∞8,x6,x6,x∞1xw∞∞14,w8,x6,x∞2xwy∞15,y14,w7,y18,y3xwyv∞11,v10,v18,y4xwyvu14,u11,v18,y5xwyvut12,t16,t6xwyvuts16,t7xwyvutszytzxvswuRoutingTable:DESCOSTNESTHOPx0y6yw6wv7yt11yu10yz16ys12yP451-25:Considerthenetworkfragmentshownbelow.xhasonlytwoattachedneighbors,wandy.whasaminimum-costpathtodestinationuof5,andyhasaminimum-costpathtouof6.Thecompletepathsfromwandytou(andbetweenwandy)arenotshown.Alllinkcostsinthenetworkhavestrictlypositiveintegervalues.Givex’sdistancevectorfordestinationsw,y,andu.Givealink-costchangeforeitherc(x,w)orc(x,y)suchthatxwillinformitsneighborsofanewminimum-costpathtouasaresultofexecutingthedistance-vectoralgorithm.Givealink-costchangeforeitherc(x,w)orc(x,y)suchthatxwillnotinformitsneighborsofanewminimum-costpathtouasaresultofexecutingthedistance-vectoralgorithm.wwxy25AnswerProblem25a.Dx(y)=5,Dx(w)=2,Dx(u)=7b.Firstconsiderwhathappensifc(x,y)changes.Ifc(x,y)becomeslargerorsmaller(aslongasc(x,y)>0),theleastcostpathfromxtouwillstillhavecostatleast7.Thusachangeinc(x,y)willnotcausextoinformitsneighborsofanychanges.Nowconsiderifc(x,w)changes.Ifc(x,w)=1,thentheleast-costpathtoucontinuestopassthroughwanditscostchangesto5+;xwillinformitsneighborsofthisnewcost.Ifc(x,w)=>6,thentheleastcostpathnowpassesthroughyandhascost11;againxwillinformitsneighborsofthisn