15 search results - page 2 / 3 » Search with Probabilistic Guarantees in Unstructured Peer-to... |
GLOBECOM
2006
IEEE
13 years 11 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...
CCGRID
2003
IEEE
13 years 10 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
WEBDB
2005
Springer
13 years 10 months ago
2005
Springer
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
CN
2010
13 years 1 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— A novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query me...