IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i2p748-783.html

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
    ---><---

    References listed on IDEAS

    as
    1. Itay Gurvich & Ward Whitt, 2009. "Queue-and-Idleness-Ratio Controls in Many-Server Service Systems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 363-396, May.
    2. Rami Atar & Adam Shwartz, 2008. "Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 899-909, November.
    3. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    4. Reza Aghajani & Kavita Ramanan, 2020. "The Limit of Stationary Distributions of Many-Server Queues in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1016-1055, August.
    5. H. Christian Gromoll & Philippe Robert & Bert Zwart, 2008. "Fluid Limits for Processor-Sharing Queues with Impatience," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 375-402, May.
    6. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    7. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cao, Ping & Zhong, Zhiheng, 2025. "Asymptotically optimal routing of a many-server parallel queueing system with long-run average criterion," European Journal of Operational Research, Elsevier, vol. 321(2), pages 462-475.
    2. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    3. Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    4. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    5. Cao, Ping & Zhong, Zhiheng & Huang, Junfei, 2021. "Dynamic routing in a distributed parallel many-server service system: The effect of ξ-choice," European Journal of Operational Research, Elsevier, vol. 294(1), pages 219-235.
    6. Ari Arapostathis & Guodong Pang, 2018. "Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 838-866, August.
    7. Burak Büke, 2022. "Modelling heterogeneity in many-server queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 401-403, April.
    8. Arapostathis, Ari & Pang, Guodong, 2019. "Infinite horizon asymptotic average optimality for large-scale parallel server networks," Stochastic Processes and their Applications, Elsevier, vol. 129(1), pages 283-322.
    9. Jinsheng Chen & Jing Dong, 2024. "Managing flexibility: optimal sizing and scheduling of flexible servers," Queueing Systems: Theory and Applications, Springer, vol. 108(3), pages 415-474, December.
    10. Hassan Hmedi & Ari Arapostathis & Guodong Pang, 2023. "On System-Wide Safety Staffing of Large-Scale Parallel Server Networks," Operations Research, INFORMS, vol. 71(2), pages 415-432, March.
    11. Merve Bodur & James R. Luedtke, 2017. "Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty," Management Science, INFORMS, vol. 63(7), pages 2073-2091, July.
    12. Seung Bum Soh & Itai Gurvich, 2026. "Technical Note—What’s in a Constraint? On the Ambiguity of Standard Delay Targets," Operations Research, INFORMS, vol. 74(1), pages 517-529, January.
    13. Zhenghua Long & Tolga Tezcan & Jiheng Zhang, 2024. "Routing and Staffing in Customer Service Chat Systems with Generally Distributed Service and Patience Times," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1674-1691, September.
    14. Dongyuan Zhan & Gideon Weiss, 2018. "Many-server scaling of the N-system under FCFS–ALIS," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 27-71, February.
    15. Adan, Ivo J.B.F. & Boon, Marko A.A. & Weiss, Gideon, 2019. "Design heuristic for parallel many server systems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 259-277.
    16. Yuan Li & David A. Goldberg, 2025. "Simple and Explicit Bounds for Multiserver Queues with 1 1 − ρ Scaling," Mathematics of Operations Research, INFORMS, vol. 50(2), pages 813-837, May.
    17. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    18. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    19. Dongyuan Zhan & Amy R. Ward, 2014. "Threshold Routing to Trade Off Waiting and Call Resolution in Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 220-237, May.
    20. Fiona Sloothaak & James Cruise & Seva Shneer & Maria Vlasiou & Bert Zwart, 2021. "Complete resource pooling of a load-balancing policy for a network of battery swapping stations," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 65-120, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

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

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.