CFP last date
20 December 2024
Reseach Article

Enhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers)

Published on December 2011 by Kaushik Sekaran
Network Security and Cryptography
Foundation of Computer Science USA
NSC - Number 3
December 2011
Authors: Kaushik Sekaran
d601388c-5182-4f98-bf52-9f289864537f

Kaushik Sekaran . Enhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers). Network Security and Cryptography. NSC, 3 (December 2011), 22-26.

@article{
author = { Kaushik Sekaran },
title = { Enhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers) },
journal = { Network Security and Cryptography },
issue_date = { December 2011 },
volume = { NSC },
number = { 3 },
month = { December },
year = { 2011 },
issn = 0975-8887,
pages = { 22-26 },
numpages = 5,
url = { /specialissues/nsc/number3/4338-spe034t/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Network Security and Cryptography
%A Kaushik Sekaran
%T Enhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers)
%J Network Security and Cryptography
%@ 0975-8887
%V NSC
%N 3
%P 22-26
%D 2011
%I International Journal of Computer Applications
Abstract

Peer-to-peer networks are useful for the file transferring within the group of peers in the network. But usually files are transferred in slow speed, if the files are larger in size. Also the peers don’t have much utility within them. In order to enhance the utilities of the individual peers, each peer has to configure with greater CPU power, bandwidth, and storage space. But practically it is an impossible task, as the cost goes high by configuring peers with higher configuration. So my approach is to monitor the network carefully and to find out some random peers and to configure, say in a hundred peer attached network, one peer has to be configured with higher configuration. That will enhance the transfer speed among all peers. I introduce a new term called “G-peers”, gargantuan peers, which is having all the utility with it. These G-peers are useful in securing and transferring files at a higher speed and enhance the overall performance of the network. By adding repeated G-peers in the network, it is notable that it will increase the speed of file transfer and also the files are much secured as we are transferring using G-peers authentication. Therefore, a high success rate can be achieved within the Peer-to-peer network by these G-peers.

References
  1. S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems”, Proc. Multimedia Computing, 2002.
  2. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. SIGCOMM, 2003.
  3. Q. Lv, S. Ratnasamy, and S. Shenker, “Can Heterogeneity Make Gnutella Scalable?” Proc. Int’l Workshop Peer-to-Peer Systems (IPTPS), 2002.
  4. E. Adar and B.A. Huberman, “Free Riding on Gnutella,” http://www.firstmonday.dk/issues/issue5_10/adar/, 2003.
  5. B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” J. Selected Areas in Comm., 2004.
  6. R.M. Stoica, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
  7. B.F. Cooper, “An Optimal Overlay Topology for Routing Peer-to-Peer Searches,” Proc. IFIP/ACM Middleware Conf., 2005.
  8. B.F. Cooper, “Quickly Routing Searches without Having to Move Content,” Proc. Int’l Workshop Peer-to-Peer Systems (IPTPS), 2005.
  9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, 2001.
  10. MAYMOUNKOV, P., AND MAZIERES, D. Kademlia: A Peer-to-peer Information System Based On the XOR Metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS ’02) (Cambridge, MA, Mar. 2002)
  11. K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. INFOCOM, 2003.
  12. S. Patro and Y.C. Hu, “Transparent Query Caching in Peer-to-Peer Overlay Networks,” Proc. 17th Int’l Parallel and Distributed Processing Symp. (IPDPS), 2003.
  13. M. Roussopoulos and M. Baker, “Controlled Update Propagation in Peer-to-Peer Networks,” Proc. USENIX Ann. Technical Conf., 2003.
  14. C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. INFOCOM, 2004.
  15. B. Yang and H. Garcia-Molina, “Efficient Search in Peer-to-Peer Networks,” Proc. Int’l Conf. Distributed Computing Systems (ICDCS), 2002.
  16. B. Yang and H. Garcia-Molina, “Designing a Super-Peer Network,” Proc. Int’l Conf. Data Eng. (ICDE), 2003.
  17. C. Wang, L. Xiao, and P. Zheng, “Differentiated Search in Hierarchical Peer to Peer Networks,” Proc. Int’l Conf. Parallel Processing (ICPP), 2005.
  18. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hon ,"Freenet: A Distributed Anonymous Information Storage and Retrieval System", Marshall Aid Commemoration Commission and the National Science Foundation,2001.
  19. Nazareno Andrade, Miranda Mowbray, Aliandro Lim, Gustavo Wagne, Matei Ripeanu, "Influences on Cooperation in BitTorrent Communities",SIGCOMM’05 Workshops, August 22–26, 2005, Philadelphia, PA, USA.
  20. Huu Tran,Michael Hitchens,Vijay Varadharajan,Paul Watters, "A Trust based Access Control Framework for P2P File-Sharing Systems",IEEE Proceedings of the 38th Hawaii International Conference on System Sciences - 2005.
  21. Felix Lau, Stuart H. Rubi, Michael H. Smith , Ljiljana Traj kovi, "Distributed Denial of Service Attacks", IEEE,2000.
Index Terms

Computer Science
Information Sciences

Keywords

Gargantuan peers (G-peers)