搜索资源列表
commmag
- 产生随机的网络拓扑（包括节点位置及流量），然后产生所有可能的进度表并计算其可达到的速率。另外，也可用更为精确的物理层模型来进行速率计算。-random network topology (including the location and flow nodes), and then have all the possible schedule and calculate the rate can be achieved. Besides, it also can be used for mor
peerCast0_1.tar
- peercast，国外大学的一个P2P流媒体的仿真程序。可以仿真节点的路由。-peercast, foreign universities in a peer-to-peer streaming media simulation program. The simulator can Routing nodes.
RC_CN
- 局域网的分布实时仿真中时统系统的一种实现方法的节点程序-LAN distributed real-time simulation system at the EC as a method of nodes procedures
DistanceVector_Routing
- Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是： 每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条
OADV routing protocol implement in c++
- In AODV, routes are discovered in an on-demand basis and are maintained as long as they are required. Like DSDV it maintains a sequence number, which it increases each time it finds a change in the topology of its neighborhood. This sequence number e