Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Articles Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource An Enhanced Approximation Algorithm Using Red Black Tree and HashMap for Virtual Machine Placement Problem Subject The topic of the resource Approximation algorithm; Cloud computing; HashMap; Red Black Tree; Virtual machine; Virtual machine placement Description An account of the resource The virtual machine placement problem (VMPP) is an np-hard optimization problem in cloud computing that involves efficiently allocating virtual machines (VMs) to physical hosts in such a way that the resource wastage is minimized, and resource usage is optimal while ensuring adequate performance. This paper proposes a modified best-fit approximation algorithm using Red Black Tree (RBT) and HashMap for addressing the VMPP with enhanced computational efficiency in such a way that the active hosts in a given data center remains minimum possible. The proposed algorithm builds up on the existing best-fit approximation algorithm by using RBT and HashMap. The proposed approach considers various attributes such as CPU utilization, memory requirements, and network bandwidth while allocating virtual machines. To evaluate the performance the simulation is done in cloudsim environment with PlanetLab workload. Test cases are considered in both homogeneous and heterogeneous environments and results are taken. Comparative analyses were performed against existing benchmark algorithms in terms of time complexity and resource usage in terms of active hosts. The results demonstrate that the proposed algorithm outperforms the existing algorithms and guarantees time complexity of O(log n) and give better results compared to other algorithms. 2024, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. Creator An entity primarily responsible for making the resource John R.R.; Kanaga E.G.M.; Lovesum J.; Sandeep S.G. Source A related resource from which the described resource is derived SN Computer Science, Vol-5, No. 1 Publisher An entity responsible for making the resource available Springer Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/s42979-023-02465-x" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s42979-023-02465-x</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85181458050&amp;doi=10.1007%2Fs42979-023-02465-x&amp;partnerID=40&amp;md5=8c6d509ecfebac92eac0e92f42798d16" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85181458050&amp;doi=10.1007%2fs42979-023-02465-x&amp;partnerID=40&amp;md5=8c6d509ecfebac92eac0e92f42798d16</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 2662995X Format The file format, physical medium, or dimensions of the resource Online Language A language of the resource English Type The nature or genre of the resource Article Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant John R.R., Karunya Institute of Technology and Sciences, Tamil Nadu, Coimbatore, India; Kanaga E.G.M., Karunya Institute of Technology and Sciences, Tamil Nadu, Coimbatore, India; Lovesum J., Christ (Deemed to be University), Karnataka, Bangalore, India; Sandeep S.G., Karunya Institute of Technology and Sciences, Tamil Nadu, Coimbatore, India