A Hybrid Query Scheme to Speed Up Queries in Unstructured Peer-to-Peer Networks

Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate resources. However, existing query schemes, for example, flooding, random walks, and interest-based shortcut suffer various problems in reducing communication overhead and in shortening response time. In this paper, we study the possible problems in the existing approaches and propose a new hybrid query scheme, which mixes inter-cluster queries and intracluster queries. Specifically, the proposed scheme works by efficiently locating the clusters, sharing similar interests with intercluster queries, and then exhaustively searching the nodes in the found clusters with intracluster queries. To facilitate the scheme, we propose a clustering algorithm to cluster nodes that share similar interests, and a labeling algorithm to explicitly capture the clusters in the underlying overlays. As demonstrated by extensive simulations, our new query scheme can improve the system performance significantly by achieving a better tradeoff among communication overhead, response time, and ability to locate more resources.

Download Full-text

An Efficient Search Scheme in Unstructured Peer-to-Peer Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.211-212.295 ◽

2011 ◽

Vol 211-212 ◽

pp. 295-299 ◽

Cited By ~ 3

Author(s):

Ya Dong Gong ◽

He Ping Deng ◽

Zhan Ran Gu ◽

Ji Ye Hu ◽

Yong Xiang Wen

Keyword(s):

Success Rate ◽

System Performance ◽

Peer To Peer ◽

Query Answering ◽

Peer Networks ◽

Search Efficiency ◽

P2p Networks ◽

Peer To Peer Networks ◽

High Bandwidth ◽

Simulation Results

In peer-to-peer (P2P) networks, nodes are quite different from each other in many aspects, such as sharing resources, online time and bandwidth. Some approaches have been introduced to take advantage of the query forwarding and answering heterogeneity such that the high bandwidth and query answering capability of nodes can be fully utilized to improve the system performance. In this paper, we suggest using the online time heterogeneity to improve the search efficiency of P2P networks. In our proposed Differentiated Index (Diff-Index) algorithm, the nodes with long online time will have higher priority to be queried. Because the online time is quite different among nodes, much search traffic can be saved by querying only a small portion of a network. The query success rate can be kept high because the nodes sharing a great amount of resources tend to have long online time. Our simulation results show that the Diff-Index algorithm can save 66 percent of search traffic.

Download Full-text

An Improved Hybrid Peer-to-Peer System with Caching for Distributed Data Sharing

International Journal of Smart Sensor and Adhoc Network. ◽

10.47893/ijssan.2012.1062 ◽

2012 ◽

pp. 193-199

Author(s):

Arpana George

Keyword(s):

Data Sharing ◽

System Performance ◽

Overlay Networks ◽

Peer To Peer ◽

The Other ◽

Peer Networks ◽

Distributed Data ◽

Peer To Peer Networks ◽

Caching Scheme ◽

Regular Topology

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected by a regular topology, and unstructured peer-to-peer networks in which the topology is arbitrary. Structured peer-to-peer networks usually can provide efficient and accurate services but need to spend a lot of effort in maintaining the regular topology. On the other hand, unstructured peer-to-peer networks are extremely resilient to the frequent peer joining and leaving but this is usually achieved at the expense of efficiency. The objective of this work is to design a hybrid peer-to-peer system for distributed data sharing which combines the advantages of both types of peer-to-peer networks and minimizes their disadvantages. Also a caching scheme is proposed for the hybrid peer-to-peer system to improve the system performance.

Download Full-text

A Novel Core-Peer Based Trust Model for Peer-to-Peer Networks

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2017.6135 ◽

2017 ◽

Vol 14 (1) ◽

pp. 114-118

Author(s):

Dengfeng Wei ◽

Qing-Ju Jiao

Keyword(s):

Trust Model ◽

Peer Networks ◽

P2p Network ◽

Communication Overhead ◽

Network Resources ◽

Network Nodes ◽

The Public ◽

The Core ◽

Trust Relationships ◽

Peer To Peer Networks

In this paper, the P2P network node trust relationships and transactions are less likely to feature on the P2P network trust model based on the core nodes. Network nodes in the network model to the public reputation and private credibility clustering rely on node reliability for core nodes and node points to discuss and give relevant solutions. Simulation results show that the trust model not only has a robust anti-malicious node attack has a lower assessment of the amount of computation and communication overhead, network resources search.

Download Full-text