We consider a system of $N$~parallel single-server queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate $\lambda(N)$.
The isoperiemtric profile of a Graph is a function that measures, for an integer k, is the size of the smallest edge boundary over all sets of vertices of size k.
