计算机应用

• 网络与通信 • 上一篇    下一篇

基于DBR图的常数度P2P系统

闻炳海 周继鹏   

  1. 广西师范大学 暨南大学
  • 收稿日期:2008-03-25 修回日期:2008-05-03 发布日期:2009-01-01 出版日期:2009-01-01
  • 通讯作者: 闻炳海

New constant-degree P2P system based on DBR

Bing-Hai Wen Ji-Peng Zhou   

  • Received:2008-03-25 Revised:2008-05-03 Online:2009-01-01 Published:2009-01-01
  • Contact: Bing-Hai Wen

摘要: 通过将De Bruijn和Ring相结合,提出了一种新的常数度的DBR图(节点出度和入度均为2)。将DBR图应用到动态网络,设计并实现了常数度的P2P系统Tangram。Tangram的设计基于分布式哈希表,是一个可扩展的、完全无中心的和自组织的结构化P2P系统。对于节点规模为N的Tangram系统,路由表大小为O(1),平均的路由步数是O(log N),在路由表大小和路由步数之间达到了很好的平衡。通过模拟网络的实验表明,Tangram系统是稳定而高效的。

关键词: 对等计算, 常数度, 分布式哈希表, 覆盖网络

Abstract: This paper proposed a new constant-degree graph, DBR, which combined De Bruijn and Ring and kept 2 in-degrees and 2 out-degrees of a node. Adapting DBR to the dynamic network, we designed Tangram with constant-degree. Tangram was based on DHT. It was a scalable, completely decentralized and self-organizing structured P2P system. The routing algorithm of Tangram was composed of De Bruijn algorithm and Chord algorithm and achieved a time complexity of O(log N) per lookup request by using O(1) neighbors per node, where N was the network size. Experimental results show that Tangram is efficient.

Key words: peer-to-peer, constant-degree, dht, overlay network