148 search results - page 9 / 30 » Optimizing random walk search algorithms in P2P networks |
106
click to vote
MST
2006
14 years 9 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
TPDS
2008
14 years 9 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...