Spatial Inefficiency of MaxWeight Scheduling
MaxWeight scheduling has gained enormous popularity as a powerful paradigm for achieving queue stability and maximum throughput in a wide variety of scenarios. The maximum-stability guarantees however rely on the fundamental premise that the system consists of a fixed set of flows with stationary ergodic traffic processes. In the paper the authors examine networks where the population of active flows varies over time, as flows eventually end while new flows occasionally start. They show that MaxWeight policies may fail to provide maximum stability due to persistent inefficient spatial reuse.