Let's stay together: Towards traffic aware virtual machine placement in data centers
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
As tenants take networked virtual machines (VMs) as their requirements, effective placement of VMs is needed to reduce the network cost in cloud data centers. The cost is one of the major concerns for the cloud providers. In addition to the cost caused by network traffics (N-cost), the cost caused by the utilization of physical machines (PM-cost) is also non-negligible. In this paper, we focus on the optimized placement of VMs to minimize the cost, the combination of N-cost and PM-cost. We define N-cost by various functions, according to different communication models. We formulate the placement problem, and prove it to be NP-hard. We investigate the problem from two aspects. Firstly, we put a special emphasis on minimizing the N-cost with fixed PM-cost. For the case that tenants request the same amount of VMs, we present optimal algorithms under various definitions of N-cost. For the case that tenants require different numbers of VMs, we propose an approximation algorithm. Also, a greedy algorithm is implemented as the baseline to evaluate the performance. Secondly, we study the general case of the VM placement problem, in which both N-cost and PM-cost are taken into account. We present an effective binary-search-based algorithm to determine how many PMs should be used, which makes a tradeoff between PM-cost and N-cost. For all of the algorithms, we conduct theoretical analysis and extensive simulations to evaluate their performance and efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Li, X., Qian, Z., Lu, S., & Wu, J. (2013) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2013.02.003 · Cited by 186
Self-citation
Cited by
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Anti-obesity drug discovery: advances and challenges
Müller, T. D., Blüher, M., Tschöp, M. H., & DiMarchi, R. D. (2022) · Nature Reviews Drug Discovery · doi:10.1038/s41573-021-00337-8 · Cited by 1,021
Adriaenssens, A. E., Biggs, E. K., Darwish, T., Tadross, J., Sukthankar, T., Girish, M., Polex-Wolf, J., Lam, B. Y., Zvetkova, I., Pan, W., et al. (2019) · Cell Metabolism · doi:10.1016/j.cmet.2019.07.013 · Cited by 324
Bergmann, N. C., Lund, A., Gasbjerg, L. S., Meessen, E. C. E., Andersen, M. M., Bergmann, S., Hartmann, B., Holst, J. J., Jessen, L., Christensen, M. B., et al. (2019) · Diabetologia · doi:10.1007/s00125-018-4810-0 · Cited by 142
Bergmann, N. C., Gasbjerg, L. S., Heimbürger, S. M., Krogh, L. S. L., Dela, F., Hartmann, B., Holst, J. J., Jessen, L., Christensen, M. B., Vilsbøll, T., et al. (2020) · Diabetes Care · doi:10.2337/dc19-0578 · Cited by 62
Metadata
- Authors
- Li, X., Wu, J., Tang, S., & Lu, S.
- Venue
- IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2014-04
- Pages
- 1842-1850
- OpenAlex
- W2048802752
- Cited by
- 128
- References
- 1
- FWCI
- 17.95
- 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: Let's stay together: Towards traffic aware virtual machine placement in data centers. https://app.cochat.ai/papers/10.1109/infocom.2014.6848123
- The paper
- Li, X., Wu, J., Tang, S., & Lu, S. (2014). Let's stay together: Towards traffic aware virtual machine placement in data centers. IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. https://doi.org/10.1109/infocom.2014.6848123
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.