scholarly journals PROXSEM: Interest-Based Proximity Measure to Improve Search Efficiency in P2P Systems

Author(s):  
Yann Busnel ◽  
Anne-marie Kermarrec
2013 ◽  
Vol 339 ◽  
pp. 285-291
Author(s):  
Yong Qiong Zhu ◽  
Rui Min Hu

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.


2009 ◽  
Author(s):  
Melissa R. Beck ◽  
Maura C. Lohrenz ◽  
J. G. Trafton

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.


2007 ◽  
Author(s):  
Elizabeth A. Krupinski ◽  
Hans Roehrig ◽  
Jiahua Fan

Sign in / Sign up

Export Citation Format

Share Document