• Madeva N B
• Nandini B N
• Shree Lakshmi D P
• Chiranjeevi
• Dr. Hareesh K

Cloud computing is becoming more and more well-liked every day because of its adaptability and prompt availability of necessary resources. Requests are granted by offering the requested virtual machine in accordance with the conditions. If the vm placement takes longer than expected or the intended vms is not accessible, the guarantee will have been broken. It is quite challenging to forecast the quantity of customers and their needs in a continually changing market. The main resource is the virtualization technology. As a result, the virtual machine will be placed such that resources are used effectively and the agreement is not broken. To improve resource use, reduce wealth distribution time, and reduce service level agreement violations, the author of the current work presents a binary search tree-based virtual machine way to find the best. The binary search tree-based virtual machine deployment strategy's outcomes have been examined and contrasted with those of other techniques reported in the literature using the Cloudsim simulator.

Cloud Computing, Load Balancing, Cloudsim, Virtual Machine Placement

"A Binary search tree approach based on cloud-VM resource allocation", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.9, Issue 7, page no.e285-e290, July-2022, Available :http://www.jetir.org/papers/JETIR2207436.pdf

"A Binary search tree approach based on cloud-VM resource allocation", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.9, Issue 7, page no. ppe285-e290, July-2022, Available at : http://www.jetir.org/papers/JETIR2207436.pdf