Optimizing random walk search algorithms in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design of a peer-to-peer system for optimized content replication
Computer Communications
Analysis models for unguided search in unstructured P2P networks
International Journal of Ad Hoc and Ubiquitous Computing
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Improving Search on Gnutella-Like P2P Systems
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Modeling message propagation in random graph networks
Computer Communications
Research on direction search algorithm based on LAN agent in P2P network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
DTDS: LAN agent-based dynamic transmit direction search algorithm in P2P network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling random walk search algorithms in unstructured P2P networks with social information
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Evaluation of models for analyzing unguided search in unstructured networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Analyzing stability of algorithmic systems using algebraic constructs
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Enhancing decentralized service discovery in open service-oriented multi-agent systems
Autonomous Agents and Multi-Agent Systems
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
In this paper we develop a model for random walk search mechanism in unstructured P2P networks. Using the model we obtain analytical expressions for the performance metrics of random walk search in terms of the popularity of the resource being searched for and the parameters of random walk. We propose an equation based adaptive search mechanism that uses estimate of popularity of a resource in order to choose the parameters of random walk such that a targeted performance level is achieved by the search. We also propose a lowoverhead method for maintaining an estimate of popularity that utilizes feedback (or lack there-off) obtained from previous searches. Simulation results show that the performance of the equation based adaptive search is significantly better than the non-adaptive random walk.