4 citations · 4 across the 5 of their papers we have counts for
8 papers
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…
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…
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…
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…
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…
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…