IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i2p748-783.html
   My bibliography  Save this article

Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes

Author

Listed:
  • Burak Büke

    (The University of Edinburgh, School of Mathematics, Edinburgh EH9 3FD, United Kingdom of Great Britain and Northern Ireland)

  • Wenyi Qin

    (School of Computer Science and Engineering, Beihang University, Beijing 100191, People’s Republic of China)

Abstract

We consider many-server queueing systems with heterogeneous exponential servers, for which the service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy-traffic diffusion limits of these queues using measure-valued stochastic processes. We introduce the measure-valued fairness process, which denotes the proportion of cumulative idleness experienced by servers whose rates fall in a Borel subset of the support of the service rates. It can be shown that these processes do not converge in the usual Skorokhod- J 1 topology. Hence, we introduce a new notion of convergence based on shifted versions of these processes. We also introduce some useful martingales to identify limiting fairness processes under different routing policies. To demonstrate the power of our framework, we show how it can be used to prove diffusion limits for parallel server systems with within-pool heterogeneity.

Suggested Citation

  • Burak Büke & Wenyi Qin, 2023. "Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 748-783, May.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:2:p:748-783
    DOI: 10.1287/moor.2022.1280
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1280
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1280?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:2:p:748-783. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.