IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v93y2019i3d10.1007_s11134-019-09633-y.html
   My bibliography  Save this article

Job assignment in large-scale service systems with affinity relations

Author

Listed:
  • Ellen Cardinaels

    (Eindhoven University of Technology)

  • Sem C. Borst

    (Eindhoven University of Technology)

  • Johan S. H. Leeuwaarden

    (Eindhoven University of Technology)

Abstract

We consider load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be assigned to a fast, primary server from a particular selection associated with this job or to a secondary server to be processed at a slower rate. Such job–server affinity relations can model network topologies based on geographical proximity, or data locality in cloud scenarios. We introduce load balancing schemes that assign jobs to primary servers if available, and otherwise to secondary servers. A novel coupling construction is developed to obtain stability conditions and performance bounds. We also conduct a fluid limit analysis for symmetric model instances, which reveals a delicate interplay between the model parameters and load balancing performance.

Suggested Citation

  • Ellen Cardinaels & Sem C. Borst & Johan S. H. Leeuwaarden, 2019. "Job assignment in large-scale service systems with affinity relations," Queueing Systems: Theory and Applications, Springer, vol. 93(3), pages 227-268, December.
    • Handle: RePEc:spr:queues:v:93:y:2019:i:3:d:10.1007_s11134-019-09633-y
    DOI: 10.1007/s11134-019-09633-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-019-09633-y
    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-019-09633-y?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.

    References listed on IDEAS

    as
    1. Hunt, P. J. & Kurtz, T. G., 1994. "Large loss networks," Stochastic Processes and their Applications, Elsevier, vol. 53(2), pages 363-378, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dieter Fiems & Eline De Cuypere & Koen De Turck & Dieter Claeys, 2020. "Performance Analysis of Hybrid MTS/MTO Systems with Stochastic Demand and Production," Mathematics, MDPI, vol. 8(11), pages 1-16, November.

    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. Itai Gurvich & Ohad Perry, 2012. "Overflow Networks: Approximations and Implications to Call Center Outsourcing," Operations Research, INFORMS, vol. 60(4), pages 996-1009, August.
    2. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    3. Golshid Baharian & Tolga Tezcan, 2011. "Stability analysis of parallel server systems under longest queue first," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 257-279, October.
    4. Andjel, Enrique & López, F. Javier & Sanz, Gerardo, 2002. "Ergodicity of one-dimensional resource sharing systems," Stochastic Processes and their Applications, Elsevier, vol. 98(1), pages 1-22, March.
    5. Ohad Perry & Ward Whitt, 2013. "A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle," Mathematics of Operations Research, INFORMS, vol. 38(2), pages 294-349, May.
    6. Debankur Mukherjee & Sem C. Borst & Johan S. H. van Leeuwaarden & Philip A. Whiting, 2020. "Asymptotic Optimality of Power-of- d Load Balancing in Large-Scale Systems," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1535-1571, November.
    7. Yiran Liu & Harsha Honnappa & Samy Tindel & Nung Kwan Yip, 2021. "Infinite server queues in a random fast oscillatory environment," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 145-179, June.
    8. Jun Luo & Jiheng Zhang, 2013. "Staffing and Control of Instant Messaging Contact Centers," Operations Research, INFORMS, vol. 61(2), pages 328-343, April.
    9. Ohad Perry & Ward Whitt, 2011. "A Fluid Approximation for Service Systems Responding to Unexpected Overloads," Operations Research, INFORMS, vol. 59(5), pages 1159-1170, October.
    10. Castiel, Eyal & Borst, Sem & Miclo, Laurent & Simatos, Florian & Whiting, Phil, 2020. "Induced idleness leads to deterministic heavy traffic limits for queue-based random-access algorithms," TSE Working Papers 20-1129, Toulouse School of Economics (TSE).
    11. Varun Gupta & Neil Walton, 2019. "Load Balancing in the Nondegenerate Slowdown Regime," Operations Research, INFORMS, vol. 67(1), pages 281-294, January.
    12. Mor Harchol-Balter, 2022. "The multiserver job queueing model," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 201-203, April.
    13. Edieal Pinker & Tolga Tezcan, 2013. "Determining the Optimal Configuration of Hospital Inpatient Rooms in the Presence of Isolation Patients," Operations Research, INFORMS, vol. 61(6), pages 1259-1276, December.

    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:93:y:2019:i:3:d:10.1007_s11134-019-09633-y. 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: 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.