IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v26y2024i4d10.1007_s11009-024-10128-4.html
   My bibliography  Save this article

Discrete-Time Informal Queue with an Infinite Number of Groups for Resource Management of a Data Center

Author

Listed:
  • Veena Goswami

    (Kalinga Institute of Industrial Technology)

  • G. B. Mund

    (Kalinga Institute of Industrial Technology)

Abstract

We consider the resource management of a data center by using a discrete-time single-server queue with an unlimited-size batch service, where the next queue to be served is the one with the most senior waiting client (the so-called ‘Informal Queue’). Large jobs or tasks are submitted for processing by users from different applications or organizations in a cloud data center setting. There is an endless number of groups in the queue, a very dynamic and diverse workload, and an endless stream of tasks or jobs arriving every day. We analyze the Geo/Geo/1 informal queue with an early arrival system and a late arrival system with delayed access policies. Various key performance measures, such as steady-state distribution of the number of groups in the system, sojourn times and waiting times of a group leader, sojourn times and waiting times of an arbitrary client, and number of sidestep groups, are obtained. Explicit-form expressions are found for both policies. We illustrate several numerical results and present an application of the discussed model in data centers. Finally, it is demonstrated that in the limiting case, the outcomes found in this article tend to the continuous-time counterpart.

Suggested Citation

  • Veena Goswami & G. B. Mund, 2024. "Discrete-Time Informal Queue with an Infinite Number of Groups for Resource Management of a Data Center," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-24, December.
  • Handle: RePEc:spr:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10128-4
    DOI: 10.1007/s11009-024-10128-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-024-10128-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11009-024-10128-4?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:spr:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10128-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.