Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Document Ranking and the Vector-Space Model
IEEE Software
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Design of a robust search algorithm for p2p networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Design patterns from biology for distributed computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Bio-inspired Search and Distributed Memory Formation on Power-Law Networks
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Overhead reduction in a distributed path management system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-tuned refresh rate in a swarm intelligence path management system
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Self-adaptive and reconfigurable distributed computing systems
Applied Soft Computing
| Hi-index | 0.00 |
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network topology or data placement. The greatest advantage is the robustness provided by them. However, flooding-based query algorithms used by the networks produce enormous amounts of traffic and substantially slow down the system. Recently, flooding has been replaced by more efficient k-random walkers and different variants of such algorithms. In this paper, we report immune-inspired algorithms for searching peer to peer networks. The algorithms use the immune-inspired mechanism of affinity-governed proliferation to spread query message packets in the network. Through a series of experiments, we compare the proliferation mechanism with different variants of random walk algorithms.The detailed experimental results show message packets undergoing proliferation spread much faster in the network and consequently proliferation algorithms produce better search output in p2p networks than random walk algorithms. Moreover, theoretical results by calculating the packet spreading speeds are reported which provide an understanding of the improved performance of the proliferation based search algorithm.