A Study on Peer-to-Peer Allocation for File Sharing Systems

Authors

  • K. Ravikumar  Assistant Professor, Department of Computer Science, Tamil University (Established by the Govt. of Tamilnadu), Thanjavur, Tamil Nadu, India
  • S. Ambika  Research Scholar, Department of Computer Science, Tamil University, Thanjavur, Tamil Nadu, India

DOI:

https://doi.org//10.32628/CSEIT1952253

Keywords:

Peer-to-Peer Content Distribution, File Sharing System, Social Networking, and Cloud Computing.

Abstract

Many Internet renovate supplier (ISPs) have organize peer-to-peer (P2P) hoard in their system in order to decrease valuable inter-ISP transfer. Capable heading question is important to the in general presentation of peer-to-peer (P2P) file contribution systems. Come together aristocracy by their extensive soothe can significantly get better the good quality association of file hesitation. Clustering aristocracy by their corporeal nearness can also get better file enquiry recital. P2P rose to successful profitable system in the internet. It represent the best embodiment of the end to end quarrel, the regularly doubtful plan philosophy that guide the intend of the internet. A work of fiction P2P architecture is planned which attaches ratings to the uploaded text directly. These ratings then develop into as score constituent in its XML statement which has quite a few youngster basics for in twist classification. Eventually, we communicate possible attack on the secrecy of these system and provide examples of demanding attack and martial protector second-hand by the organization we elucidate.

References

  1. H. Schulze and K. Mochalski, “Internet Study 2008/2009,” 2009. [Online]. Available: http://www.ipoque.com/resources/internet-studies
  2. P. Eckersley, F. von Lohmann, and S. Schoen, “Packet forgery by ISPs: A report on the Comcast affair,” White paper, Nov. 2007.
  3. V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P systems co-operate for improved performance?” SIGCOMM Comput. Commun. Rev., vol. 37, no. 3, pp. 29–40, Jul. 2007.
  4. Peer-to-Peer Systems, (2001)” in Proc. International Conference on Distributed Systems Platforms (Middleware), pp. 329–350.
  5. D. Frey, A.-M. Kermarrec, M. Raynal, J. Stainer, (2013) "Trust-aware peer sampling: Performance and privacy tradeoffs", Theor. Comput. Sci., vol. 512, pp. 67-83.
  6. W. Galuba, K. Aberer, Z. Despotovic, W. Kellerer, (2010) "Leveraging social networks for increased bittorrent robustness", Proc. 7th IEEE Conf. Consumer Commun. Netw. Conf., pp. 159-163.
  7. R. Eidenbenz, T. Locher, R. Wattenhofer, “Hidden Communication in P2P Networks Steganographic Handshake and Broadcast,” Proc. of IEEE INFOCOM 2011, April 2011, pp. 954–962.
  8. S. Hand, T. Roscoe, “Mnemosyne: Peer-to-Peer Steganographic Storage”, Proc. of IPTPS 2002, LNCS 2429, pp. 130–140, 2002.
  9. R. Anderson, R. Needham, A. Shamir. “The Steganographic File System,” Proc. of International Workshop on Information Hiding, 1998.
  10. W. Mazurczyk, M. Smolarczyk, K. Szczypiorski, “Retransmission Steganography and Its Detection,” Soft Computing, Vol. 15, Issue 3, pp. 505–515, 2011.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2019-04-30

Issue

Volume 5, Issue 2, March-April-2019

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
K. Ravikumar, S. Ambika, " A Study on Peer-to-Peer Allocation for File Sharing Systems, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 5, Issue 2, pp.1014-1018, March-April-2019. Available at doi : https://doi.org/10.32628/CSEIT1952253