Optimizing Scheduled Virtual Machine Requests Placement in Cloud Environments: A Tabu Search Approach

This paper introduces a novel model for virtual machine (VM) requests with predefined start and end times, referred to as scheduled virtual machine demands (SVMs). In cloud computing environments, SVMs represent anticipated resource requirements derived from historical data, usage trends, and predictive analytics, allowing cloud providers to optimize resource allocation for maximum efficiency. Unlike traditional VMs, SVMs are not active concurrently. This allows providers to reuse physical resources such as CPU, RAM, and storage for time-disjoint requests, opening new avenues for optimizing resource distribution in data centers. To leverage this opportunity, we propose an advanced VM placement algorithm designed to maximize the number of hosted SVMs in cloud data centers. We formulate the SVM placement problem (SVMPP) as a combinatorial optimization challenge and introduce a tailored Tabu Search (TS) meta-heuristic to provide an effective solution. Our algorithm demonstrates significant improvements over existing placement methods, achieving up to a 15% increase in resource efficiency compared to baseline approaches. This advancement highlights the TS algorithm’s potential to deliver substantial scalability and optimization benefits, particularly for high-demand scenarios, albeit with a necessary consideration for computational cost.