Abstract: In this paper, we study this data staging problem by leverging the dynamic programming (DP) techniques to optimally migrate, replicate, and cache the shared data items in cloud systems with or without some practical resource constrains in an efficient way whiling minimizing the monetary cost for transmitting and caching the data items. Monetary cost is our primary interest as on one hand, the provision of the resources in cloud systems are usually based on pay-as-you-go fashion, and thus effective use of the platforms within budget constraint is always the user’s concern. In general, data staging algorithm in our applications is not only needed to figure out the user’s access patterns (i.e., a sequence of requests, each being made by certain node at a predicted time instant) but also required to migrate, replicate, or cache the involved data items across the network at particular time instants to optimize some performance metric for future accesses.
Keywords: Cloud computing, data staging and caching, resource constrains, data placement and migration.
Title: Minimization of Distributed Data Items in the Clouds
Author: V.Srikanth, S. Dhamodaran
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
