有哪些信誉好的足球投注网站- 1、本文档共6页，可阅读全部内容。
- 2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
Computer Network (2013 Fall)
Homework Answer Chapter3
Question 3
For the network given in Figure 3.31, give the datagram forwarding table for each node. The
links are labeled with relative costs; your tables should forward each packet via the lowest‐cost
path to its destination.
The lowest‐cost spanning tree for Figure 3.31 is:
From the spanning tree, we can write the next hops for each node’s routing table:
Dr. Wei Liu, liuwei@hust.edu.cn 1 / 6
Question 13
Given the extended LAN shown in Figure 3.34, indicate which ports are not selected by the
spanning tree algorithm.
The selection mechanism of spanning tree algorithm:
(1) Select the bridge with smallest id as root
(2) Select the bridge on each LAN that is closest to the root as the designated bridge
(3) Each bridge decides if it is the designated bridge relative to each of its ports
In this example, B1 is the root bridge, since it has the smallest ID. There are three loops in the
figure 3.34:
Loop1: A‐B2‐D‐B3‐E‐B1‐C‐B7‐A
In this loop, B1 is the root, LAN segments C and E directly connect to B1. The nearest paths
for LAN segments A and D to B1 are from B7 and B3 respectively. No other multiple nearest paths
exist.
#bridge to root LAN Segment
文档评论（0）