192 citations · 738 across the 61 of their papers we have counts for
68 papers
Pooled Testing under Congestion: Operational Scaling Laws for Pool-Size Selection
Ioannis Dimitriou, Johan van Leeuwaarden
Classical pooled-testing rules choose pool sizes to reduce the number of tests. In practice, however, samples arrive over time, pools take time to form, testing capacity is finite,…
Personalised versus Posted Pricing from Samples
Pieter Kleer, Johan van Leeuwaarden, Daan Noordenbos
Personalised pricing maximises expected revenue from a market but requires detailed information about individual customers. How much of this revenue can be recovered using a simple…
Sample-Based Prophet Inequalities for Random Walks
Pieter Kleer, Johan van Leeuwaarden, Daan Noordenbos
We study prophet inequalities for a random walk reward stopping problem with sample-based information. The goal is to stop as close as possible to the maximum of a random walk with…
Server saturation in skewed networks
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden
We consider a model inspired by compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. The constrain…
Second-order bounds for the M/M/ queue with random arrival rate
Wouter J. E. C. van Eekelen, Grani A. Hanasusanto, John J. Hasenbein +1
Consider an M/M/ queue with the additional feature that the arrival rate is a random variable of which only the mean, variance, and range are known. Using semi-infinite linear p…
Fluid limits for interacting queues in sparse dynamic graphs
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden
Consider a network of single-server queues where tasks arrive independently at each server at rate . The servers are connected by a graph that is resampled at rate i…
Sharpest possible clustering bounds using robust random graph analysis
Judith Brugman, Johan S. H. van Leeuwaarden, Clara Stegehuis
Complex network theory crucially depends on the assumptions made about the degree distribution, while fitting degree distributions to network data is challenging, in particular for…
Optimal Stopping Theory for a Distributionally Robust Seller
Pieter Kleer, Johan van Leeuwaarden
Sellers in online markets face the challenge of determining the right time to sell in view of uncertain future offers. Classical stopping theory assumes that sellers have full know…
Heavy-traffic single-server queues and the transform method
M. A. A. Boon, A. J. E. M. Janssen, J. S. H. van Leeuwaarden
Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let denote the steady-state waiting time in the ${\rm GI}/{\rm G}…
Utility maximizing load balancing policies
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden
Consider a service system where incoming tasks are instantaneously dispatched to one out of many heterogeneous server pools. Associated with each server pool is a concave utility f…
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…
Optimal capacity allocation for heavy-traffic fixed-cycle traffic-light queues and intersections
Marko Boon, Guido Janssen, Johan van Leeuwaarden +1
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably…
Learning and balancing unknown loads in large-scale systems
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden
Consider a system of identical server pools where tasks with exponentially distributed service times arrive as a time-inhomogenenous Poisson process. An admission threshold is used…
Self-Learning Threshold-Based Load Balancing
Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden +2
We consider a large-scale service system where incoming tasks have to be instantaneously dispatched to one out of many parallel server pools. The user-perceived performance degrade…
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…
Critical percolation on scale-free random graphs: New universality class for the configuration model
Souvik Dhara, Remco van der Hofstad, Johan S. H. van Leeuwaarden
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-…
Scale-free network clustering in hyperbolic and other random graphs
Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong degree heterogeneity. Mathematical analysis of such random graphs proved success…
Scalable load balancing in networked systems: A survey of recent advances
Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden +1
The basic load balancing scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one of single-server queues. We discuss recent advances…
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…
Triadic closure in configuration models with unbounded degree fluctuations
Remco van der Hofstad, Johan S. H. van Leeuwaarden, Clara Stegehuis
The configuration model generates random graphs with any given degree distribution, and thus serves as a null model for scale-free networks with power-law degrees and unbounded deg…
Optimal subgraph structures in scale-free configuration models
Remco van der Hofstad, Johan S. H. van Leeuwaarden, Clara Stegehuis
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of th…
Asymptotically Optimal Load Balancing Topologies
Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden
We consider a system of servers inter-connected by some underlying graph topology . Tasks arrive at the various servers as independent Poisson processes of rate . Each…
Economies-of-scale in resource sharing systems: tutorial and partial review of the QED heavy-traffic regime
Johan S. H. van Leeuwaarden, Britt W. J. Mathijsen, Bert Zwart
Multi-server queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospi…
Big jobs arrive early: From critical queues to random graphs
Gianmarco Bet, Remco van der Hofstad, Johan S. H. van Leeuwaarden
We consider a queue to which only a finite pool of customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement arr…