IEEE Internet Computing
Design patterns from biology for distributed computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Automatic Community Discovery in Peer-to-Peer Systems
GCCW '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing Workshops
Design of a robust search algorithm for p2p networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
The existing literature deals with the problems dealing with decentralized content-based P2P community formation and community-based search separately. Contrary to this approach, in this paper we propose a novel search algorithm that has both the capability to form the community structure as well as search it with maximum efficiency. The key contribution is to design a self-organized and adaptive search algorithm where as the community topology evolves with time, the search process adapts automatically to the situation to provide best performance. It performs an automatic transition from the exploratory phase to search phase, by estimating the global state of communities using a local control parameter. Moreover, we show that the strategy is also robust enough to improve search performance even under node churn, though a graceful degradation in overall performance is seen. We consider realistic power-law distribution for node degrees and information profiles. The proposed search strategy shows more than twice efficiency than a pure random walk with proliferation on the same network.