The Efficient Approach in Peer-to-Peer Systems to Achieve High Efficiency

  • Lukman Santoso Universitas Sains dan Teknologi Komputer
  • Marcus Gunadi Wibawa Universitas Sains dan Teknologi Komputer
  • Muhamad Syarifudin Universitas Sains dan Teknologi Komputer
  • Priyadi Priyadi Universitas Sains dan Teknologi Komputer
  • Titi Christiana Universitas Sains dan Teknologi Komputer
Keywords: Consistency Maintenance, File Replication, Peer-to-Peer.

Abstract

Peer-to-peer systems nowadays are widely used because of the scalability and high reliability. File replication and consistency maintenance are widely used techniques to achieve high system performance. These techniques are connected to each other. The connection of these techniques is consistency maintenance is needed in file replication to keep the consistency between a file and the replicas. Traditional file replication and consistency maintenance methods need a high cost. The usage of IRM (Integrated file Replication and Consistency Maintenance inP2P systems) which will achieve high efficiency at a significantly lower cost can be used to solve this problem. IRM reduces redundant file replicas, consistency maintenance overhead, and unnecessary file updates.

References

[1]. H. Shen, “IRM: Integrated File Replication and Consistency Maintenance in P2P Systems,” Proc. IEEE 2010.
[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]. R. Cox, A. Muthitacharoen, and R.T. Morris, “Serving DNS Usinga Peer-to-Peer Lookup Service,” Proc. First Int’l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[4]. 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.
[5]. 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.
[6]. 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.
[7]. S. Tewari and L. Kleinrock, “On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks,” Proc. IFIP Networking, 2005.
[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.
Published
2022-07-12
How to Cite
Lukman Santoso, Marcus Gunadi Wibawa, Muhamad Syarifudin, Priyadi Priyadi, & Titi Christiana. (2022). The Efficient Approach in Peer-to-Peer Systems to Achieve High Efficiency. Journal of Technology Informatics and Engineering, 1(2), 25-29. https://doi.org/10.51903/jtie.v1i1.137