Sciweavers

148 search results - page 7 / 30
» Optimizing random walk search algorithms in P2P networks
Sort
View
WWW
2005
ACM
15 years 5 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
CISIM
2007
IEEE
15 years 6 months ago
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a P...
Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo...
P2P
2005
IEEE
119views Communications» more  P2P 2005»
15 years 5 months ago
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unst...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, As...
79
Voted
AINA
2008
IEEE
15 years 6 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
90
Voted
ICDCS
2007
IEEE
15 years 6 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta