CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Improving P2P in Cloud Computing based on Performance

Published on None 2011 by Sarada.B.S, Nagarajan.S
Computational Science - New Dimensions & Perspectives
Foundation of Computer Science USA
NCCSE - Number 2
None 2011
Authors: Sarada.B.S, Nagarajan.S

Sarada.B.S, Nagarajan.S . Improving P2P in Cloud Computing based on Performance. Computational Science - New Dimensions & Perspectives. NCCSE, 2 (None 2011), 62-65.

author = { Sarada.B.S, Nagarajan.S },
title = { Improving P2P in Cloud Computing based on Performance },
journal = { Computational Science - New Dimensions & Perspectives },
issue_date = { None 2011 },
volume = { NCCSE },
number = { 2 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 62-65 },
numpages = 4,
url = { /specialissues/nccse/number2/1861-163/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Special Issue Article
%1 Computational Science - New Dimensions & Perspectives
%A Sarada.B.S
%A Nagarajan.S
%T Improving P2P in Cloud Computing based on Performance
%J Computational Science - New Dimensions & Perspectives
%@ 0975-8887
%N 2
%P 62-65
%D 2011
%I International Journal of Computer Applications

Cloud computing platform is a set of scalable large-scale data server clusters, it provides computing and storage services to customers. The basic study about the architecture of current cloud computing system shows that it’s a central structured one; i.e. All the data nodes are indexed by a master server, but when the number requests increases it may become bottle neck of the system. This research paper is about a cloud storage architecture based on P2P with fault tolerance. Here the central entity is removed and all servers are interconnected to form a ring structure. When one of the servers fails, the work will be taken over by any of the best performing servers. The confidentiality and integrity of data passed in between the servers is also maintained using MAC algorithm.

  1. Ben Y. Zhao, John Kubiatowicz, and Anthony Joseph,“Tapestry: An Infrastructure for Fault-tolerant Wide-areaLocation and Routing”, Technical Report No.UCB/CSD -01-1141, University of California Berkeley.
  2. Francesco Maria Aymerich, Gianni Fenu, Simone Surcis. An Approach to a Cloud Computing Network. 978-424426249/08/$25.00 ©2008 IEEE conference.
  3. Boss G, Malladi P, Quan D, Legregni L, Hall H. Cloud computing.IBM White Paper, 2007.
  4. Ghemawat S, Gobioff H, Leung ST. The Google file system. In: Proc. of the 19th ACM Symp. On Operating Systems Principles. New York: ACM Press, 2003. 29_43.
  5. Ke Xu, Meina Song, Xiaoqi Zhang,Junde Song, “A Cloud Computing Platform Based on P2P”.
  6. Burrows M. The chubby lock service for loosely-coupled distributed systems. In: Proc. of the 7th USENIX Symp. on Operating Systems Design and Implementation. Berkeley: USENIX Association, 2006. 335_350.
  7. Oasis:M.Rodrig, and A. Lamarca, “Decentralized Weighted Voting for P2P Data Management,” in Proc.of the 3rd ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp.85–92, 2003.
  8. Antony Rowstron and Peter Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”, IFIP/ACM International Conference on Distributed SystemsPlatforms.
  9. Sigma:S. Lin, Q. Lian, M. Chen, and Z.Zhang,“A practical distributed mutual exclusion protocol in dynamic peer-to- peer systems,” in Proc. of 3rd International Workshop on Peer-to-Peer Systems (IPTPS’04), 2004.
Index Terms

Computer Science
Information Sciences


Cloud computing fault tolerance P2P storage