Ilkhechi, A. R.Korpeoglu, I.Ulusoy, Özgür2016-02-082016-02-0820151389-1286http://hdl.handle.net/11693/26496Following a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility computing into a reality. Like any emerging technology, with its advent, it also brought new challenges to be addressed. This work studies network and traffic aware virtual machine (VM) placement in a special cloud computing scenario from a provider's perspective, where certain infrastructure components have a predisposition to be the endpoints of a large number of intensive flows whose other endpoints are VMs located in physical machines (PMs). In the scenarios of interest, the performance of any VM is strictly dependent on the infrastructure's ability to meet their intensive traffic demands. We first introduce and attempt to maximize the total value of a metric named "satisfaction" that reflects the performance of a VM when placed on a particular PM. The problem of finding a perfect assignment for a set of given VMs is NP-hard and there is no polynomial time algorithm that can yield optimal solutions for large problems. Therefore, we introduce several off-line heuristic-based algorithms that yield nearly optimal solutions given the communication pattern and flow demand profiles of subject VMs. With extensive simulation experiments we evaluate and compare the effectiveness of our proposed algorithms against each other and also against naïve approaches.EnglishCloud computingNetwork congestionPredictable flowSink nodeVirtual machine placementAlgorithmsHeuristic algorithmsMachine componentsOptimal systemsOptimizationPolynomial approximationPolynomialsCommunication patternEmerging technologiesExtensive simulationsNetwork congestionsPolynomial-time algorithmsPredictable flowSink nodesVirtual machine placementsDistributed computer systemsArticle10.1016/j.comnet.2015.08.042