3 papers
math.PR2026
Measure-valued fluid limits for partial service queues with correlated patience and service times
Diego Goldsztajn, Fernando Paganini, Andres Ferragut
We consider a many-server queue where tasks with general patience and service times arrive as a renewal process. Contrary to the standard assumptions, we allow for preemption and a…
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.PR2024
Optimal local storage policy based on stochastic intensities and its large scale behavior
Matias Carrasco, Andres Ferragut, Fernando Paganini
In this paper, we analyze the optimal management of local memory systems, using the tools of stationary point processes. We provide a rigorous setting of the problem, building upon…