The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
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.
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
(1979) · Cited by 43,841
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,735
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
The cost of a cloud: research problems in data center networks
Greenberg, A., Hamilton, J., Maltz, D. A., & Patel, P. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1496091.1496103 · Cited by 1,621
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402968 · Cited by 994
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., & Vahdat, A. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592575 · Cited by 929
Generalized Hypercube and Hyperbus Structures for a Computer Network
Bhuyan, & Agrawal (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676437 · Cited by 855
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities
Armour, G. C., & Buffa, E. S. (1963) · Management Science · doi:10.1287/mnsc.9.2.294 · Cited by 740
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402968 · Cited by 563
Fast accurate computation of large-scale IP traffic matrices from link loads
Zhang, Y., Roughan, M., Duffield, N., & Greenberg, A. (2003) · Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/781027.781053 · Cited by 505
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
Gilmore, P. C. (1962) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0110022 · Cited by 448
A thermodynamically motivated simulation procedure for combinatorial optimization problems
Burkard, R. E., & Rendl, F. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90231-5 · Cited by 345
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Flyways To De-Congest Data Center Networks.
Kandula, S., Padhye, J., & Bahl, P. (2009) · Cited by 218
Finding k Cuts within Twice the Optimal
Saran, H., & Vazirani, V. V. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792251730 · Cited by 195
Cited by
Cloud computing: state-of-the-art and research challenges
Zhang, Q., Cheng, L., & Boutaba, R. (2010) · Journal of Internet Services and Applications · doi:10.1007/s13174-010-0007-6 · Cited by 3,515
Towards predictable datacenter networks
Ballani, H., Costa, P., Karagiannis, T., & Rowstron, A. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018465 · Cited by 750
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
Zeng, D., Gu, L., Guo, S., Cheng, Z., & Yu, S. (2016) · IEEE Transactions on Computers · doi:10.1109/tc.2016.2536019 · Cited by 426
The Internet of Things, Fog and Cloud continuum: Integration and challenges
Bittencourt, L., Immich, R., Sakellariou, R., Fonseca, N., Madeira, E., Curado, M., Villas, L., DaSilva, L., Lee, C., & Rana, O. (2018) · Internet of Things · doi:10.1016/j.iot.2018.09.005 · Cited by 370
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
- 22
- 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
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.