3 papers
math.PR2026
Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity
Diego Goldsztajn, Andres Ferragut
We consider processing networks where multiple dispatchers are connected to single-server queues by a bipartite compatibility graph, modeling constraints that are common in data ce…
math.PR2025
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 …
eess.SY2025
Dynamic load balancing for cloud systems under heterogeneous setup delays
Fernando Paganini, Diego Goldsztajn
We consider a distributed cloud service deployed at a set of distinct server pools. Arriving jobs are classified into heterogeneous types, in accordance with their setup times whic…