Paper Detail

Do Bio-Inspired Algorithms Save Energy in Data Centres? Separating Server Packing from Migration Search in Virtual Machine Consolidation

Yichiet Aun, Yu Hang Woo

arxiv Score 7.5

Published 2026-10-25 · First seen 2026-10-27

Research Track A

Abstract

Energy-efficient virtual machine (VM) consolidation matters as data centre electricity demand rises. Bio-inspired metaheuristics, including ant colony optimisation (ACO), particle swarm optimisation (PSO), and genetic algorithms, have reported substantial energy savings. However, these improvements are commonly evaluated against conventional allocation policies that differ in both initial VM placement and subsequent migration optimisation, making it difficult to determine the contribution of metaheuristic search. This study reproduces an existing consolidation implementation in CloudSim Plus and introduces a matched control that retains the same initial packing and empty-host deactivation mechanisms but excludes migration search. ACO, PSO, and a modified genetic algorithm (MGA) are evaluated across two fleet configurations and four workload regimes, with ten stochastic replications per condition. The matched control achieves energy savings of 0.8-81.4% relative to the spreading baseline, the amount available falling sharply as load rises, without migrations or incomplete workload execution. Across 24 comparisons, metaheuristic search increases energy consumption in 11 cases, produces identical outcomes in seven, and reduces consumption in six. Of these, ten increases and five reductions remain statistically significant after Holm correction. Five of the six apparent reductions coincide with unfinished tasks and disappear after normalisation by delivered computational work. Only ACO under light heterogeneous load retains a 3.22-percentage-point improvement (95% CI 2.96-3.47). These findings demonstrate that initial packing and host deactivation account for most of the measured energy savings in the examined implementations, highlighting the importance of matched control conditions and workload-completion measures for reliable evaluation of VM consolidation algorithms.

Workflow Status

Review status
pending
Role
unreviewed
Read priority
soon
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{aun2026do,
  title = {Do Bio-Inspired Algorithms Save Energy in Data Centres? Separating Server Packing from Migration Search in Virtual Machine Consolidation},
  author = {Yichiet Aun and Yu Hang Woo},
  year = {2026},
  abstract = {Energy-efficient virtual machine (VM) consolidation matters as data centre electricity demand rises. Bio-inspired metaheuristics, including ant colony optimisation (ACO), particle swarm optimisation (PSO), and genetic algorithms, have reported substantial energy savings. However, these improvements are commonly evaluated against conventional allocation policies that differ in both initial VM placement and subsequent migration optimisation, making it difficult to determine the contribution of met},
  url = {https://arxiv.org/abs/2610.34102},
  keywords = {cs.DC, cs.ET, eess.SY},
  eprint = {2610.34102},
  archiveprefix = {arXiv},
}

Metadata

{}