The Community for Technology Leaders
RSS Icon
Issue No.12 - December (2008 vol.19)
pp: 1695-1708
Zhenyu Li , Institution of Computing Technology, Chinese Academy of Sciences, Beijing
Gaogang Xie , Institution of Computing Technology, Chinese Academy of Sciences, Beijing
Zhongcheng Li , Institution of Computing Technology, Chinese Academy of Sciences, Beijing
Consistency maintenance mechanism is necessary for the emerging Peer-to-Peer applications due to their frequent data updates. Centralized approaches suffer single point of failure, while previous decentralized approaches incur too many duplicate update messages because of locality-ignorant structures. To address this issue, we propose a scalable and efficient consistency maintenance scheme for heterogeneous P2P systems. Our scheme takes the heterogeneity nature into account and forms the replica nodes of a key into a locality-aware hierarchical structure, in which the upper layer is DHT-based and consists of powerful and stable replica nodes, while a replica node at the lower layer attaches to a physically close upper layer node. A d-ary update message propagation tree (UMPT) is dynamically built upon the upper layer for propagating the updated contents. As a result, the tree structure does not need to be maintained all the time, sav-ing a lot of cost. Through theoretical analyses and comprehensive simulations, we examine the efficiency and scalability of this design. The results show that, compared with previous designs, especially locality-ignorant ones, our approach is able to reduce the cost by about 25-67 percent.
Distributed Systems, Distributed networks, Performance evaluation of algorithms and systems
Zhenyu Li, Gaogang Xie, Zhongcheng Li, "Efficient and Scalable Consistency Maintenance for Heterogeneous Peer-to-Peer Systems", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 12, pp. 1695-1708, December 2008, doi:10.1109/TPDS.2008.46
[1] M. Waldman, A.D. Rubin, and L.F. Cranor, “Publius: A Robust, Tamper-Evident, Censorship-Resistant Web-Publishing System,” Proc. Ninth USENIX Security Symp., Aug. 2000.
[2] Gnutella Protocol Specification v0.6, http://rfc-gnutella.sourceforge. net/src rfc-0_6-draft.html, 2008.
[3] KaZaA, http:/, 2008.
[4] V. Duvvuri, P. Shenoy, and R. Tewari, “Adaptive Leases: A Strong Consistency Mechanism for the World Wide Web,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, pp. 1266-1276, Sept./Oct. 2003.
[5] J. Yin, L. Alvisi, M. Dahlin, and C. Lin, “Hierarchical Cache Consistency in a WAN,” Proc. Second USENIX Symp. Internet Technologies and Systems (USITS '99), Oct. 1999.
[6] S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz, “Maintenance-Free Global Data Storage,” IEEE Internet Computing, vol. 5, no. 5, pp. 40-49, Sept. 2001.
[7] S. Ratnasamy, P. Francis, M. Handley, and R. Karp, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM '01, Aug. 2001.
[8] K. Aberer and Z. Despotovic, “Managing Trust in a Peer-2-Peer Information System,” Proc. 10th Int'l Conf. Information and Knowledge Management (CIKM '01), Oct. 2001.
[9] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, Aug. 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 '01), Oct. 2001.
[11] X. Chen, S. Ren, H. Wang, and X. Zhang, “SCOPE: Scalable Consistency Maintenance in Structured P2P Systems,” Proc. IEEE INFOCOM '05, Mar. 2005.
[12] B.T. Loo, R. Huebsch, I. Stoica, and J.M. Hellerstein, “The Case for a Hybrid P2P Search Infrastructure,” Proc. Third Int'l Workshop Peer-to-Peer Systems (IPTPS '04), Feb. 2004.
[13] 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 '03), May 2003.
[14] 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 '03), June 2003.
[15] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th ACM Int'l Conf. Supercomputing (ICS '02), June 2002.
[16] R. Tian, Y. Xiong, Q. Zhang, B. Li, B.Y. Zhao, and X. Li, “Hybrid Overlay Structure Based on Random Walk,” Proc. Fourth Int'l Workshop Peer-To-Peer Systems (IPTPS '05), Feb. 2005.
[17] S. Tewari and L. Kleinrock, “Proportional Replication in Peer-to-Peer Networks,” Proc. IEEE INFOCOM '06, Apr. 2006.
[18] J. Liang and K. Nahrstedt, “RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications,” Proc. IEEE INFOCOM '06, Apr. 2006.
[19] Z. Xu, C. Tang, and Z. Zhang, “Building Topology-Aware Overlays Using Global Soft-State,” Proc. 23rd Int'l Conf. Distributed Computing Systems (ICDCS '03), May 2003.
[20] T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmaier, “Space Filling Curves and Their Use in the Design Geometric Data Structures,” Theoretical Computer Science, vol. 181, no. 1, pp. 3-15, July 1997.
[21] E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM, 1996.
[22] S. Saroiu, K. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN '02), Jan. 2002.
[23] Z. Li, G. Xie, and Z. Li, “Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems,” Proc. 21st Int'l Parallel and Distributed Processing Symp. (IPDPS '07), Mar. 2007.
[24] Q. Lv, S. Ratnasamy, and S. Shenker, “Can Heterogeneity Make Gnutella Scalable,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[25] X. Liu, J. Lan, P. Shenoy, and K. Ramamritham, “Consistency Maintenance in Dynamic Peer-to-Peer Overlay Network,” Computer Networks, vol. 50, no. 6, pp. 859-876, Apr. 2006.
[26] Z. Wang, S.K. Das, M. Kumar, and H. Shen, “Update Propagation through Replica Chain in Decentralized and Unstructured P2P Systems,” Proc. Fourth Int'l Conf. Peer-to-Peer Computing (P2P '04), Aug. 2004.
[27] Z. Wang, M. Kumar, S.K. Das, and H. Shen, “File Consistency Maintenance through Virtual Servers in P2P Systems,” Proc. 11th IEEE Symp. Computers and Comm. (ISCC '06), June 2006.
[28] M. Roussopoulos and M. Baker, “CUP: Controlled Update Propagation in Peer-to-Peer Networks,” Proc. USENIX Ann. Technical Conf., 2003.
[29] L. Yin and G. Cao, “DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer,” Proc. 21st IEEE Int'l Conf. Data Eng. (ICDE), 2005.
[30] H. Shen and C. Xu, “Hash-Based Proximity Clustering for Load Balancing in Heterogeneous DHT Networks,” Proc. 20th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2006.
[31] 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.
[32] K.P. Gummadi, R. Gummadi, S.D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, “The Impact of DHT Routing Geometry on Resilience and Proximity,” Proc. ACM SIGCOMM'03, Aug. 2003.
[33] Z. Wang, S.K. Das, M. Kumar, and H. Shen, “An Efficient Update Propagation Algorithm for P2P systems,” Computer Comm., vol. 30, no. 5, pp. 1106-1115, Mar. 2007.
[34] Y. Liu, L. Xiao, and L.M. Ni, “Building a Scalable Bipartite P2P Overlay Network,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 9, pp. 1296-1306, Sept. 2007.
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool