Job assignment in large-scale service systems with affinity relations

DOI10.1007/S11134-019-09633-YzbMATH Open1432.60083arXiv1812.10703OpenAlexW2979666196WikidataQ127100634 ScholiaQ127100634MaRDI QIDQ2297809FDOQ2297809

Johan S. H. van Leeuwaarden, Sem Borst, Ellen Cardinaels

Publication date: 20 February 2020

Published in: Queueing Systems (Search for Journal in Brave)

Abstract: We consider load balancing in service systems with affinity relations between jobs and servers. Specifically, an arriving job can be allocated 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 allocate jobs to primary servers if available, and otherwise to secondary servers. A novel coupling construction is developed to obtain stability conditions and performance bounds using a coupling technique. We also conduct a fluid limit analysis for symmetric model instances, which reveals a delicate interplay between the model parameters and load balancing performance.

Full work available at URL: https://arxiv.org/abs/1812.10703

Recommendations

• scientific article; zbMATH DE number 4172728
• Comparing job allocation schemes where service demand is unknown
• Staffing large-scale service systems with distributional uncertainty
• Multi-objective Large-Scale Staff Allocation
• scientific article; zbMATH DE number 679866
• Assignment of a job load in a distributed system: A multicriteria design method
• Asymptotically optimal staffing of service systems with joint QoS constraints
• Analysis of job assignment with batch arrivals among heterogeneous servers
• Search and the Efficient Assignment of Workers to Jobs

zbMATH Keywords

load balancingnetwork topologyjob schedulingfluid limitstochastic coupling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• Title not available (Why is that?)
• Martingale proofs of many-server heavy-traffic limits for Markovian queues
• Point processes and queues. Martingale dynamics
• Large loss networks
• Title not available (Why is that?)
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• Heavy traffic resource pooling in parallel-server systems
• The Effect of Increasing Routing Choice on Resource Pooling
• On the stability of a partially accessible multi-station queue with state-dependent routing
• Sample path methods in the control of queues
• OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
• Dynamic and equilibrium behavior of controlled loss networks
• SCALABLE LOAD BALANCING IN NETWORKED SYSTEMS: UNIVERSALITY PROPERTIES AND STOCHASTIC COUPLING METHODS
• Sample Path Criteria for Weak Majorization
• Universality of Power-of-d Load Balancing in Many-Server Systems
• The equilibrium states of large networks of Erlang queues
• Loss Networks

Cited In (4)

• Power-of-two sampling in redundancy systems: the impact of assignment constraints
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Stochastic non-bipartite matching models and order-independent loss queues
• Comparing job allocation schemes where service demand is unknown

This page was built for publication: Job assignment in large-scale service systems with affinity relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297809)