activity
20182024
collaborators

5 papers

math.PR2024

Multi-dimensional state space collapse in non-complete resource pooling scenarios

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

The present paper establishes an explicit multi-dimensional state space collapse (SSC) for parallel-processing systems with arbitrary compatibility constraints between servers and…

math.PR2021

Power-of-two sampling in redundancy systems: the impact of assignment constraints

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

A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assi…

math.PR2020

Heavy-Traffic Universality of Redundancy Systems with Assignment Constraints

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

Service systems often face task-server assignment-constraints due to skill-based routing or geographical conditions. Redundancy scheduling responds to this limited flexibility by r…

math.PR2018

Job Allocation in Large-Scale Service Systems with Affinity Relations

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

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

cs.DS2018

Finding induced subgraphs in scale-free inhomogeneous random graphs

Ellen Cardinaels, Johan S. H. van Leeuwaarden, Clara Stegehuis

We study the problem of finding a copy of a specific induced subgraph on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that find…