常数度的结构化P2P系统Cycloid研究

Research on the Constant-Degree Structured P2P System: Cycloid

基于分布式哈希表的结构化P2P系统要维护严格的网络拓扑结构,在网络搅动剧烈时大量节点的加入和离开会产生巨大的开销。因此,维护较少的常数个邻居节点成为一些新的P2P系统的良好性质。Cycloid系统基于著名的立方体连接环(CCC),每个节点只要维护7个邻居,而具有O(logN)的网络直径。

Structured P2P system based on DHT must maintain a restricted topology,when the network churn happens,the joining and leaving nodes will lead to high overhead. Some new P2P systems have a good character that a node maintains simply constant number of neighbors. Cycloid based on cube-connected cycle has O(log n)hops per lookup request with only seven neighbors per node.