Building a P2P Overlay Network for Efficient Search

Xin Sun; Yushu Liu; Yue He
December 2008
Journal of Digital Information Management;Dec2008, Vol. 6 Issue 6, p456
Academic Journal
Efficient search is a challenge aspect in P2P applications for their increasing scales, dynamic and heterogeneous characteristics. The topological properties of P2P overlay networks are one of the important factors that dominate the performance of search. In order to reduce large of redundant P2P traffic due to topology mismatch between the P2P overlay network and the physical network, we proposes an self-organized and fault-tolerant P2P overlay network model taking advantage of the heterogeneous characters of nodes to integrate nodes according to physical distance and similar shared resources, in which nodes are clustered into domains according to physical distance, and the nodes in a domain are clustered into groups according to similar resources. A semantic-based search algorithm is also designed which can make full use of the overlay network structure. Comparing the performance of search with other search mechanisms in various overlay networks, simulation experiments show that the model of our claims can significantly shorten the latency of the searching process and reduce the searching overhead.


Related Articles

  • Combining search and trust models in unstructured peer-to-peer networks. Mashayekhi, Hoda; Habibi, Jafar // Journal of Supercomputing;Jul2010, Vol. 53 Issue 1, p66 

    Effectiveness of Peer-to-Peer (P2P) systems highly depends on efficiency and scalability of their search algorithms. Moreover, managing trust is a key issue for wide acceptance of P2P computing. Surprisingly, the majority of the available trust systems ignore the underlying search algorithm and...

  • Distributed Cooking Recipe Recommendation and Adaptation. Qing Li; Wei Chen; Lijuan Yu // Journal of Software (1796217X);Mar2013, Vol. 8 Issue 3, p528 

    In this paper, we propose a distributed recipe recommendation mechanism that utilizes social information for adaptive recipe recommendation in a peer-to-peer (P2P) network. A recipe flavor model is first proposed for modeling recipes and validating recipe adaptations. Peers in the network group...

  • An Efficient Search Algorithm in Decentralized Peer-to-Peer Networks. Kumar, N. Ranjeeth; Deepika, N. // International Journal of Computer Technology & Applications;2012, Vol. 3 Issue 1, p102 

    To Design efficient search algorithms is a key challenge in decentralized peer-to-peer networks. Flooding and random walk (RW) are two previous search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not...

  • Efficient Search Techniques in Peer to Peer Networks. Bhatia, Tarunpreet; Garg, Deepak // International Journal of Computer Applications;Dec2011, Vol. 36, p31 

    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...

  • Knowledge and Cache based Adaptive Query Searching in Unstructured P2P Networks. Ramachandran, G.; Selvakumar, K. // International Journal of Computer Applications;6/15/2012, Vol. 48, p4 

    Efficient search is a challenging task in unstructured peer-topeer networks. In this paper, Knowledge and Cache based Adaptive Query Searching (KCAQS) is proposed that adaptively performs a query searching through either directed flooding or biased random walk based on the number of hop counts...

  • An Effective Searching Mechanism of Reducing Redundancy in Unstructured P2P Network. Fan Deming; Li Jingyi // International Journal of Advancements in Computing Technology;Dec2011, Vol. 3 Issue 11, p216 

    Search efficiency and accuracy of resource are important considerations for search algorithm in peer-to-peer (P2P) network. Most search algorithms use flooding among neighbor nodes to search relevant resource. However, this usually causes great amount of redundant messages, which results in high...

  • Heuristic search algorithm based on "HowNet" in P2P network. Tai Xiang; Tian-Jiu Leng; Ding-Song Ma // Applied Mechanics & Materials;2014, Issue 644-650, p2685 

    This paper is a study on minimum query peers and apply glossary semantic similarity of "HowNet" to P2P search. It introduces and analyzes the intelligence search algorithm and the glossary semantic similarity of "HowNet". Based on the intelligence search algorithm, heuristic search algorithm on...

  • Delay Reduction by Providing Location Based Services using Hybrid Cache in peer to peer Networks. Krishnan, C. Gopala; Rengarajan, A.; Manikandan, R. // KSII Transactions on Internet & Information Systems;Jun2015, Vol. 9 Issue 6, p2078 

    Now a days, Efficient processing of Broadcast Queries is of critical importance with the ever-increasing deployment and use of mobile technologies. BQs have certain unique characteristics that the traditional spatial query processing in centralized databases does not address. In novel query...

  • An Optimized and Improved Network Trust Model Based on P2P. Wei Li; Zhao Chunjian // Journal of Networks; 

    Because of the spring up of the P2P network application, its open, anonymous and self-organized characteristics has offered a path for the spreading of virus and junk data, and the security has aroused people's common concern. The traditional network trust model dealt with dishonest node has...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics