DESIGN OF EFFICIENT SEARCHING ALGORITHMS FOR UNSTRUCTURED PEER TO PEER NETWORKS

Abstract

quotNowadays Peer-to-peer networks are very popular and common on small local newlinearea networks. Both wired and wireless home networks can be configured as Peer-to-peer newlinenetworks. Much research is being done on peer-to-peer networks for various purposes. newlineThis research work aims to find some efficient searching algorithms or techniques to newlinesearch resources in unstructured peer-to-peer network. In this research work, an efficient newlinealgorithm the Search Result Path Caching (SRPC) is developed to solve the search time newlineissues of the existing algorithms. In this algorithm, the dynamic searching method is newlinefollowed. As per this new algorithm, both breadth first search and depth first search are newlinefollowed to find a resource. The path results obtained upon searching are stored in a path newlinehash table. While searching, the search peer first evaluates its path table to find whether newlinethe path of the resource is available or not. If it is exists, the source node retrieves it from newlinethe table. This path table concept saves more search time and so this algorithm is better newlinethan the previous algorithm as shown by the results. If there is no path, it will send a newlinequery message to all the nodes to find the resource. In a P2P network, nodes may join or newlineleave the network. If a node leaves, that particular path becomes invalid. So, as per this newlinealgorithm, the path table is periodically checked to remove invalid paths. This periodical newlinechecking of the invalid paths is a new technique of this algorithm. newlineThe second algorithm proposed in this dissertation is the Friend and Path Result newlineSharing (FRPS) algorithm. This algorithm is developed to solve the issues like the newlinegeneration of a lot of query messages inside the network, more search cost, more network newlinetraffic and poor scalability of the existing algorithms. In this algorithm, the friend set and newlineHOF node (head of the friend set) concepts are involved. The HOF node is the head of all newlineiii newlinenodes in its friend set or group. The source node sends query messages only to the HOF newlinenodes. This HOF node can answer a qu