IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v14y2022i11p333-d972589.html
   My bibliography  Save this article

A Cost-Aware Framework for QoS-Based and Energy-Efficient Scheduling in Cloud–Fog Computing

Author

Listed:
  • Husam Suleiman

    (Department of Computer Engineering, College of Computer and Information Technology, Jordan University of Science and Technology, Irbid 22110, Jordan)

Abstract

Cloud–fog computing is a large-scale service environment developed to deliver fast, scalable services to clients. The fog nodes of such environments are distributed in diverse places and operate independently by deciding on which data to process locally and which data to send remotely to the cloud for further analysis, in which a Service-Level Agreement (SLA) is employed to govern Quality of Service (QoS) requirements of the cloud provider to such nodes. The provider experiences varying incoming workloads that come from heterogeneous fog and Internet of Things (IoT) devices, each of which submits jobs that entail various service characteristics and QoS requirements. To execute fog workloads and meet their SLA obligations, the provider allocates appropriate resources and utilizes load scheduling strategies that effectively manage the executions of fog jobs on cloud resources. Failing to fulfill such demands causes extra network bottlenecks, service delays, and energy constraints that are difficult to maintain at run-time. This paper proposes a joint energy- and QoS-optimized performance framework that tolerates delay and energy risks on the cost performance of the cloud provider. The framework employs scheduling mechanisms that consider the SLA penalty and energy impacts of data communication, service, and waiting performance metrics on cost reduction. The findings prove the framework’s effectiveness in mitigating energy consumption due to QoS penalties and therefore reducing the gross scheduling cost.

Suggested Citation

  • Husam Suleiman, 2022. "A Cost-Aware Framework for QoS-Based and Energy-Efficient Scheduling in Cloud–Fog Computing," Future Internet, MDPI, vol. 14(11), pages 1-21, November.
    • Handle: RePEc:gam:jftint:v:14:y:2022:i:11:p:333-:d:972589
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/14/11/333/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/14/11/333/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Maroua Nouiri & Abdelghani Bekrar & Abderezak Jemai & Smail Niar & Ahmed Chiheb Ammari, 2018. "An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 603-615, March.
    2. Li, Xinyu & Gao, Liang, 2016. "An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 174(C), pages 93-110.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fei Luan & Zongyan Cai & Shuqiang Wu & Shi Qiang Liu & Yixin He, 2019. "Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    2. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    3. Lu Sun & Lin Lin & Haojie Li & Mitsuo Gen, 2019. "Cooperative Co-Evolution Algorithm with an MRF-Based Decomposition Strategy for Stochastic Flexible Job Shop Scheduling," Mathematics, MDPI, vol. 7(4), pages 1-20, March.
    4. An, Youjun & Chen, Xiaohui & Hu, Jiawen & Zhang, Lin & Li, Yinghe & Jiang, Junwei, 2022. "Joint optimization of preventive maintenance and production rescheduling with new machine insertion and processing speed selection," Reliability Engineering and System Safety, Elsevier, vol. 220(C).
    5. Mohamed Habib Zahmani & Baghdad Atmani, 2021. "Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation," Journal of Scheduling, Springer, vol. 24(2), pages 175-196, April.
    6. Robson Flavio Castro & Moacir Godinho-Filho & Roberto Fernandes Tavares-Neto, 2022. "Dispatching method based on particle swarm optimization for make-to-availability," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 1021-1030, April.
    7. Xiaoqiu Shi & Wei Long & Yanyan Li & Dingshan Deng, 2020. "Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems," PLOS ONE, Public Library of Science, vol. 15(5), pages 1-23, May.
    8. Xuan Jing & Xifan Yao & Min Liu & Jiajun Zhou, 2024. "Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 35(1), pages 75-93, January.
    9. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.
    10. Weian Guo & Lei Zhu & Lei Wang & Qidi Wu & Fanrong Kong, 2019. "An Entropy-Assisted Particle Swarm Optimizer for Large-Scale Optimization Problem," Mathematics, MDPI, vol. 7(5), pages 1-12, May.
    11. Ivan Lorencin & Nikola Anđelić & Vedran Mrzljak & Zlatan Car, 2019. "Genetic Algorithm Approach to Design of Multi-Layer Perceptron for Combined Cycle Power Plant Electrical Power Output Estimation," Energies, MDPI, vol. 12(22), pages 1-26, November.
    12. Mohd. Shaaban Hussain & Mohammed Ali, 2019. "A Multi-agent Based Dynamic Scheduling of Flexible Manufacturing Systems," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 20(3), pages 267-290, September.
    13. Jann Michael Weinand & Kenneth Sorensen & Pablo San Segundo & Max Kleinebrahm & Russell McKenna, 2020. "Research trends in combinatorial optimisation," Papers 2012.01294, arXiv.org.
    14. Hyun Cheol Lee & Chunghun Ha, 2019. "Sustainable Integrated Process Planning and Scheduling Optimization Using a Genetic Algorithm with an Integrated Chromosome Representation," Sustainability, MDPI, vol. 11(2), pages 1-23, January.
    15. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    16. Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2021. "Production and transport scheduling in flexible job shop manufacturing systems," Journal of Global Optimization, Springer, vol. 79(2), pages 463-502, February.
    17. Fei Luan & Zongyan Cai & Shuqiang Wu & Tianhua Jiang & Fukang Li & Jia Yang, 2019. "Improved Whale Algorithm for Solving the Flexible Job Shop Scheduling Problem," Mathematics, MDPI, vol. 7(5), pages 1-14, April.
    18. Lunardi, Willian T. & Birgin, Ernesto G. & Ronconi, Débora P. & Voos, Holger, 2021. "Metaheuristics for the online printing shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 293(2), pages 419-441.
    19. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R & M. Calle, 2020. "Scheduling a dual-resource flexible job shop with makespan and due date-related criteria," Annals of Operations Research, Springer, vol. 291(1), pages 5-35, August.
    20. Mobin, Mohammadsadegh & Li, Zhaojun & Cheraghi, S. Hossein & Wu, Gongyu, 2019. "An approach for design Verification and Validation planning and optimization for new product reliability improvement," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:14:y:2022:i:11:p:333-:d:972589. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.