搜索资源列表
rip
- 实现网络层rip协议（距离矢量路由算法）-rip network layer protocol (distance vector routing algorithm)
Multipath_aodv
- 按需路由协议- AODV AODV（Ad Hoc on demand distance vector) C++源代码
DVcode
- VC环境下编译的网络层路由Distance Vector算法，可自行输入节点数，算出路径。
distanceroute.c
- fatmck@163.com编的距离向量路由算法-fatmck@163.com series of the distance vector routing algorithm
动态路由
- 详细介绍了路由及路由器的概念，路由器的功能，工作原理，路由表，路由算法分类等。学习使用距离矢量算法（Distance Vector Algorithm）的动态路由。并附有相应的tcl文件
mrouted-3.9.6.tar.bz2
- README for mrouted, the DVMRP Multicast Routing Daemon ====================================================== mrouted is an implementation of the DVMRP multicast routing protocol. It turns a UNIX workstation into a DVMRP multicast router with tunnel
mrouted-3.9.6 mrouted 是支持tunnel的DVMRP多播路由协议的实现
- mrouted 是支持tunnel的DVMRP多播路由协议的实现，此版本为2011-10-23的最新版 -mrouted is an implementation of the DVMRP multicast routing protocol. It turns a UNIX workstation into a DVMRP multicast router with tunnel support, in order to cross non-multicast-aware r
rip
- 基于rip协议的距离向量算法 收到相邻路由器（地址为X）的每一个rip报文 1，先修改此报文中的所有项目：将“下一跳”字段中的地址都改为X，并将所有的“距离”字段的值加1 2，对修改后的报文中的每一个项目，重复以下步骤 若项目中的目的网络不在路由表中，则将该项目添加到路由表中 否则，若下一跳字段给的路由器地址是同样的，则将收到的项目替换原路由表中的项目 否则，若收到的项目中的距离小于路由表中的距离，则进行更新 否则，设么也不做-Rip protocol b
luyousuanfa
- 编写一程序实现动态路由算法动态路由算法分为: 距离矢量路由算法和链路状态路由算法，-Procedures for the preparation of a dynamic routing algorithm to achieve dynamic routing algorithm as follows: distance vector routing algorithm and link state routing algorithm,
aodv-uu-0.9.5
- AODV路由协议源码aodv-uu-0.95，AODV是平面按需距离矢量路由协议，广泛用于无线传感器网络和移动自组网。此协议代码可用于NS2等仿真软件对路由的移植。-The source routing protocol AODV aodv-uu-0.95, AODV is flat demand distance vector routing protocol that is widely used in wireless sensor networks and mobile ad hoc n
DSDV
- 这个程序实现网络层距离向量算法和udp协议，使用socket编程，可以在linux上运行。内含Makefile、可执行文件、源代码、README。-This program network layer distance vector algorithm and udp protocols, the use of socket programming, you can run on linux. Contains Makefile, executable files, source code, R
Ad-hoc
- A major issue with ad-hoc networks is energy consumption since nodes are usually mobile and battery-operated. In this project we compared the performance of ad-hoc routing protocols in a network where each participating mobile node has a given
luyou
- 距离矢量路由和链路状态路由算法的模拟，用java实现-Distance vector routing and link state routing algorithm simulation, with the java implementation
myRouteralm
- java语言模拟的路由选择算法，链路状态和距离矢量-java language simulation of routing algorithm, link state and distance vector
aodv-uu-0.9.5
- AODV-UU is an AODV (Ad hoc On-demand Distance Vector) routing protocol implementation from Uppsala University. Key features are recent draft compliance, stability, and the ability to use it in both real-world (Linux) and ns-2 simulations
SampleCode-C
- C实现距离向量算法 C实现距离向量算法-C to achieve the realization of the distance vector algorithm distance vector algorithm C
DSDV.tcl.tar
- destination sequence distance vector
105230321aodv
- 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm
MyRouter
- 基于距离矢量算法的路由器模拟实验，并包含软件设计文档-Algorithm based on distance vector router simulation experiments, and includes software design document