An iterated local search approach for carbon footprint optimisation in an intercloud environment Online publication date: Tue, 19-Jan-2016
by Valerie D. Justafort; Ronald Beaubrun; Samuel Pierre
International Journal of Metaheuristics (IJMHEUR), Vol. 4, No. 2, 2015
Abstract: In this paper, we address the problem of virtual machine (VM) placement in an InterCloud with regard to the reduction of the environmental impact of such environment. We propose a mathematical formulation based on a smart workload consolidation method and a cooling maximisation technique that considers the dynamic behaviour of the cooling fans. As the virtual machine placement problem (VMPP) is classified as an NP-hard problem, we propose an implementation of the iterated local search (ILS) algorithm, ILS_CBF, in order to find good solutions in a reasonable time. Computational results allow to identify the parameters that reduce the carbon footprint costs. The comparison of the proposed heuristic with the exact method and other algorithms demonstrate that the obtained costs are relatively close to the lower bounds, ranging from 0% to a maximum distance less than 2.6%, and allow a good tradeoff between the quality of the solution and the computational time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook