The DOI matches its Crossref record.
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Abstract
The scalability of modern data centers has become a practical concern and has attracted significant attention in recent years. In contrast to existing solutions that require changes in the network architecture and the routing protocols, this paper proposes using traffic-aware virtual machine (VM) placement to improve the network scalability. By optimizing the placement of VMs on host machines, traffic patterns among VMs can be better aligned with the communication distance between them, e.g. VMs with large mutual bandwidth usage are assigned to host machines in close proximity. We formulate the VM placement as an optimization problem and prove its hardness. We design a two-tier approximate algorithm that efficiently solves the VM placement problem for very large problem sizes. Given the significant difference in the traffic patterns seen in current data centers and the structural differences of the recently proposed data center architectures, we further conduct a comparative analysis on the impact of the traffic patterns and the network architectures on the potential performance gain of traffic-aware VM placement. We use traffic traces collected from production data centers to evaluate our proposed VM placement algorithm, and we show a significant performance improvement compared to existing general methods that do not take advantage of traffic patterns and data center network characteristics.
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
Zeng, D., Gu, L., Guo, S., Cheng, Z., & Yu, S. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2016.2536019 · Cited by 426
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
Self-citationDENS: Data Center Energy-Efficient Network-Aware Scheduling
Kliazovich, D., Bouvry, P., & Khan, S. U. (2010) · 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing · doi:10.1109/greencom-cpscom.2010.31 · Cited by 239
Li, X., Qian, Z., Lu, S., & Wu, J. (2013) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2013.02.003 · Cited by 186
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
Metadata
- Authors
- Meng, X., Pappas, V., & Zhang, L.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2077661716
- Cited by
- 935
- References
- 0
- FWCI
- 43.63
- 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: Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement. https://app.cochat.ai/papers/10.1109/infcom.2010.5461930
- The paper
- Meng, X., Pappas, V., & Zhang, L. (2010). Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement. 2010 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2010.5461930
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.