IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v109y2025i3d10.1007_s11134-025-09945-2.html
   My bibliography  Save this article

An infinite server system with packing constraints and ranked servers

Author

Listed:
  • Alexander L. Stolyar

    (University of Illinois at Urbana-Champaign)

Abstract

A service system with multiple types of customers, arriving as Poisson processes, is considered. The system has infinite number of servers, ranked by $$1,2,3, \ldots $$ 1 , 2 , 3 , … ; a server rank is its “location." Each customer has an independent exponentially distributed service time, with the mean determined by its type. Multiple customers (possibly of different types) can be placed for service into one server, subject to “packing” constraints. Service times of different customers are independent, even if served simultaneously by the same server. The large-scale asymptotic regime is considered, such that the mean number of customers r goes to infinity. We seek algorithms with the underlying objective of minimizing the location (rank) U of the right-most (highest ranked) occupied (non-empty) server. Therefore, this objective seeks to minimize the total number Q of occupied servers and keep the set of occupied servers as far at the “left” as possible, i.e., keep U close to Q. In previous work, versions of Greedy Random (GRAND) algorithm have been shown to asymptotically minimize Q/r as $$r\rightarrow \infty $$ r → ∞ . In this paper, we show that when these algorithms are combined with the First-Fit rule for “taking” empty servers, they asymptotically minimize U/r as well.

Suggested Citation

  • Alexander L. Stolyar, 2025. "An infinite server system with packing constraints and ranked servers," Queueing Systems: Theory and Applications, Springer, vol. 109(3), pages 1-24, September.
    • Handle: RePEc:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09945-2
    DOI: 10.1007/s11134-025-09945-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-025-09945-2
    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/s11134-025-09945-2?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:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09945-2. 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.