An Optimal Replica Placement Algorithm for Symphony P2P Networks

被引：0

作者：

Chang, Tien-Yu ^{[1
]}

Tsai, Jichiang ^{[1
]}

Chang, Che-Cheng ^{[1
]}

机构：

[1] Natl Chung Hsing Univ, Dept Elect Engn, Taichung 40227, Taiwan

来源：

2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP) | 2012年

关键词：

Peer-to-peer (P2P) Network; Chord; Symphony; Replicas; Placement Algorithms; SERVICE;

D O I：

10.1109/PAAP.2012.29

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Placing replicas in a P2P network can reduced the number of hops required by a node to search an object. One existing replica placement strategy for structured P2P networks allocates replicas at nodes that are continuously close to the destination. In this paper, we investigate the effectiveness of such an approach. We propose an optimal algorithm to place replicas for an object, in terms of number of hops, in the deterministic P2P network (Chord) and randomized P2P network (Symphony). Particularly, our replica placement algorithm is based on the technique of dynamic programming. We perform several experiments to find the optimal replica placements for a large number of Symphony networks and analyze the results. Our simulation results show that locations of optimal replica placements are not necessarily continuously close to the destination.

引用

页码：141 / 148

页数：8

共 22 条

[1] [Anonymous], 2001, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, DOI DOI 10.1007/3-540-45518-3_18
[2] Castro M., 2003, Operating Systems Review, V37, P298, DOI 10.1145/1165389.945474
[3] Chen Y, 2002, LECT NOTES COMPUT SC, V2429, P306
[4] NetTube: Exploring Social Networks for Peer-to-Peer Short Video Sharing
Cheng, Xu
Liu, Jiangchuan
[J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1152 - 1160
[5] Replication strategies in unstructured peer-to-peer networks
Cohen, E
Shenker, S
[J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2002, 32 (04) : 177 - 190
[6] DABEK F, 2001, P ACM S OP SYST PRIN
[7] Ghodsi A., 2005, P DBISP2P 05, P74, DOI [10.1007/978-3-540-71661-7_7, DOI 10.1007/978-3-540-71661-7_7]
[8] Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables
Harvesf, Cyrus
Blough, Douglas M.
[J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (03) : 419 - 433
[9] Stork: Making data placement a first class citizen in the Grid
Kosar, T
Livny, M
[J]. 24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2004, : 342 - 349
[10] On the impact of replica placement to the reliability of distributed brick storage systems
Lian, Q
Chen, W
Zhang, Z
[J]. 25th IEEE International Conference on Distributed Computing Systems, Proceedings, 2005, : 187 - 196

← 1 2 3 →