IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0346727.html

Research on hybrid cloud resource scheduling optimization algorithm based on EMPA-ASA

Author

Listed:
  • Zhigang Zhang
  • Jiaqi Gao
  • Rong Liu
  • Qibing Tao

Abstract

Hybrid–cloud scheduling must balance cost, performance, and reliability; yet existing approaches often suffer from burdensome parameter tuning, a limited set of optimized QoS indicators, and high computational overhead. To address these issues, we propose an EMPA–ASA–based hybrid–cloud resource scheduling algorithm and make three contributions: 1) we realize state-driven adaptive scheduling and resource allocation via MDP + Q-learning, updating the policy online as system conditions evolve; 2) we introduce an M/M/c queueing model to quantitatively encode QoS constraints, thereby improving responsiveness and load adaptivity; and 3) we fuse EMPA with Adaptive Simulated Annealing (ASA), augmented by Lévy flights to strengthen global exploration and accelerate convergence. We implement a full prototype and conduct performance evaluations. The results show that EMPA–ASA outperforms baselines across multiple QoS metrics—including end-to-end delay, response time, throughput, and packet-loss rate—and reduces total cost by approximately 48% and 70% relative to GA and PSO, respectively; its advantages in QoS and cost are especially pronounced under high-load scenarios. These findings indicate a superior cost–performance trade-off, providing an efficient and reliable solution for hybrid–cloud resource scheduling.

Suggested Citation

  • Zhigang Zhang & Jiaqi Gao & Rong Liu & Qibing Tao, 2026. "Research on hybrid cloud resource scheduling optimization algorithm based on EMPA-ASA," PLOS ONE, Public Library of Science, vol. 21(4), pages 1-25, April.
  • Handle: RePEc:plo:pone00:0346727
    DOI: 10.1371/journal.pone.0346727
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0346727
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0346727&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0346727?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0346727. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.