Description: 非常著名的P2P计算项目的源代码。对于研究P2P的拓扑构造、DHT算法等有着巨大的帮助-most famous peer-to-peer computing project's source code. For research P2P topology structure, DHT algorithm has a tremendous help Platform: |
Size: 82967 |
Author:steven |
Hits:
Description: 非常著名的P2P计算项目的源代码。对于研究P2P的拓扑构造、DHT算法等有着巨大的帮助-most famous peer-to-peer computing project's source code. For research P2P topology structure, DHT algorithm has a tremendous help Platform: |
Size: 82944 |
Author:steven |
Hits:
Description: It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu -It provides multiple routing (DHT) algori thms such as Chord, Kademlia, Koorde. Pastry and Tapestry. and a distributed environment emu Platform: |
Size: 210944 |
Author:古月 |
Hits:
Description: 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）为距离度量基础，建立了一种
全新的DHT拓扑结构，相比于其他算法，大大提高了路由查询速度。
在2005 年5 月著名的BiTtorrent 在4.1.0 版实现基于Kademlia 协议的DHT 技术后，
很快国内的BitComet 和BitSpirit 也实现了和BitTorrent 兼容的DHT 技术，实现
trackerless下载方式。
另外，emule 中也很早就实现了基于Kademlia类似的技术（BT中叫DHT，emule中也叫
Kad，注意和本文简称的Kad 区别），和BT 软件使用的Kad 技术的区别在于key、value 和
node ID 的计算方法不同。-We describe a peer-to-peer system which has provable
consistency and performance in a fault-prone
environment. Our system routes queries and locates
nodes using a novel XOR-based metric topology that
simplifies the algorithm and facilitates our proof.
The topology has the property that every message
exchanged conveys or reinforces useful contact information.
The system exploits this information to
send parallel, asynchronous query messages that tolerate
node failures without imposing timeout delays
on users. Platform: |
Size: 509952 |
Author:libing |
Hits:
Search - dht chord source code