Efficient Search Techniques in Peer to Peer Networks

In order to use Internet resources efficiently we need to search and locate information efficiently. System performance diminishes by either duplicating a large quantity of data on each and every node or flooding query to all the nodes in the network. Firstly, this paper reviews various searching algorithms. Search techniques can be classified as blind search in which information about neighbors is not kept by the peer and informed search where peers store information for routing queries to other nodes. It discusses how range queries can be processed efficiently by rotating scheme over structured P2P systems and secure searching algorithm based on topology adaptation which penalizes the malicious peers. Genetic algorithm providing parallel search are also covered in the paper. Lastly, it focuses on merits, demerits and applicability of these algorithms in different situations