72 search results - page 3 / 15 » Ant Algorithms for Search in Unstructured Peer-to-Peer Netwo... |
ICC
2009
IEEE
14 years 2 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...
LCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
ADHOC
2010
13 years 4 months ago
2010
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
AP2PC
2004
Springer
14 years 1 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...
ICPP
2007
IEEE
14 years 1 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...