The DOI matches its Crossref record.
Dynamic Placement of Virtual Machines for Managing SLA Violations
Abstract
A dynamic server migration and consolidation algorithm is introduced. The algorithm is shown to provide substantial improvement over static server consolidation in reducing the amount of required capacity and the rate of service level agreement violations. Benefits accrue for workloads that are variable and can be forecast over intervals shorter than the time scale of demand variability. The management algorithm reduces the amount of physical capacity required to support a specified rate of SLA violations for a given workload by as much as 50% as compared to static consolidation approach. Another result is that the rate of SLA violations at fixed capacity may be reduced by up to 20%. The results are based on hundreds of production workload traces across a variety of operating systems, applications, and industries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Consolidating virtual machines with dynamic bandwidth demand in data centers
Wang, M., Meng, X., & Zhang, L. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5935254 · Cited by 339
(2017) · Networked Systems Design and Implementation · Cited by 329
A Survey of Virtual Machine Placement Techniques in a Cloud Data Center
Usmani, Z., & Singh, S. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.02.093 · Cited by 142
Optimizing Virtual Machine placement in IaaS data centers: Taxonomy, review and open issues
Talebian, H., Gani, A., Sookhak, M., Abdelatif, A. A., Yousafzai, A., Vasilakos, A. V., & Yu, F. R. (2020) · Cluster Computing · doi:10.1007/s10586-019-02954-w · Cited by 72
A multi-objective krill herd algorithm for virtual machine placement in cloud computing
Baalamurugan, K. M., & Vijay Bhanu, S. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-018-2516-1 · Cited by 26
Metadata
- Authors
- Bobroff, N., Kochut, A., & Beaty, K.
- Venue
- 2007 10th IFIP/IEEE International Symposium on Integrated Network Management
- Publisher
- IEEE
- Published
- 2007-05
- Pages
- 119-128
- OpenAlex
- W2160756722
- Cited by
- 808
- References
- 0
- FWCI
- 16.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Placement of Virtual Machines for Managing SLA Violations. https://app.cochat.ai/papers/10.1109/inm.2007.374776
- The paper
- Bobroff, N., Kochut, A., & Beaty, K. (2007). Dynamic Placement of Virtual Machines for Managing SLA Violations. 2007 10th IFIP/IEEE International Symposium on Integrated Network Management. https://doi.org/10.1109/inm.2007.374776
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.