148 search results - page 3 / 30 » Optimizing random walk search algorithms in P2P networks |
169
click to vote
INFOSCALE
2006
ACM
15 years 11 months ago
2006
ACM
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
172
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
152
click to vote
INFOCOM
2007
IEEE
16 years 1 days ago
2007
IEEE
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
147
click to vote
GCC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
139
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...