搜索资源列表
DHT_Search_algorithm
- 一篇关于p2p中DHT搜索算法的文章，分析的很透彻-a DHT search algorithms for p2p in the article, very thorough analysis
basic_of_P2P.ppt
- p2p对等网络的综述，包括原理、结构、算法等-p2p peer-to-peer network synthesis, including the principle, structure, algorithms, etc.
ChordExpress
- 实现了P2P系统中采用的一种DHT算法——Chord算法，能够有效地节省节点存储的路由信息。经过测试，在局域网环境下可以达到10M/s。-Chord, one of DHT algorithms which can spare memory efficentily applied in the peer-to-peer network has been implemented. The transmisson speed in LAN reaches 10M/s.
P2P-algorithm
- P2P的算法，有emule的还有bt的，kad算法，dht算法，非常详细；适合大家研究p2p算法。-P2P algorithms, there is emule also bt' s, kad algorithm, dht algorithm, in great detail suitable for everyone to consider p2p algorithm.
P2p
- p2p算法概述 分类 构件与算法 关键技术特性 P2P分析与比较 研究与未来 -Algorithms for classification p2p key technical characteristics of components and algorithm analysis and comparison of P2P and the Future
Kademlia
- Kademlia协议（以下简称Kad）是美国纽约大学的PetarP. Maymounkov和David Mazieres. 在2002年发布的一项研究结果《Kademlia: A peerto -peer information system based on the XOR metric》。 简单的说，Kad 是一种分布式哈希表（DHT）技术，不过和其他 DHT 实现技术比较，如 Chord、CAN、Pastry 等，Kad 通过独特的以异或算法（XOR）为距离度量基础，建立了一种 全
p2p_sim_12_21
- This P2P simulator is used in the evaluation of trust management algorithms
Copy_of_p2pnew
- 该文件为P2P在流言算法和普通算法之下的性能比较的程序，并且利用GUI设计使得两种算法的对比很容易看出-The file is in the rumor P2P algorithms and general algorithm performance comparison under the procedures and the use of two algorithms GUI design makes it easy to see the contrast
AdjacencyMatrixIndex_torus
- 光网可靠性分析，matlab实现。。自我修复功能，分析光网网络可靠性的算法-Optical network reliability analysis, matlab realize. . Self-healing capabilities, network reliability analysis algorithms optical network
Initial-Scripts
- Power control, broadly speaking, is the intelligent selection of transmitter power output in a communication system to achieve good performance within the system. The notion of good performance can depend on context and may include optimizing metrics
one
- 一种端到端的机会网络开发，实现了很多经典路由算法以及移动模型，值得学习-the System is mainly used to exploit the opportunistic mobile network, realizing most of typical algorithms and moving model, which is a resource deserving to further study.