文件名称:rfc3561.txt
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:42.55kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
本协议用于特定网络中的可移动节点。它能在动态变化的点对点网络中确定一条到目的
地的路由,并且具有接入速度快,计算量小,内存占用低,网络负荷轻等特点。它采用目的
序列号来确保在任何时候都不会出现回环(甚至在路由控制信息出现异常的时候也是如
此),避免了传统的距离数组协议中会出现的很多问题(比如无穷计数问题)。-The Ad hoc On-Demand Distance Vector (AODV) routing protocol is
intended for use by mobile nodes in an ad hoc network. It offers
quick adaptation to dynamic link conditions, low processing and
memory overhead, low network utilization, and determines unicast
routes to destinations within the ad hoc network. It uses
destination sequence numbers to ensure loop freedom at all times
(even in the face of anomalous delivery of routing control messages),
avoiding problems (such as "counting to infinity") associated with
classical distance vector protocols.
地的路由,并且具有接入速度快,计算量小,内存占用低,网络负荷轻等特点。它采用目的
序列号来确保在任何时候都不会出现回环(甚至在路由控制信息出现异常的时候也是如
此),避免了传统的距离数组协议中会出现的很多问题(比如无穷计数问题)。-The Ad hoc On-Demand Distance Vector (AODV) routing protocol is
intended for use by mobile nodes in an ad hoc network. It offers
quick adaptation to dynamic link conditions, low processing and
memory overhead, low network utilization, and determines unicast
routes to destinations within the ad hoc network. It uses
destination sequence numbers to ensure loop freedom at all times
(even in the face of anomalous delivery of routing control messages),
avoiding problems (such as "counting to infinity") associated with
classical distance vector protocols.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
rfc3561.txt.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.