【摘要】 许多结构式P2P系统使用DHT技术将数据映射到相应的节点,以便在数据的存放与查找方面有很好的扩展性.但是,在节点数为n的网络中,大多数结构式P2P系统的每一次查询(lookup)都需要O(logn)步,而且每个节点都要维护O(logn)个邻居.该文提出了一种新的常数度数的P2P系统,它模仿立方体互连圈(CubeConnectedCycle)的拓扑结构,命名为Cycloid.在节点数为n=d×2d的Cycloid系统中,每次查询只要Ο(d)步,并且每个节点只需要维护Ο(1)个邻居.模拟实验表明,在网络规模较大和节点出入频繁的动态P2P网络中,Cycloid比其它常数度数的P2P系统(如Viceroy和Koorde)具有更好的性能,尤其是Cycloid具有更高的搜索效率、更均匀的数据分配、更平衡的节点负载.更多还原

【Abstract】 Many structured P2P systems use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require Ο(logn) hops per lookup request with Ο(logn) neighbors per node, where n is the network size. This paper presents a constant-degree P2P architecture, namely Cycloid, which emulates a Cube Connected Cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of Ο(d) per lookup request by using Ο(1) neighbors per node, where n =d×2 d . Authors compare Cycloid with other two constant-degree systems, Viceroy and Koorde, in various architectural aspects via simulation. The simulation shows that Cycloid has more advantages for large scale and dynamic systems that have frequent node arrivals and departures. In particular, Cycloid delivers a higher location efficiency in the average case and exhibits a more balanced distribution of keys and query loads between the nodes.更多还原