The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Abstract
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple virtual servers can be hosted on a single server. Server consolidation describes the process of combining the workloads of several different servers on a set of target servers. We focus on server consolidation with dozens or hundreds of servers, which can be regularly found in enterprise data centers. Cost saving is among the key drivers for such projects. This paper presents decision models to optimally allocate source servers to physical target servers while considering real-world constraints. Our central model is proven to be an NP-hard problem. Therefore, besides an exact solution method, a heuristic is presented to address large-scale server consolidation projects. In addition, a preprocessing method for server load data is introduced allowing for the consideration of quality-of-service levels. Extensive experiments were conducted based on a large set of server load data from a data center provider focusing on managerial concerns over what types of problems can be solved. Results show that, on average, server savings of 31 percent can be achieved only by taking cycles in the server workload into account.
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
Cites
(1979) · Cited by 43,841
Design Science in Information Systems Research1
Hevner, A. R., March, S. T., Park, J., & Ram, S. (2004) · MIS Quarterly · doi:10.2307/25148625 · Cited by 10,707 · cited 1×
“One contribution of this paper is decision support for IT service providers following a design science approach [11]: We provide a mathematical formulation of widespread server consolidation problems, a complexity analysis showing that the fundamental problem is an NP-hard optimization problem, an…”
MethodInfluentialDesign science in information systems research
(2004) · Journal of the Association for Information Systems · doi:10.5555/2017212.2017217 · Cited by 8,254
A Design Science Research Methodology for Information Systems Research
Peffers, K., Tuunanen, T., Rothenberger, M. A., & Chatterjee, S. (2007) · Journal of Management Information Systems · doi:10.2753/mis0742-1222240302 · Cited by 7,832 · cited 1×
“Our paper follows a design science approach as outlined in [30].”
MethodTime Series Analysis and Its Applications
Shumway, R. H., & Stoffer, D. S. (2011) · Springer Texts in Statistics · doi:10.1007/978-1-4419-7865-3 · Cited by 2,012
Model Building in Mathematical Programming
Maher, M. J., & Williams, H. P. (1979) · Journal of the Operational Research Society · doi:10.2307/3009304 · Cited by 1,245
Hayes, B. (2008) · Communications of the ACM · doi:10.1145/1364782.1364786 · Cited by 1,086
IT Outsourcing Strategies: Universalistic, Contingency, and Configurational Explanations of Success
Lee, J.-N., Miranda, S. M., & Kim, Y.-M. (2004) · Information Systems Research · doi:10.1287/isre.1040.0013 · Cited by 430
Performance by Design: Computer Capacity Planning By Example
Menascé, D. A., Dowdy, L. W., & Almeida, V. A. F. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 387
Resource constrained scheduling as generalized bin packing
Garey, M. R., Graham, R. L., Johnson, D. S., & Yao, A. C.-C. (1976) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(76)90001-7 · Cited by 353
On the online bin packing problem
Seiden, S. S. (2002) · Journal of the ACM · doi:10.1145/585265.585269 · Cited by 310
Time Series Analysis and Its Applications
(2006) · Springer Texts in Statistics · doi:10.1007/0-387-36276-2 · Cited by 301
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
Dósa, G. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74450-4_1 · Cited by 157
A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm
Yue, M. (1991) · Acta Mathematicae Applicatae Sinica English Series · doi:10.1007/bf02009683 · Cited by 155
Multidimensional Packing Problems
Gonzalez, T. F. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420010749-44 · Cited by 137
Improved approximation algorithms for multidimensional bin packing problems
Bansal, N., Caprara, A., & Sviridenko, M. I. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.38 · Cited by 90
Dynamic Data Center Power Management Trends, Issues, and Solutions
Filani, D. (2008) · Intel Technology Journal · doi:10.1535/itj.1201.06 · Cited by 66
On Multi-dimensional Packing Problems
hekuri, C. H. C. (1999) · Cited by 61
Models and framework for supporting runtime decisions in Web-based systems
Andreolini, M., Casolari, S., & Colajanni, M. (2008) · ACM Transactions on the Web · doi:10.1145/1377488.1377491 · Cited by 60
Cited by
A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Gao, Y., Guan, H., Qi, Z., Hou, Y., & Liu, L. (2013) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2013.02.004 · Cited by 671
Resource Management in Clouds: Survey and Research Challenges
Jennings, B., & Stadler, R. (2015) · Journal of Network and Systems Management · doi:10.1007/s10922-014-9307-7 · Cited by 548
Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches
Zhan, Z.-H., Liu, X.-F., Gong, Y.-J., Zhang, J., Chung, H. S.-H., & Li, Y. (2015) · ACM Computing Surveys · doi:10.1145/2788397 · Cited by 482
An Energy Efficient Ant Colony System for Virtual Machine Placement in Cloud Computing
Liu, X.-F., Zhan, Z.-H., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2623803 · Cited by 407
Server consolidation with migration control for virtualized data centers
Ferreto, T. C., Netto, M. A. S., Calheiros, R. N., & De Rose, C. A. F. (2011) · Future Generation Computer Systems · doi:10.1016/j.future.2011.04.016 · Cited by 299
Metadata
- Authors
- Speitkamp, B., & Bichler, M.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2010-10
- Volume
- 3
- Issue
- 4
- Pages
- 266-278
- ISSN
- 1939-1374 (ISSN-L)
- OpenAlex
- W2157016369
- Cited by
- 352
- References
- 19
- FWCI
- 62.35
- Type
- journal article
- 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
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.