VM reassignment in hybrid clouds for large decentralised companies: A multi-objective challenge
Files in This Item:
|FGCS_VMReassignmentinHybridClouds.pdf||4.47 MB||Adobe PDF||Download Request a copy|
|Title:||VM reassignment in hybrid clouds for large decentralised companies: A multi-objective challenge||Authors:||Saber, Takfarinas
Murphy, Liam, B.E.
|Permanent link:||http://hdl.handle.net/10197/9041||Date:||2017||Abstract:||Optimising the data centres of large IT organisations is complex as (i) they are composed of various hosting departments with their own preferences and (ii) reassignment solutions can be evaluated from various independent dimensions. But in reality, the problem is even more challenging as companies can now choose from a pool of cloud services to host some of their workloads. This hybrid search space seems intractable, as each workload placement decision (seen as running in a virtual machine on a server) is required to answer many questions: can we host it internally? In which hosting department? Are the capital allocators of this hosting department ok with this placement? How much does it save us and is it safe? Is there a better option in the Cloud? Etc. In this paper, we define the multi-objective VM reassignment problem for hybrid and decentralised data centres. We also propose H2¿D2, a solution that uses a multi-layer architecture and a metaheuristic algorithm to suggest reassignment solutions that are evaluated by the various hosting departments (according to their preferences). We compare H2¿D2 against state-of-the-art multi-objective algorithms and find that H2¿D2 outperforms them both in terms of quantity (approx 30% more than the second-best algorithm on average) and quality of solutions (19% better than the second-best on average).||Funding Details:||Science Foundation Ireland||Type of material:||Journal Article||Publisher:||Elsevier||Copyright (published version):||2017 Elsevier||Keywords:||Large decentralised data centres;Hybrid clouds;VM reassignment;Multi-objective optimisation;Hybrid algorithms;Interval objective||DOI:||10.1016/j.future.2017.06.015||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Computer Science Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.