The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2013 vol.62)
pp: 2115-2130
Haiying Shen , Clemson University, Clemson
Guoxin Liu , Clemson University, Clemson
ABSTRACT
File replication is widely used in structured P2P systems to avoid hot spots in servers and enhance file availability. The number of replicas and replication distance affect the file replication cost. These two elements and the replica update frequency determined in the file replication stage also affect the cost of subsequent consistency maintenance. However, most existing file replication protocols focus on improving file lookup efficiency without considering its cost and its subsequent influence on consistency maintenance. This paper studies the problem about how a server chooses files to replicate and where to replicate files to achieve low cost in both file replication and consistency maintenance stages without compromising the effectiveness of file replication. This paper presents a lightweight and Cooperative multifactOr considered file Replication Protocol (CORP) to achieve this goal. CORP simultaneously takes into account multiple factors including file popularity, update rate, node available capacity, file load, and node locality, aiming to minimize the number of replicas, update frequency, and replication distance. CORP also dynamically adjusts the number of replicas based on ever-changing file popularity and visit pattern. Extensive experimental results from simulation and PlanetLab real-world testbed demonstrate the efficiency and effectiveness of CORP in comparison with other file replication protocols. It dramatically reduces the overhead of both file replication and consistency maintenance. In addition, it exhibits high adaptiveness to skewed lookups and yields significant improvement in reducing overloaded nodes. Specifically, compared to the other replication protocols, CORP can reduce more than 71 percent of file replicas, 84 percent of overloaded nodes, 94 percent of consistency maintenance cost, and 72 percent of file replication and consistency maintenance latency.
INDEX TERMS
Peer to peer computing, Maintenance engineering, Servers, Protocols, Complexity theory, Availability, Clustering methods,proximity, Peer-to-peer systems, file replication, consistency maintenance
CITATION
Haiying Shen, Guoxin Liu, "A Lightweight and Cooperative Multifactor Considered File Replication Method in Structured P2P Systems", IEEE Transactions on Computers, vol.62, no. 11, pp. 2115-2130, Nov. 2013, doi:10.1109/TC.2012.104
REFERENCES
[1] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM, 2001.
[2] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications," IEEE Trans. Networking, vol. 1, no. 1 pp. 17-32, Feb. 2003.
[3] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms Heidelberg (Middleware), pp. 329-350, 2001.
[4] B.Y. Zhao, J. Kubiatowicz, and A.D. Joseph, "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing," IEEE J. Selected Areas in Comm., vol. 12, no. 1, pp. 41-53, 2004.
[5] P. Maymounkov and D. Mazires, "Kademlia: A Peer-to-Peer Information Systems Based on the XOR Metric," Proc. Revised Papers First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[6] H. Shen, C. Xu, and G. Chen, "Cycloid: A Scalable Constant-Degree P2P Overlay Network," Performance Evaluation, vol. 63, no. 3 pp. 195-216, 2006.
[7] D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A Scalable and Dynamic Emulation of the Butterfly," Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC), 2002.
[8] M.F. Kaashoek and R. Karger, "Koorde: A Simple Degree-Optimal Distributed Hash Table," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.
[9] A. Rowstron and P. Druschel, "Storage Management and Caching in Past a Large-Scale Persistent Peer-to-Peer Storage Utility," Proc. 18th ACM Symp. Operating Systems Principles (SOSP), 2001.
[10] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-Area Cooperative Storage with CFS," Proc. 18th ACM Symp. Operating Systems Principles (SOSP), 2001.
[11] K. Huang, T. Huang, and C.Y. Chou, "LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems," Proc. Int'l Parallel and Distribute Processing Symp. (IPDPS), 2004.
[12] T. Pitoura, N. Ntarmos, and P. Triantafillou, "Replication Load Balancing and Efficient Range Query Processing in DHTs," Proc. 10th Int'l Conf. Advances in Database Technology (EDBT), 2006.
[13] V. Ramasubramanian and E. Sirer, "Beehive: The Design and Implementation of a Next Generation Name Service for the Internet," Proc. ACM SIGCOMM, 2004.
[14] T. Stading, P. Maniatis, and M. Baker, "Peer-to-Peer Caching Schemes to Address Flash Crowds," Proc. Revised Papers First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[15] 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.
[16] M. Theimer and M. Jones, "Overlook: Scalable Name Service on an Overlay Network," Proc. 32nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[17] M. Roussopoulos and M. Baker, "CUP: Controlled Update Propagation in Peer-to-Peer Networks," Proc. USENIX Ann. Technical Conf., 2003.
[18] 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.
[19] J. Lan, X. Liu, P. Shenoy, and K. Ramamritham, "Consistency Maintenance in Peer-to-Peer File Sharing Networks," Proc. IEEE Third Workshop Internet Applications (WIAPP), 2003.
[20] 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.
[21] Z. Li, G. Xie, and Z. Li, "Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems," Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS), 2008.
[22] X. Chen, S. Ren, H. Wang, and X. Zhang, "SCOPE: Scalable Consistency Maintenance in Structured P2P Systems," Proc. IEEE INFOCOM, 2005.
[23] 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.
[24] H. Shen, "GeWave: Geographically-Aware Wave for File Consistency Maintenance in P2P Systems," Proc. 37th Int'l Conf. Parallel Processing (ICPP), 2008.
[25] 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. Architectural Support for Programming Languages and Systems (ASPLOS), 2000.
[26] M. Waldman, A.D. Rubin, and L.F. Cranor, "Publius: A Robust Tamper-Evident,Censorship-Resistant Web Publishing System," Proc. Ninth USENIX Security Symp., 2000.
[27] T. Hu, S. Ardon, and A. Sereviratne, "Semantic-Laden Peer-to-Peer Service Directory," Proc. Fourth Int'l Conf. Peer-to-Peer Computing (P2P), 2004.
[28] M. Fontoura, "Law-Governed Peer-to-Peer Auctions," Proc. 11th Int'l Conf. World Wide Web (WWW), pp. 109-117, 2002.
[29] J. Zhu, J. Gong, W. Liu, T. Song, and J. Zhang, "A Collaborative Virtual Geographic Environment Based on P2P and Grid Technologies," Information Sciences: An Int'l J. Archive, vol. 177, pp. 4621-4633, 2007.
[30] J.Y. Tham, S.L. Lee, C.E. Tan, and L.C. Tee, "A Distributed Peer-to-Peer Platform for Synchronized Group Collaboration and Knowledge Sharing," Proc. Int'l Symp. Distributed Computing and Applications for Business Eng. and Science (DCABES), 2004.
[31] P2P Calendar Synchronizer, http://www.brothersoft.comp2p- calendar-synchronizer-47655.html , 2013.
[32] S. Iyer, A. Rowstron, and P. Druschel, "Squirrel: A Decentralized Peer-to-Peer Web Cache," Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC), 2002.
[33] B. Knutsson, M.M. Games, H. Lu, W. Xu, and B. Hopkins, "Peer-to-Peer Support for Massively Multiplayer Games," Proc. IEEE INFOCOM, 2004.
[34] V. Ramasubramanian and E.G. Sirer, "Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays," Proc. First Conf. Symp. Networked Systems Design and Implementation (NSDI), pp. 99-112, 2004.
[35] 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), 2008.
[36] 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.
[37] H. Shen, "IRM: Integrated File Replication and Consistency Maintenance in P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 1, pp. 100-113, Jan. 2010.
[38] H. Shen, "Plover: Proactive Low-Overhead File Replication in Structured P2P Systems," J. Parallel and Distributed Computing, vol. 69, pp. 429-440, 2009.
[39] J. Zhou, L.N. Bhuyan, and A. Banerjee, "An Effective Pointer Replication Algorithm in P2P Networks," Proc. IEEE Int'l Parallel and Distribute Processing Symp. (IPDPS), pp. 1-11, 2008.
[40] T. Liu, M. Bao, G. Chang, and Z. Tan, "The Improved Research of Chord Based on File-Partition Replication Strategy," Proc. IEEE Ninth Int'l Conf. Hybrid Intelligent Systems (HIS), 2009.
[41] W.K. Lin, C. Ye, and D.M. Chiu, "Decentralized Replication Algorithms for Improving File Availability in P2P Networks," Proc. IEEE 15th Workshop Quality of Service (IWQoS), 2007.
[42] J. Ni, S.J. Harrington, and N. Sharma, "Designing File Replication Schemes for Peer-to-Peer File Sharing Systems," Proc. IEEE Int'l Conf. Comm. (ICC), 2008.
[43] H. Shen and C.Z. Xu, "Hash-Based Proximity Clustering for Efficient Load Balancing in Heterogeneous DHT Networks," J. Parallel and Distributed Computing, vol. 68, pp. 686-702, 2008.
[44] P. Godfrey and I. Stocia, "Heterogeneity and Load Balance in Distributed Hash Tables," Proc. IEEE INFOCOM, 2005.
[45] M. Bienkowski, M. Korzeniowski, F.M. auf der Heide, and F.M. Heide, "Dynamic Load Balancing in Distributed Hash Tables," Proc. Fourth Int'l Conf. Peer-to-Peer Systems (IPTPS), 2005.
[46] Y. Zhu and Y. Hu, "Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 349-361, Apr. 2005.
[47] S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica, "Load Balancing in Dynamic Structured P2P Systems," Performance Evaluation, vol. 63, no. 3, pp. 217-240, 2006.
[48] Z. Xu, M. Mahalingam, and M. Karlsson, "Turning Heterogeneity into an Advantage in Overlay Routing," Proc. IEEE INFOCOM, 2003.
[49] T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmaier, "Space Filling Curves and Their Use in Geometric Data Structure," Theoretical Computer Science, vol. 181, no. 1, pp. 3-15, 1997.
[50] F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, "Towards a Common API for Structured P2P Overlays," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), 2003.
[51] E. Zegura, K. Calvert, and S. Bhattacharjee, "How to Model an Internetwork," Proc. IEEE INFOCOM, 1996.
[52] PlanetLab, http:/www.planet-lab.org/, 2013.
[53] C. Huang, J. Li, and K.W. Ross, "Can Internet Video-on-Demand Be Profitable," Proc. ACM SIGCOMM, 2007.
[54] E.S. HertelJr. et al., "CTH: A Software Family for Multi-Dimensional Shock Physics Analysis," Proc. 19th Int'l Symp. Shock Waves, 1993.
[55] H. Shen, "Corp: A Cooperative File Replication Protocol for Structured P2P Networks," Proc. Int'l Conf. High Performance Computing (HiPC), 2009.
82 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool