pith. sign in

arxiv: 1812.10703 · v1 · pith:UZHQHBKGnew · submitted 2018-12-27 · 🧮 math.PR

Job Allocation in Large-Scale Service Systems with Affinity Relations

classification 🧮 math.PR
keywords affinitybalancingloadmodelrelationsserverscouplingjobs
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.