2014 IEEE International Conference on Cloud Engineering 2014
DOI: 10.1109/ic2e.2014.81
|View full text |Cite
|
Sign up to set email alerts
|

Using Network Knowledge to Improve Workload Performance in Virtualized Data Centers

Abstract: Abstract-The scale and expense of modern data centers motivates running them as efficiently as possible. This paper explores how virtualized data center performance can be improved when network traffic and topology data informs VM placement. Our practical heuristics, tested on network-heavy, scale-out workloads in an 80 server cluster, improve overall performance by up to 70% compared to random placement in a multi-tenant configuration.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…To achieve energyefficient workload placement for DCs, authors in [14] constructed a rack-level power model that mapped the workload directly to its power dissipation and pursued an optimal workload allocation with minimized power consumption. Authors in [15] presented a virtual data center resource manager that exploited the network and topology knowledge, since they assumed traffic and topology were informed before so that the overall performance would be improved drastically. HUG [16] proposed a coflow scheduling algorithm to achieve multiresource fairness and maximize network utilization without sacrificing strategy-proofness.…”
Section: Related Workmentioning
confidence: 99%
“…To achieve energyefficient workload placement for DCs, authors in [14] constructed a rack-level power model that mapped the workload directly to its power dissipation and pursued an optimal workload allocation with minimized power consumption. Authors in [15] presented a virtual data center resource manager that exploited the network and topology knowledge, since they assumed traffic and topology were informed before so that the overall performance would be improved drastically. HUG [16] proposed a coflow scheduling algorithm to achieve multiresource fairness and maximize network utilization without sacrificing strategy-proofness.…”
Section: Related Workmentioning
confidence: 99%
“…A primary mechanism to reduce the amount of communication and improve the efficiency of network usage is to optimize the placement of an application's VMs to co-locate those with heavy flows between them on the same racks [3], [4]. For such an approach to work, a distributed load balancer such as Airfoil that can actually recognize the co-located VMs and preferentially route traffic to them is a prerequisite.…”
Section: Vm Placement Optimizationmentioning
confidence: 99%
“…Methods to optimize the placement of virtual machines and to increase communication locality have also been proposed as a means for decreasing the utilization of bottleneck links [3], [4]. A VM migration strategy is introduced in [18] that tries to avoid resource contention, including the network, using utilization information.…”
Section: F Coordinator Performancementioning
confidence: 99%
“…As part of other research [10,11], Beacon has run the network for the last two and a half years of an 80 server, 320 virtual machine cluster containing 80 virtual switches (one per server), and 20 physical switches wired as a k=4 fat tree. Beacon's modularity enabled a custom routing engine to extend the default, and the creation of a custom Web UI for tracking experiments.…”
Section: Deployment Experiencementioning
confidence: 99%