Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:2 Issue:3 Year: 08 April,2014 Pages:144-153
In this paper we study the strategies for efficiently achieving data staging and storing the data on the set of vantage sites in the cloud system. Data staging is achieved and the security to the data items that are cached at vantage sites is provided. User request for accessing a file is processed and frequent access count is maintained for each file. Frequent access count is compared with the threshold. The file that satisfies the threshold is moved to the staging server. For accessing data from the staging server, homomorphic tokens are used. The system implements archive data management in the staging server
Cloud computing Data staging Homomorphic token
[1]. Yang Wang, BharadwajVeeravalli, Senior Member, IEEE, and Chen- KhongTham”On Data Staging Algorithms for Shared Data Accesses in Clouds”IEEE Transactions on Parallel And Distributed Systems, Vol. 24, No. 4, April 2013. [2]. Bharadwaj Veeravalli “Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 6, pp. 1487-1497, Nov. 2003. [3]. D. Aksoy, M.J. Franklin, and S.B. Zdonik, “Data Staging for On- Demand Broadcast” - Proc. 27th Int‟l Conf. Very Large Data Bases(VLDB ‟01), pp. 571-580, 2001. [4]. L. Breslau, P. Cue, P. Cao, L. Fan, G. Phillips, and S. Shenker,“Web Caching and Zipf-Like Distributions: Evidence and Implications”Proc. IEEE INFOCOM, pp. 126-134, 1999 [5]. P.Srinivas * , G. Rajesh Kumar “Efficient data security using Dynamic Token” check for Cloud Storage Systems International Journal of Engineering Research & Technology (IJERT) Vol. 1 Issue 6, August – 2012. [6]. X. Chen and X. Zhang,“A Popularity-Based Prediction Model for Web Prefetching,” Computer, vol. 36, no. 3, pp. 63-70, Mar. 2003. [7]. Y.Bartal, M.Charikar, and P.Indyk,“On Page Migration and Other Relaxed Task Systems” Theoretical Computer Science,vol. 268, no. 1, pp. 43-66, 2001. [8]. Y. Bartal, A. Fiat, and Y. Rabani, “Competitive Algorithms for Distributed Data Management (Extended Abstract),” Proc. 24thAnn. ACM Symp. Theory of Computing (STOC ‟92), pp. 39-50.