VM Placement Strategies for Cloud Scenarios
Citations Over TimeTop 1% of 2012 papers
Abstract
The problem of Virtual Machine (VM) placement in a compute cloud infrastructure is well-studied in the literature. However, the majority of the existing works ignore the dynamic nature of the incoming stream of VM deployment requests that continuously arrive to the cloud provider infrastructure. In this paper we provide a practical model of cloud placement management under a stream of requests and present a novel technique called Backward Speculative Placement (BSP) that projects the past demand behavior of a VM to a candidate target host. We exploit the BSP technique in two algorithms, first for handling the stream of deployment requests, second in a periodic optimization, to handle the dynamic aspects of the demands. We show the benefits of our BSP technique by comparing the results on a simulation period with a strategy of choosing an optimal placement at each time instant, produced by a generic MIP solver.
Related Papers
- → AEG: Automatic Exploit Generation(2018)209 cited
- → PExy: The Other Side of Exploit Kits(2014)24 cited
- → Automated Crash Analysis and Exploit Generation with Extendable Exploit Model(2022)4 cited
- → AEMB: An Automated Exploit Mitigation Bypassing Solution(2021)5 cited
- Evaluation of Two Host-Based Intrusion Prevention Systems(2005)