SOLVING OPTIMALITY AND STORAGE CONSTRAINT PROBLEMS IN DATA STAGING CLOUDS

P.V.V.S.D. Nagendrudu, M.Srinivasa Chakravarthy

Abstract


Recently the studies on cloud computing remarkably increased. With data accessibility demands to the cloud computing, data availability improvement seems to be a challenging problem to maintain high-fidelity and time-bounded service expectations in clouds. Increasing in number of cloud data users, the problem of producing the requested data, available to the users becomes an important issue for Cloud service Providers to guarantee high-quality services. A particularly engaging an approach to improve such data availability is to stage the requested data to some other sites and cache the data for a period of time. The staging is a process of storing data at intermediate are between source and destination. Scenario is a mobile user who may want a service to advise probable alternative way to the destination depending on current traffic patterns. This service requires not only building the queried data   available at specific nodes along the current path, but also staging the data on key places along with the paths based on navigation history.  This project is an implementation of simulations of data staging problem by leveraging the genetic algorithms techniques to optimally migrate, duplicate, and cache the common data items in clouds with or without some practical resource constraints in an efficient way while reducing the monetary cost for sending and caching the data items. Monetary cost is primary interest as on one hand, it is a very useful concept to reflect the individuality of various network features such as network bit rate, link delay, and storage usage, and the provision of the resources in cloud systems are usually based on payas-you-go fashion, and thus effective use of the platforms within budget constraint is always the user’s concern.


Keywords


Cloud computing; data staging and caching; resource constraints; data placement and migration;

References


B. 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.

K. Candan, B. Prabhakaran, and V. Subrahmanian, “Collaborative Multimedia Documents: Authoring and Presentation,” Technical Report CS-TR-3596, UMIACS-TR-96-9, Computer Science Technical Series Report, Univ. of Maryland, College Park, Jan. 1996.

B. Veeravalli and E. Yew, “Network Caching Strategies for Reservation-Based Multimedia Services on High-Speed Networks,” Data and Knowledge Eng., vol. 41, no. 1, Apr. 2002.

D. Arora, A. Feldmann, G. Schaffrath, and S. Schmid, “On the Benefit of Virtualization: Strategies for Flexible Server Allocation,” Proc. USENIX Workshop Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services (Hot-ICE), 2011.

X. Chen and X. Zhang, “A Popularity-Based Prediction Model for Web Prefetching,” Computer, vol. 36, no. 3, pp. 63-70, Mar. 2003.

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.

A. Karlin, S. Phillips, and P. Raghavan, “Markov Paging,” SIAM J. Computing, vol. 30, no. 3, pp. 906-922, 2000.

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.

A. Borodin, S. Irani, P. Raghavan, and B. Schieber, “Competitive Paging with Locality of Reference,” J. Computer and Systems, vol. 50, pp. 244-258, 1995.

C. Hopps, “Analysis of an Equal-Cost Mult-Path Algorithm,” RFC 2992, Internet Eng. Task Force, 2000.

S. Baase, A Gift of Fire: Social, Legal, and Ethical Issues in Computing. Prentice Hall, 1997.

C.H. Papadimitriou, S. Ramanathan, and P.V. Rangan, “Optimal Information Delivery,” Proc. Sixth Int’l Symp. Algorithms and Computation (ISAAC ’95), pp. 181-187, 1995.

M. Charikar, D. Halperin, and R. Motwani, “The Dynamic Servers Problem,” Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA ’98), pp. 410-419, 1998.

C.H. Papadimitriou, S. Ramanathan, P.V. Rangan, and S.S. Kumar, “Multimedia Information Caching for Personalized Video-on- Demand,” Computer Comm., vol. 18, no. 3, pp. 204-216, 1995.

M. Manasse, L. McGeoch, and D. Sleator, “Competitive Algorithms for on-Line Problems,” Proc. 20th Ann. ACM Symp. Theory of Computing, pp. 322-333, 1988.

M. Chroboak, H. Karloff, T. Payne, and S. Vishwanathan, “New Results on Server Problems,” SIAM J. Discrete Math., vol. 4, pp. 172-181, 1991.

W. Shi and C. Su, “The Rectilinear Steiner Arborescence Problem is Np-Complete,” Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA ’00), pp. 780-787, 2000.


Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.