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

Spot Market Cloud Orchestration Using Task-Based Redundancy and Dynamic Costing

Author

Listed:
  • Vyas O’Neill

    (Department of Computer Science and Information Technology, La Trobe University, Melbourne 3083, Australia)

  • Ben Soh

    (Department of Computer Science and Information Technology, La Trobe University, Melbourne 3083, Australia)

Abstract

Cloud computing has become ubiquitous in the enterprise environment as its on-demand model realizes technical and economic benefits for users. Cloud users demand a level of reliability, availability, and quality of service. Improvements to reliability generally come at the cost of additional replication. Existing approaches have focused on the replication of virtual environments as a method of improving the reliability of cloud services. As cloud systems move towards microservices-based architectures, a more granular approach to replication is now possible. In this paper, we propose a cloud orchestration approach that balances the potential cost of failure with the spot market running cost, optimizing the resource usage of the cloud system. We present the results of empirical testing we carried out using a simulator to compare the outcome of our proposed approach to a control algorithm based on a static reliability requirement. Our empirical testing showed an improvement of between 37% and 72% in total cost over the control, depending on the specific characteristics of the cloud models tested. We thus propose that in clouds where the cost of failure can be reasonably approximated, our approach may be used to optimize the cloud redundancy configuration to achieve a lower total cost.

Suggested Citation

  • Vyas O’Neill & Ben Soh, 2023. "Spot Market Cloud Orchestration Using Task-Based Redundancy and Dynamic Costing," Future Internet, MDPI, vol. 15(9), pages 1-17, August.
    • Handle: RePEc:gam:jftint:v:15:y:2023:i:9:p:288-:d:1226253
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/15/9/288/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/15/9/288/
    Download Restriction: no
    ---><---

    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:15:y:2023:i:9:p:288-:d:1226253. 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: 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.