Hybrid Electro search beetle optimization based task scheduling and game theory SOA based resource allocation in multi cloud computing

The most complicated process in multi-cloud computing is resource allocation, as it needs to cope with a number of configurations and constraints of cloud providers and customers. At the time of resource allocation, the centralized cloud broker monitors the virtual machines (VM) status, scheduling process, and fitness. However, VM scheduling is found tedious and has received huge attention in business, academia, and research. This enhances the demand for both task scheduling and resource allocation in a multi-cloud environment. To bridge the gap between the consumer requirement and server infrastructure, a joint optimization-based resource allocation and task scheduling concept is analyzed in the proposed framework. The first phase introduces the task scheduling mechanism, which uses Hybrid Electro Search and Beetle Swarm Optimization to determine the optimal task for specific VMs. The optimal selection procedure is done by analyzing a multi-cloud environment's makespan, energy, cost, and throughput parameters. In the second step, an Adaptive Game Theory-based Seagull optimization approach performs several rounds of reassignment iteratively to minimize the variation in the expected completion time, consequently decreasing high energy consumption and load balancing. The experimental analysis for the proposed model is implemented using Python. The proposed methodology is shown to achieve cheaper costs, shorter waiting times, improved resource allocation, and efficient load balancing. Finally, a comparative analysis is performed with some hybrid optimization models, which illustrate the efficiency of the proposed hybrid optimization model.