Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A framework for evaluating the performance of cluster algorithms for hierarchical networks
IEEE/ACM Transactions on Networking (TON)
Free-riding and whitewashing in peer-to-peer systems
IEEE Journal on Selected Areas in Communications
Enhancing peer-to-peer systems through redundancy
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Locating content in an efficient and scalable way without centralized control is one of the challenges within P2P computing. The paper presents an unstructured P2P overlay called Maya pyramid overlay (MPO) where update and backup only take place in two neighboring levels or layers, differing from the recursive method in traditional hierarchical P2P tree-like structure overlay. Unlike normal redundant mechanisms for solving the single fault problem: Tri-Information Center (Tri-IC) mechanism is presented in order to improve robustness by alleviating the load of cluster heads in a hierarchical P2P overlay. A source ranking mechanism is proposed in order to discourage free riding and whitewashing and to encourage frequent information exchanges between peers. Evaluation proved that MPO is robust, highly efficient and of a low-cost.