A Novel and Reliable Multi Data Hosting Model Over Cloud
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2018 by IJETT Journal|
|Year of Publication : 2018|
|Authors : Vellanki Sree Divya, Ch. Kodandaramu
|DOI : 10.14445/22315381/IJETT-V58P222|
Vellanki Sree Divya, Ch. Kodandaramu "A Novel and Reliable Multi Data Hosting Model Over Cloud", International Journal of Engineering Trends and Technology (IJETT), V58(3),114-117 April 2018. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
We propose an efficient model of secure data storage or hosting model over cloud. Millions of data components uploaded to server every day, duplicate copy of data components reduce the space of cloud drive. Cloud acts as resource area for data owners and various cloud service providers. In this model we reduce the duplication of the data components without violating privacy and privileges or access permissions of the while sharing between multiple data owner and two-level cloud service storage. The second indirect cloud service maintains the replication of the original uploaded files.Our protocol improves the confidentiality through secure hosting with efficient authentication technique and encoding model.Our proposed model improves the performance and maintains data confidentiality than the traditional approaches.
 S. Liu, X. Huang, H. Fu, and G. Yang, “Understanding data characteristics and access patterns in a cloud storage system,” in Proc. 13th IEEE/ACM Int. Symp. Cluster, Cloud, Grid Comput., 2013, pp. 327–334.
 P. Wendell, J. W. Jiang, M. J. Freedman, and J. Rexford, “Donar: Decentralized server selection for cloud services,” in Proc. ACM SIGCOMM Conf., 2010, pp. 231–242.
 H. H. Liu, Y. Wang, Y. R. Yang, H. Wang, and C. Tian, “Optimizing cost and performance for content multihoming,” in Proc. ACM SIGCOMM Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2012, pp. 371–382.
 T. G. Papaioannou, N. Bonvin, and K. Aberer, “Scalia: An adaptive scheme for efficient multi-cloud storage,” in Proc. Int. Conf. High Perform. Comput.,Netw., Storage, Anal., 2012, p. 20.
 J. S. Plank, “Erasure codes for storage systems: A brief primer,” Usenix Mag., vol. 38, no. 6, pp. 44–50, 2013.
 J. S. Plank, K. M. Greenan, and E. L. Miller, “Screaming fast galois field arithmetic using Intel SIMD instructions,” in Proc. 11th USENIX Conf. File Storage Technol., 2013, pp. 299–306.
 H. Weatherspoon and J. D. Kubiatowicz, “Erasure coding vs. replication: A quantitative comparison,” in Proc. 1st Int. Workshop Peer-to-Peer Syst., 2002, pp. 328–338.
 R. Rodrigues and B. Liskov, “High availability in DHTs: Erasure coding vs. replication,” in Proc. 4th Int. Conf. Peer-to-Peer Syst., 2005, pp. 226–239.
 I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, “The maximum clique problem,” in Handbook of Combinatorial Optimization. New York, NY, USA: Springer, 1999, pp. 1–74.
 B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291–307, 1970
Data Hosting, traditional approaches