Detracting Cost in Geo Distributed Data Centers Using N-Dimensional Markov Chain
Big data heavy burden on computation and storage in now-a-days geo distributed data centers. In big data processing all the operations are performed using geo distributed data centers. So cost detracting in geo distributed data center is one of the major problems in big data processing. As a result of these three factors, i.e., task assignment, data placement and data routing mostly influence the operational expenditure of geo distributed data centers. In this paper, the authors focus on the cost detracting problem via a joint optimization of these three factors for big data services in geo-distributed data centers. The task completion time described with the consideration of both data transmission and computation, they propose N-dimensional Markov chain and derive the average task completion time in closed-form.