没有合适的资源?快使用搜索试试~ 我知道了~
3170103456-应承峻-作业五1
需积分: 0 0 下载量 22 浏览量
2022-08-03
14:56:51
上传
评论
收藏 131KB PDF 举报
温馨提示
试读
3页
1. Give two example computer applications for which connection-oriented service
资源详情
资源评论
资源推荐
浙江大学《计算机网络》课程课后作业五
应承峻 3170103456
1. Give two example computer applications for which connection-oriented service is
appropriate. Now give two examples for which connectionless service is best
Answer:
⚫ Connection-oriented Service:
◼ 文件传输
◼ 在线语音/视频通信
⚫ Connectionless Service:
◼ 表单处理
◼ 简单的数据请求
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.
Answer:
初始时的路由表
B
D
E
A
5
16
7
B
0
12
6
C
8
6
3
D
12
0
9
E
6
9
0
F
2
10
4
C->A:Dist(C, A) = Min( D(C, B) + D(B, A) , D(C, D) + D(D, A) , D(C, E) + D(E, A) ) = Min(11,
19, 12) = 10,故 C->A 的最短路径是 C->B->A
C->B:Dist(C, B) = Min(6+0, 3+12, 5+6) = 6 via B
C->D:Dist(C, D) = Min(6+12, 3+0, 5+9) = 3 via D
C->E:Dist(C, E) = Min(6+6, 3+9, 5+0) = 5 via E
C->F:Dist(C, F) = Min(6+2, 3+10, 5+4) = 8 via B
因此 C 更新后的路由表为:
A
10
B
B
6
B
C
0
-
D
3
D
E
5
E
F
8
B
3. Please give an example in which the poisoned reverse technique cannot prevent the count-
to-infinity problem and explain why.
Answer:
链路如下图所示
滚菩提哦呢
- 粉丝: 64
- 资源: 341
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论0