A Replica Relocation Method for Improving Search Efficiency in P2P Networks

2009 ◽  
Author(s):  
Toshiki Watanabe ◽  
Yong Zhao ◽  
Akimitsu Kanzaki ◽  
Takahiro Hara ◽  
Shojiro Nishio
Keyword(s):  
Search Efficiency ◽  
P2p Networks

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

2011 ◽  
Vol 211-212 ◽  
pp. 295-299 ◽  
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.

A Replication Algorithm Considering the Node Traffic for P2P Networks

2013 ◽  
Vol 339 ◽  
pp. 285-291
Author(s):  
Yong Qiong Zhu ◽  
Rui Min Hu
Keyword(s):  
Success Rate ◽  
Peer To Peer ◽  
P2p Network ◽  
Search Efficiency ◽  
P2p Networks ◽  
P2p Systems ◽  
Replication Method ◽  
Hit Rate ◽  
Unstructured P2p Network ◽  
Unstructured P2p

In this paper we focus on replication method in unstructured Peer-to-Peer (P2P) networks. Most current replication approaches are designed for the structured P2P systems. The EAD is specific for the unstructured P2P network, but the replica utilization is low and has the bump problem. In order to acquire more replica utilization and search efficiency, we propose a decentralized replication methodsFTR. The proposed algorithm can calculate the real query flow of node according to the order of the node selected. Experiment on the simulation proves that our method can enhance search success rate and replica hit rate.

Approximate Aggregation of Time-Varying Data in P2P Networks

2010 ◽  
Vol 20 (7) ◽  
pp. 1800-1811
Author(s):  
Si-Yao CHENG ◽  
Shou-Xu JIANG ◽  
Jian-Zhong LI
Keyword(s):  
Time Varying ◽  
P2p Networks ◽  
Approximate Aggregation

Overlays in Mobile P2P Networks

2014 ◽  
Vol 24 (1) ◽  
pp. 139-152
Author(s):  
Guo-Yin ZHANG ◽  
Jun LI
Keyword(s):  
P2p Networks ◽  
Mobile P2p ◽  
Mobile P2p Networks

A Review on the Churn Character of P2P Networks

2011 ◽  
Vol 34 (9) ◽  
pp. 1563-1577
Author(s):  
Zhi-Peng FU ◽  
Huai-Min WANG ◽  
Dian-Xi SHI ◽  
Peng ZOU
Keyword(s):  
P2p Networks

A Measure of Search Efficiency in a Real World Search Task (PREPRINT)

2009 ◽  
Author(s):  
Melissa R. Beck ◽  
Maura C. Lohrenz ◽  
J. G. Trafton
Keyword(s):  
Real World ◽  
Search Task ◽  
Search Efficiency
Sign in / Sign up

Export Citation Format

Share Document