1. 1. DEPSKY:Dependable and Secure Storage in a Cloud-of-Clouds A.Bessani, M.Correia, B.Quaresma, F.Andre, and P .Sousa. DEPSKY: Dependable and Secure Storage in a Cloud-of-Clouds. In Proc.of ACM Euro Sys, 2011
   2. MapReduce : Simplified Data Processing on Large Clusters : J. Dean and S. Ghemawat, “Map Reduce: Simplified Data Processing on Large Clusters, ”Proc. Sixth Symp. Operating System Design and Implementation (OSDI ’04),pp. 137-150, Dec. 2009.
   3. Load Balancing in Structured P2P Systems A.Rao, K.Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems, ”Proc. Second Int’l Workshop Peer-to-Peer Systems (IPTPS ’02),pp. 68-79, Feb. 2010.
   4. Simple Efficient Load Balancing Algorithms for Peerto-Peer Systems.D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,”Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA ’04),pp. 36-43, June 2004. .Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables G.S. Manku, “Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables,”Proc. 23rd ACM Symp. Principles Distributed Computing (PODC ’04),pp. 197-205, July 2004.
   5. Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured P2P Networks H. Shen and C.- Z. Xu, “Locality-Aware and Churn-Resilient Load Balancing Algorithms in Structured P2P Networks,”IEEE Trans.Parallel and Distributed Systems,vol. 18, no. 6, pp. 849-862, June 2007.
   6. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,”Proc. IFIP/ACM Int’l Conf. Distributed Systems Platforms Heidelberg, pp. 161-172, Nov. 2001.
   7. Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. P. Ganesan, M. Bawa, and H. Garcia-Molina, “Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems,” Proc. 13th Int’l Conf. Very Large Data Bases (VLDB ’04), pp. 444-455, Sept. 2004.