IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i11p3960-3981.html
   My bibliography  Save this article

Mean field approximations to a queueing system with threshold-based workload control scheme

Author

Listed:
  • Qihui Bu
  • Liwei Liu
  • Yiqiang Q. Zhao

Abstract

In this paper, motivated by considerations of server utilization and energy consumption in cloud computing, we investigate a homogeneous queueing system with a threshold-based workload control scheme. In this system, a virtual machine will be turned off when there are no tasks in its buffer upon the completion of a service by the machine, and turned on when the number of tasks in its buffer reaches a pre-set threshold value. Due to complexity of this system, we propose approximations to system performance measures by mean field limits. An iterative algorithm is suggested for the solution to the mean field limit equations. In addition, numerical and simulation results are presented to justify the proposed approximation method and to provide a numerical analysis on the impact of the system performances by system parameters, which suggests that the proposed system saves about (1−λμ)×100% of the energy consumption compared to the ordinary supermarket models.

Suggested Citation

  • Qihui Bu & Liwei Liu & Yiqiang Q. Zhao, 2023. "Mean field approximations to a queueing system with threshold-based workload control scheme," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(11), pages 3960-3981, June.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:11:p:3960-3981
    DOI: 10.1080/03610926.2021.1983601
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1983601
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1983601?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.

    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:taf:lstaxx:v:52:y:2023:i:11:p:3960-3981. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.