IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v322y2025i1p133-146.html
   My bibliography  Save this article

Optimal capacity planning for cloud service providers with periodic, time-varying demand

Author

Listed:
  • Furman, Eugene
  • Diamant, Adam

Abstract

Allocating capacity to private cloud computing services is challenging because demand is time-varying, there are often no buffers, and customers can re-submit jobs a finite number of times. We model this setting using a multi-station queueing network where servers represent CPU cores and jobs not immediately processed retry several times. Assuming retrial rates are stationary and that there is a maximum number of retrial attempts, we determine an optimal service capacity and retrial interval under an admission control policy employed by our partner institution — the server informs customers when they should next attempt service without enforcement. We introduce a recursive representation of the offered load which approximates the fluid dynamics of the system. We then use this representation to develop a solution technique that minimizes the total variation in the constructed offered load. We prove this approach is linked to maximizing system throughput and that in certain settings, the optimal stationary and time-varying retrial intervals are equivalent. Utilizing a data set of cloud computing requests spanning a 24-hour period, our analysis indicates that the optimal policy prescribes a 10% reduction in capacity. We also investigate the fidelity of the fluid model and the sensitivity of our recommendations to the behavior of retrial jobs. We find that retrial-time announcements allow a provider to satisfy service level agreements while encouraging retrial jobs to be processed during off-peak periods. Further, the policy is suitably robust to a customer’s willingness to comply with the suggested retrial times.

Suggested Citation

  • Furman, Eugene & Diamant, Adam, 2025. "Optimal capacity planning for cloud service providers with periodic, time-varying demand," European Journal of Operational Research, Elsevier, vol. 322(1), pages 133-146.
  • Handle: RePEc:eee:ejores:v:322:y:2025:i:1:p:133-146
    DOI: 10.1016/j.ejor.2024.11.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724008865
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.11.017?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:ejores:v:322:y:2025:i:1:p:133-146. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.