473 search results - page 4 / 95 » Local Search in Unstructured Networks |
144
Voted
CAMP
2005
IEEE
15 years 9 months ago
2005
IEEE
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
134
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...
126
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
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...
128
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
112
click to vote
JSAC
2007
15 years 3 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...