Skip to Main Content
Existing search algorithms for peer to peer networks are based on broadcast of query messages over the relationship connectivity among nodes in the network. In this paper, we describes our research effort to design and implement an agent based adaptive search algorithm that allows for searching in distributed systems. Autonomous adaptive agents are modeled after several ecological concepts and mechanisms. We focus on the problem of actively changing the topology of the peer to peer network by utilizing Schelling's segregation model to improve the efficiency of search. Our simulation results show that the proposed algorithm is scalable and robust to dynamic changes in a network.