There are certain difficulties in ensuring the consistency of data sharing and distribution on structured P2P substrate because of the requirements of simultaneous processing interacted by many users and peer's input/output or updated speed. This paper presents a high effective solution which is proposed for structured P2P substrate, uses the updated dissemination tree and proposes a method using buffer and index vectors in order to "condition" between the requests and processes of updating. The experimental results conducted on Oversim are aimed at comparing the efficiency of new proposed solution with that of Nakashima. The experimental results indicate that the new proposed is highly effective in ensuring the consistency (over 90%) and satisfies the requirements of latency of update propagation. Especially, in case the peer’s input/output or updated speed is high, the new proposed also achieve greater efficiency.
Gnutella Org Gnutella, http://www.gnutella.org.
Nathaniel S, and Aaron Krekelberg, Good, Usability and privacy: a study of Kazaa P2P file-sharing, Proceedings of the SIGCHI conference on Human factors in computing systems,ACM,pp. 137-144, 2003.
Ian, et al Clarke, Freenet: A distributed anonymous information storage and retrieval system, Designing Privacy Enhancing Technologies, Springer Berlin Heidelberg, pp. 46-66, 2001.
A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,IFIP/ACM International Conference on Distributed Systems Platforms and Open Distributed Processing, Springer Berlin Heidelberg, pp. 329-350, 2001.
B. Y . Zhao, J. D. Kubiatowicz, and A. D. Joseph, Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD-01-1141, Vol. 214, U. C. Berkeley, April 2001.
S. Ratnasamy, P . Francis, M. Handley, R. Karp, and S. Shenker, A Scalable Content-Addressable Network, Proc. of ACM SIGCOMM, Vol. 31, No. 4, pp. 161-172, Aug. 2001
G. Pierre, and M. V. Steen G. Urdaneta, A decentralized wiki engine for collaborative wikipedia hosting, WEBIST,pp. 156-163, 2007.
D. Schioberg, L. H. Vu, and A. Datta S. Buchegger, Peerson: P2p social networking early experiences and insights, Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, ACM, pp. 46-52, 2009.
Jun, et al Wang, Distributed collaborative filtering for peer-to-peer file sharing systems, Proceedings of the 2006 ACM symposium on Applied computing, ACM, pp. 1026-1030, 2006.
David, and Jörn Kuhlenkamp. Bermbach, Consistency in distributed storage systems, Networked Systems, Springer Berlin Heidelberg, pp. 175-189, 2013.
Ingmar, Bernhard Heep, and Stephan Krause. Baumgart, OverSim: A flexible overlay network simulation framework, IEEE Global Internet Symposium,IEEE, pp. 79-84, 2007.
Takayoshi, and Satoshi Fujita. Nakashima, Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing Systems, Computing and Networking (CANDAR), 2013 First International Symposium on, IEEE, pp. 187-193, 2013.
M. H., AND ABERER, K A. DATTA, "Updates in highly unreliable, replicated peer-to-peer systems",Distributed Computing Systems, 2003. Proceedings. 23rd International Conference,IEEE, pp. 76-85, 2003.
Zhijun, et al WANG, An efficient update propagation algorithm for P2P systems, Computer Communications, pp 1106-1115, 2007(30.5).
Zhenyu LI, Gaogang XIE, and Zhongcheng LI, Efficient and scalable consistency maintenance for heterogeneous peer-to-peer systems, IEEE Transactions on Parallel and Distributed Systems, pp 1695-1708, 2008(19.12).
Haiying, Guoxin Liu, and Harrison Chandler Shen, Swarm intelligence based file replication and consistency maintenance in structured P2P file sharing systems, IEEE Transactions on Computers, pp. 2953-2967, 2015.
Xin, et al Chen, SCOPE: Scalable consistency maintenance in structured P2P systems, in 24th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1502-1513, 2005.
Josef. Steindl, The Pareto Distribution, Palgrave Macmillan UK, Economic Papers, pp. 321-327, 1990.
Lada A., and Bernardo A. Huberman. Adamic, Zipf’s law and the Internet, Glottometrics, pp. 143-150, 2002.
CƠ QUAN CHỦ QUẢN: BỘ THÔNG TIN VÀ TRUYỀN THÔNG (MIC)
Giấp phép số 69/GP-TTĐT cấp ngày 26/12/2014.
Tổng biên tập: Vũ Chí Kiên
Tòa soạn: 110-112, Bà Triệu, Hà Nội; Điện thoại: 04. 37737136; Fax: 04. 37737130; Email: email@example.com
Ghi rõ nguồn “Tạp chí Công nghệ thông tin và truyền thông” khi phát hành lại thông tin từ website này