Maya-Pyramid: A Scalable and Self-Organizing Unstructured P2P Overlay
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
HELC: a High Efficiency and Low Cost structured Peer-to-Peer overlay without Distributed Hash Table
International Journal of Autonomous and Adaptive Communications Systems
A survey of attack and defense techniques for reputation systems
ACM Computing Surveys (CSUR)
IPBGA: a hybrid P2P based grid architecture by using information pool protocol
The Journal of Supercomputing
| Hi-index | 0.07 |
Peer-to-peer systems can share the computing resources and services by directly communicating within a widely distributed network. It is important that these systems can efficiently locate, in as few hops as possible, the node storing the desired data in a large system. Thus, it is worth consuming some extra storage to obtain better routing performance. In this paper, we propose redundant strategies to improve the routing performance and data availability on Chord and De Bruijn topologies. Hybrid-Chord combines multiple chord rings and successors, and Redundant D2B maintains successors, to improve the routing performance. The proposed systems can reduce the number of lookup hops significantly (by as much as 50%) compared to the original ones, and have better fault tolerance capabilities, with a small storage overhead