Enhancing Cloud Task Scheduling With a Robust Security Approach and Optimized Hybrid POA

Authors:
Open Access
Publisher website
Google Scholar
Abstract
Dynamic and flexible computing resources are offered by cloud computing (CC), which has gained popularity as a computing technology. Efficient task scheduling (TS) plays a critical role in CC by optimizing the distribution of tasks across available resources to achieve maximum performance. The allocation of computational tasks in a cloud environment is a complicated process that is affected by multiple factors, such as available network bandwidth, make span, and cost considerations. Therefore, it is crucial to optimize available bandwidth for efficient TS in CC. In the present research, a novel pelican-based approach is introduced to optimize TS in the CC environment. The newly developed method also utilizes a security approach called Polymorphic Advanced Encryption Standard (P-AES) to encode cloud information during scheduling. The study evaluates the proposed algorithm’s performance in terms of the make span, resource utilization, cost, response time, throughput, latency, execution time, speed, and bandwidth utilization. The simulation is carried out using the Python tool, and it effectively handles a wide range of tasks from 1000 to 5000. The proposed algorithm offers a new perspective on utilizing pelican algorithms to optimize task scheduling in CC. The hybrid optimization enables the proposed algorithm to provide efficient task scheduling by exploiting the strengths of entire algorithms. The proposed approach offers an innovative solution to the challenges of scheduling tasks in cloud environments and provides a more effective and secure way of optimizing cloud services. Overall, this study provides valuable insights into task scheduling optimization in CC and offers an effective approach for enhancing the performance of CC services.

This publication has 47 references indexed in Scilit: