32 search results - page 2 / 7 » Modeling Random Walk Search Algorithms in Unstructured P2P N... |
147
click to vote
INFOSCALE
2006
ACM
15 years 10 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...
134
click to vote
INFOCOM
2007
IEEE
15 years 10 months 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 ...
135
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
141
click to vote
AP2PC
2004
Springer
15 years 9 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
175
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
—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...