文件名称:luyousuanfa
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.42kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1、发现它的邻居节点,并知道其网络地址。
2、测量到各邻居节点的延时或开销。
3、构造一个分组,分组中包含所有它刚刚知道的信息。
4、将这个分组发送给所有其他的路由器。
5、计算出到每个其他路由器的最短距离。
-1, found in its neighbor nodes, and to know its network address. 2, measured to the neighbor node latency or overhead. 3, constructs a packet, packet contains all the information it had just know. 4, this packet sent to all other routers. 5, calculated to each other the minimum distance between routers.
2、测量到各邻居节点的延时或开销。
3、构造一个分组,分组中包含所有它刚刚知道的信息。
4、将这个分组发送给所有其他的路由器。
5、计算出到每个其他路由器的最短距离。
-1, found in its neighbor nodes, and to know its network address. 2, measured to the neighbor node latency or overhead. 3, constructs a packet, packet contains all the information it had just know. 4, this packet sent to all other routers. 5, calculated to each other the minimum distance between routers.
相关搜索: minimum distance packet
路由 节点
(系统自动生成,下载前可以参看下载内容)
下载文件列表
路由算法2.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.