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…