Enhancing similarity based query searching performance using self organized semantic overlay networks

In nowadays network community,(P2P) networks are flourishing as a fine candidate for resource sharing over internet. In unstructured network, overlay is constructed freely without any strict constraints on top of the internet infrastructure leads to major confront in P2P searching with efficient resource discovery. In the existing unstructured Peer-to-Peer (P2P) searching scheme supports the file name or keyword based limited search techniques. Therefore, efficient search is a challenging task in unstructured networks. Mainly, the major basic issues in P2P networks are i) how to locate the peers efficiently to provide response for requested query. The novel decentralized P2P construction algorithm is proposed to enhance the searching process in unstructured overlay P2P networks. The main aspect is to restructure and optimize the unstructured p2p overlay based on properties such as high clustering among similar peers, low diameter among the distinct peers to rapidly propagate the query message between them and overlay links must be very progressive. This approach constructs the optimized overlay in a decentralized manner by exploiting the similarity of participating peers. Therefore, it does not need centralized servers to perform query searching therefore it can reach the destination peer by progressively and effectively exploiting peer similarity on search path. This approach exhibits file sharing pattern based on property of power-law that leads to achieve precise performance guarantees in terms of the less routing hop count and the flourishing query ratio.