计算机网络第四章作业.doc
《计算机网络第四章作业.doc》由会员分享,可在线阅读,更多相关《计算机网络第四章作业.doc(4页珍藏版)》请在淘文阁 - 分享文档赚钱的网站上搜索。
1、【精品文档】如有侵权,请联系网站删除,仅供学习与交流计算机网络第四章作业.精品文档.第四章P450-22: Consider the following network. With the indicated link costs, use Dijkstras shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table.zxyVwtus126681483425914AnswerProblem
2、22StepND(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)0x8,x6,x6,x1xw14,w8,x6,x2xwy15,y14,w7,y18,y3xwyv11,v10,v18,y4xwyvu14,u11,v18,y5xwyvut12,t16,t6xwyvuts16,t7xwyvutsz y t zx v s w uRouting Table:DESCOSTNEST HOPx0y6yw6wv7yt11yu10yz16ys12yP451-25: Consider the network fragment shown
3、 below. x has only two attached neighbors, w and y. w has a minimum-cost path to destination u of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have strictly positive integer values.a. Give xs dista
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 计算机网络 第四 作业
限制150内