The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2010 vol.21)
pp: 100-113
Haiying (Helen) Shen , Clemson University, Clemson
In peer-to-peer file sharing systems, file replication and consistency maintenance are widely used techniques for high system performance. Despite significant interdependencies between them, these two issues are typically addressed separately. Most file replication methods rigidly specify replica nodes, leading to low replica utilization, unnecessary replicas and hence extra consistency maintenance overhead. Most consistency maintenance methods propagate update messages based on message spreading or a structure without considering file replication dynamism, leading to inefficient file update and hence high possibility of outdated file response. This paper presents an Integrated file Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in a systematic and harmonized manner. It achieves high efficiency in file replication and consistency maintenance at a significantly low cost. Instead of passively accepting replicas and updates, each node determines file replication and update polling by dynamically adapting to time-varying file query and update rates, which avoids unnecessary file replications and updates. Simulation results demonstrate the effectiveness of IRM in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of both file replication and consistency maintenance approaches.
File replication, consistency maintenance, peer-to-peer, distributed hash table.
Haiying (Helen) Shen, "IRM: Integrated File Replication and Consistency Maintenance in P2P Systems", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 1, pp. 100-113, January 2010, doi:10.1109/TPDS.2009.43
[1] R. Kumar, J. Liang, and K.W. Ross, “The FastTrack Overlay: A Measurement Study,” Computer Networks, vol. 50, no. 6, pp. 842-858, 2006.
[2] A. Rowstron and P. Druschel, “Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proc. ACM Symp. Operating Systems Principles (SOSP), 2001.
[3] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stocia, “Wide Area Cooperative Storage with CFS,” Proc. ACM Symp. Operating Systems Principles (SOSP), 2001.
[4] T. Stading, P. Maniatis, and M. Baker, “Peer-to-Peer Caching Schemes to Address Flash Crowds,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[5] V. Gopalakrishnan, B. Silaghi, B. Bhattacharjee, and P. Keleher, “Adaptive Replication in Peer-to-Peer Systems,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS), 2004.
[6] Gnutella Home Page, http:/, 2008.
[7] R. Cox, A. Muthitacharoen, and R.T. Morris, “Serving DNS Using a Peer-to-Peer Lookup Service,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[8] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, Feb. 2003.
[9] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, pp. 329-350, 2001.
[10] G. Xie, Z. Li, and Z. Li, “Efficient and Scalable Consistency Maintenance for Heterogeneous Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 12, pp. 1695-1708, Dec. 2008.
[11] X. Chen, S. Ren, H. Wang, and X. Zhang, “SCOPE: Scalable Consistency Maintenance in Structured P2P Systems,” Proc. IEEE INFOCOM, 2005.
[12] P. Druschel, M. Castro, A.-M. Kermarrec, and A. Rowstron, “Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,” IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.
[13] M. Roussopoulos and M. Baker, “CUP: Controlled Update Propagation in Peer to Peer Networks,” Proc. USENIX Ann. Technical Conf., 2003.
[14] L. Yin and G. Cao, “DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks,” Proc. 21st Int'l Conf. Data Eng. (ICDE), 2005.
[15] A. Datta, M. Hauswirth, and K. Aberer, “Updates in Highly Unreliable, Replicated Peer-to-Peer Systems,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS), 2003.
[16] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Proc. Int'l Workshop Design Issues in Anonymity and Unobservability, pp. 46-66, 2001.
[17] J. Lan, X. Liu, P. Shenoy, and K. Ramamritham, “Consistency Maintenance in Peer-to-Peer File Sharing Networks,” Proc. Third IEEE Workshop Internet Applications (WIAPP), 2003.
[18] M. Theimer and M. Jones, “Overlook: Scalable Name Service on an Overlay Network,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[19] K. Huang, T. Huang, and J. Chou, “LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2004.
[20] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, “OceanStore: An Architecture for Global-Scale Persistent Storage,” Proc. Int'l Conf. Architectural Support for Programming Languages and Operating Systems, 2000.
[21] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Int'l Conf. Supercomputing (ICS), 2001.
[22] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM, 2002.
[23] S. Tewari and L. Kleinrock, “Analysis of Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGMETRICS, 2005.
[24] S. Tewari and L. Kleinrock, “On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks,” Proc. IFIP Networking, 2005.
[25] S. Tewari and L. Kleinrock, “Proportional Replication in Peer-to-Peer Network,” Proc. IEEE INFOCOM, 2006.
[26] D. Rubenstein and S. Sahu, “Can Unstructured P2P Protocols Survive Flash Crowds?” IEEE/ACM Trans. Networking, vol. 13, no. 3, pp. 501-512, June 2005.
[27] Q. Yang, W. Xiao, and J. Ren, “PRINS: Optimizing Performance of Reliable Internet Storages,” Proc. 26th Int'l Conf. Distributed Computing Systems (ICDCS), p. 32, 2006.
[28] H. Shen, “EAD: An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems,” Proc. Eighth Int'l Conf. Peer-to-Peer Computing (P2P '08), 2008.
[29] D. Tsoumakos and N. Roussopoulos, “APRE: An Adaptive Replication Scheme for Unstructured Overlays,” Proc. 14th Int'l Conf. Cooperative Information Systems (CoopIS), 2006.
[30] M. Raunak, P. Shenoy, B. Urgaonkar, A. Ninan, and K. Ramamritham, “Maintaining Mutual Consistency for Cached Web Objects,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS), 2001.
[31] A. Muthitacharoen, B. Chen, and D.M. Eres, “A Low-Bandwidth Network File System,” Proc. ACM Symp. Operating Systems Principles (SOSP), pp. 174-187, 2001.
[32] rsync,, 2009.
[33] W.R. Stevens, TCP/IP Illustrated, vol. 1, Addison-Wesley, 1994.
[34] H. Shen, “IRM: Integrated File Replication and Consistency Maintenance in P2P Systems,” Proc. IEEE 17th Int'l Conf. Computer Comm. and Networks (ICCCN), 2008.
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool