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

Veena Goswami () and G. B. Mund ()
Additional contact information
Veena Goswami: Kalinga Institute of Industrial Technology
G. B. Mund: Kalinga Institute of Industrial Technology

Methodology and Computing in Applied Probability, 2024, vol. 26, issue 4, 1-24

Abstract: 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.

Keywords: Data center; Resource management; Discrete time; Informal queue; Unlimited batch size; Waiting time; 60K25; 68M20; 90B22 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-024-10128-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10128-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-024-10128-4

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().