Agent Based Search Algorithm in Distributed Environments

Peer-to-peer networks have become increasingly popular over the past few years. Resource discovery is a main problem in the operation of the distributed environment. This paper describes our research effort to design and implement an agent based search algorithm that allows for searching in highly dynamic network. In this algorithm, we models autonomous adaptive agents after several ecological concepts and mechanisms. The algorithm is entirely distributed, and therefore scales well with the size of the network. As an experiment result, we compare its performance to the conventional schemes of random walker and message flooding.