Near-Optimal Virtual Machine Packing Based on Resource Requirement of Service Demands Using Pattern Clustering
Yaghoob Siahmargooei, Mohammad Kazem Akbari, Seyyed Alireza Hashemi, Golpayegani, Saeed Sharifian

TL;DR
This paper presents a model for efficiently packing virtual machines in cloud environments by analyzing service demand patterns through clustering, aiming to optimize resource utilization and reduce costs.
Contribution
It introduces a novel resource allocation model based on pattern clustering to improve virtual machine packing in cloud computing.
Findings
Achieved near-optimal VM packing efficiency.
Reduced cloud resource rental costs.
Enhanced scalability and flexibility in resource management.
Abstract
Upon the expansion of Cloud Computing and the positive outlook of organizations with regard to the movements towards using cloud computing and their expanding utilization of such valuable processing method, as well as the solutions provided by the cloud infrastructure providers with regard to the reduction of the costs of processing resources, the problem of organizing resources in a cloud environment gained a high importance. One of the major preoccupations of the minds of cloud infrastructure clients is their lack of knowledge on the quantity of their required processing resources in different periods of time. The managers and technicians are trying to make the most use of scalability and the flexibility of the resources in cloud computing. The main challenge is with calculating the amount of the required processing resources per moment with regard to the quantity of incoming requests…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · IoT and Edge/Fog Computing · Graph Theory and Algorithms
