Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components
buir.contributor.author | Ulusoy, Özgür | |
dc.citation.epage | 527 | en_US |
dc.citation.spage | 508 | en_US |
dc.citation.volumeNumber | 91 | en_US |
dc.contributor.author | Ilkhechi, A. R. | en_US |
dc.contributor.author | Korpeoglu, I. | en_US |
dc.contributor.author | Ulusoy, Özgür | en_US |
dc.date.accessioned | 2016-02-08T11:00:39Z | |
dc.date.available | 2016-02-08T11:00:39Z | |
dc.date.issued | 2015 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description.abstract | Following 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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T11:00:39Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2015 | en |
dc.identifier.doi | 10.1016/j.comnet.2015.08.042 | en_US |
dc.identifier.issn | 1389-1286 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/26496 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Elsevier BV | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1016/j.comnet.2015.08.042 | en_US |
dc.source.title | Computer Networks | en_US |
dc.subject | Cloud computing | en_US |
dc.subject | Network congestion | en_US |
dc.subject | Predictable flow | en_US |
dc.subject | Sink node | en_US |
dc.subject | Virtual machine placement | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Heuristic algorithms | en_US |
dc.subject | Machine components | en_US |
dc.subject | Optimal systems | en_US |
dc.subject | Optimization | en_US |
dc.subject | Polynomial approximation | en_US |
dc.subject | Polynomials | en_US |
dc.subject | Communication pattern | en_US |
dc.subject | Emerging technologies | en_US |
dc.subject | Extensive simulations | en_US |
dc.subject | Network congestions | en_US |
dc.subject | Polynomial-time algorithms | en_US |
dc.subject | Predictable flow | en_US |
dc.subject | Sink nodes | en_US |
dc.subject | Virtual machine placements | en_US |
dc.subject | Distributed computer systems | en_US |
dc.title | Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components.pdf
- Size:
- 5.3 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version