71205902055-桑丽平-第五章1
需积分: 0 39 浏览量
2022-08-08
19:43:00
上传
评论
收藏 81KB DOCX 举报
第五章作业如下：
5-1 Consider the network of Fig.5-7, but ignore the weights on the lines. Suppose
that it uses flooding as the routing algorithm. If a packet sent by A to D has a
maximum hop count of 3, list all the routes it will take. Also tell how many hops
worth of bandwidth it consumes.
答：
5-2 Consider the network of Fig. 5-12(a). Distance vector routing is used, and the
following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D:
(16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4). The cost of the links from C to B, D,
and E, are 6, 3, and 5, respectively. What is C’s new routing table? Give both the
outgoing line to use and the cost.
答：图 5.12
B 的矢量是（5，0,8,12,6,2）代表 B 到 ABCDEF 的成本，所以 C 通过 B 到达其
他节点的成本是（11,6,14,18，12,8），通过 D 到其他节点的成本
（19,15,9,3,12,15），通过 E 到其他节点的成本（12,11,8,14,5,9）其中除到
达自身的链路成本是 0，其他值选出三个表对应位置最小的值为
（11,6,0,3,5,8）出去的链路分别是（B,B,-,D,E,B）
评论0