搜索资源列表
Dijkstra_router
- Dijkstra最短路径算法,稍作修改亦可作为最短路由算法-Dijkstra shortest path algorithm, can be slightly amended as the shortest routing algorithm
mrsim-win
- winwods下的组播路由算法仿真程序, vc6开发,是根据上次传的linux版本 改编而成。-winwods the multicast routing algorithm simulation program, vc6 development, is based on the previous version of Linux-wing.
pointtopointDijkstraAlgrithms
- 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtai
1Router
- 计算机网络编程-距离矢量路由算法演示程序。-computer network programming-distance vector routing algorithm demonstration program.
maodv
- 改进的适用于mannet网络的动态路由协议,maodv协议是源驱动的协议-improved network ManNet applicable to the dynamic routing protocol, maodv agreement is the agreement source drive
SATSP-MATLAB1
- 再加一个SA的程序说明文件 车辆路径问题-SA with a descr iption of the procedures for document vehicle routing problem
aomdv-code.tar
- 一个无线自组网aodv路由的扩展版---AOMDV(多径路由协议)。-a wireless network aodv since routing the expansion version-- AOMDV (more Routing Protocol).
test_md5
- 著名的加密算法md5的通用算法,并有单次算法和多次算法的直接演算-famous encryption algorithm md5 generic algorithms, and algorithm for single and multiple direct routing algorithm
ant1
- 利用蚂蚁算法解决TSP旅行商问题,用他能直接输出路由接点-use TSP ant algorithm to solve the traveling salesman problem, in his direct contact output routing
DistanceVector_Routing
- Distance Vector Routing,也称为Bellman-Ford shortest path algorithm。基本思想是: 每个路由器(路由结点)都维持一张路由表,包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息,据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表,并按照下列规则更新其路由表: -发现了一条到达某目的结点的新路由,而该路由在原来的路由表中不存在(即发
anonymous_p2p
- Java下模拟实现p2p平台下的洋葱路由协议,这个文件是客户端!-Java platform p2p Simulation of onion routing protocol, the document is the client!
vrpnewGASA
- 遗传算法求解车辆路径问题,没有解压缩的密码。-Genetic Algorithm for vehicle routing problem, no extract passwords.
WindowsApplication24zhang
- 模拟退火和遗传算法混和求解车辆路径问题的程序,没有解压密码。-simulated annealing and genetic algorithms hybrid vehicle routing problem solving process, not extracting passwords.
P2Pthesis
- 摘 : 通过使用 peer-to-peer(P2P)计算模式在 Internet 物理拓扑基础上建立一个称为 P2P 覆盖网络(P overlay network)的虚拟拓扑结构,有效地建立起一个基于 Internet 的完全分布式自组织网络路由模型 集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称 HASN).分别描述了 HASN 由模型的构建
IPRouting
- 这是一本介绍Linux平台下的Ip路由方面的书籍,对于构建一个安全的Linux平台的用户来说,是必须掌握和了解的。-This is a Linux platform on the Ip routing of books, Construction of a security for the Linux users, must grasp and understand.
aodv-uu-0.9.2
- 无线自组织网络路由协议:按需距离矢量协议源代码-self-organizing wireless network routing protocols : on-demand distance vector source code agreement
dsr-uu-0[1].2.tar
- 无线自组织网络协议,动态源路由协议源代码-self-organizing wireless network protocol, dynamic source routing protocol source code
ospfd.10.tar
- 路由协议ospf实现源码,linux下的ospf的实现-routing protocol ospf achieve source code, under the linux ospf Implementation
AODV-UIUC-0.5.tar
- AODV,一种自组织网络路由协议,可实现动态路由接入。linux版本-AODV, a self-organizing network routing protocols, dynamic routing access. Linux version
MCRGSA
- MCRGSA------组播路由问题遗传模拟退火算法 %M-----------遗传算法进化代数 %N-----------种群规模,取偶数 %Pm----------变异概率调节参数 %K-----------同一温度下状态跳转次数 %t0----------初始温度 %alpha-------降温系数 %beta--------浓度均衡系数 %ROUTES------备选路径集 %Num-----