Sciweavers

4 search results - page 1 / 1
» Preferential walk: towards efficient and scalable search in ...
Sort
View
WWW
2005
ACM
14 years 1 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
GLOBECOM
2006
IEEE
14 years 1 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
INFOCOM
2005
IEEE
14 years 1 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
ERCIMDL
2006
Springer
161views Education» more  ERCIMDL 2006»
13 years 11 months ago
Scalable Semantic Overlay Generation for P2P-Based Digital Libraries
The advent of digital libraries along with the tremendous growth of digital content call for distributed and scalable approaches for managing vast data collections. Peer-to-peer (P...
Christos Doulkeridis, Kjetil Nørvåg, ...