The cost of a cloud: research problems in data center networks
ACM SIGCOMM Computer Communication Review
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Understanding data center traffic characteristics
ACM SIGCOMM Computer Communication Review
Improving the scalability of data center networks with traffic-aware virtual machine placement
INFOCOM'10 Proceedings of the 29th conference on Information communications
ElasticTree: saving energy in data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Comparing VM-Placement Algorithms for On-Demand Clouds
CLOUDCOM '11 Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Classical virtual machine (VM) placement approaches, focusing on computing resource requirements, do not consider network traffic as an input for the placement problem, which may result in high network traffic within the core links of the data center. Cost of networking is not negligible in a cloud data center. In order to decrease networking cost, in terms of power and delay, communication patterns of VMs need to be taken into account. We develop an algorithm with low computational complexity, to cluster VMs based on dynamic network traffic data and place clusters into racks, composed of physical servers. Our aim is to decrease the traffic between racks, by putting frequently communicating VMs together into the same rack or as close as possible, while minimizing networking delay based on average communication path length, number of active servers and number of active network elements, such as links and switches. Through numerous simulations, we show that the proposed algorithm provides quick and effective results to improve placement, which can be utilized via VM migrations.