Dynamic Semantic Data Replication for K-Random Search in Peer-to-Peer Networks

We present a dynamic semantic data replication scheme called DSDR for classic k-random search in unstructured peer-to-peer (P2P) networks. During its k-random search each peer periodically updates its local view on the semantic overlay of the network based on observed queries (demand) and received information about provided items (supply), in particular their semantics. Peers dynamically form potentially overlapping groups for semantically equivalent or similar items they are actually demanding. Besides, each peer predicts the number of needed item replicas in the future based on its local observations in the past. The decision of which item to best replicate to which member is made within each demander group based on the maximal expected utility, traffic costs, and plausibility of such replication. Our experimental evaluation evidences that k-random search with DSDR-based replication can significantly outperform its combination with a near-optimal but non-semantic replication strategy, as well as a peer expertise-based semantic P2P search without replication.

[1]  Alejandro P. Buchmann,et al.  Maintaining replicas in unstructured P2P systems , 2008, CoNEXT '08.

[2]  Bin Liu,et al.  Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[3]  Gerhard Weikum,et al.  Near-optimal dynamic replication in unstructured peer-to-peer networks , 2008, PODS.

[4]  Christos Doulkeridis,et al.  DESENT: decentralized and distributed semantic overlay generation in P2P networks , 2007, IEEE Journal on Selected Areas in Communications.

[5]  Steffen Staab,et al.  Bibster - A Semantics-Based Bibliographic Peer-to-Peer System , 2004, SEMWEB.

[6]  Simon Parsons,et al.  Qualitative methods for reasoning under uncertainty , 2001 .

[7]  Ben Y. Zhao,et al.  Searching for Rare Objects Using Index Replication , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[8]  Nobuo Yamashita,et al.  Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem , 2011, Journal of Optimization Theory and Applications.

[9]  Jorge J. Moré,et al.  The Levenberg-Marquardt algo-rithm: Implementation and theory , 1977 .

[10]  Ruixuan Li,et al.  Proactive replication for rare objects in unstructured peer-to-peer networks , 2012, J. Netw. Comput. Appl..

[11]  Ioannis G. Nikolakopoulos,et al.  Optimal decomposition of P2P networks based on file exchange patterns for multimedia content search & replication , 2007, MIR '07.

[12]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[13]  Haiying Shen,et al.  An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems , 2008, IEEE Transactions on Parallel and Distributed Systems.

[14]  Matthias Klusch,et al.  Risk Driven Semantic P2P Service Retrieval , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[15]  Jussi Kangasharju,et al.  Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search , 2007, SIGCOMM '07.

[16]  Jonathan D. Cryer,et al.  Time Series Analysis , 1986 .

[17]  Sabu M. Thampi,et al.  Survey of Search and Replication Schemes in Unstructured P2p Networks , 2010, Netw. Protoc. Algorithms.

[18]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.