Abstract

Scheduling is an NP-hard problem, and metaheuristic algorithms are often used to find approximate solutions within a feasible time frame. Existing metaheuristic algorithms, such as ACO, PSO, and BOA address this problem either in cloud or fog environments. However, when these environments are combined into a hybrid cloud-fog environment, these algorithms become inefficient due to inadequate handling of local and global search strategies. This inefficiency leads to suboptimal scheduling across the cloud-fog environment because the algorithms fail to adapt effectively to the combined challenges of both environments. In our proposed Improved Butterfly Optimization Algorithm (IBOA), we enhance adaptability by dynamically updating the computation cost, communication cost, and total cost, effectively balancing both local and global search strategies. This dynamic adaptation allows the algorithm to select the best resources for executing tasks in both cloud and fog environments. We implemented our proposed approach in the CloudSim simulator and compared it with traditional algorithms such as ACO, PSO, and BOA. The results demonstrate that IBOA offers significant reductions in total cost, communication cost, and computation cost by 19.65%, 18.28%, and 25.41%, respectively, making it a promising solution for real-world cloud-fog computing (CFC) applications.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.