6 papers
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…
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…
First passage times to congested states of many-server systems in the Halfin-Whitt regime
Brian H. Fralix, Charles Knessl, Johan S. H. van Leeuwaarden
We consider the heavy-traffic approximation to the queueing system in the Halfin-Whitt regime, where both the number of servers and the arrival rate grow large (ta…