Lingering issues in distributed scheduling
Recent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However, fundamental performance bounds reveal that the cautious activation rules involved in establishing throughput optimality tend to produce extremely large delays, typically growing exponentially in \(1/(1{-}\rho )\), with \(\rho \) the load of the system, in contrast to the usual linear growth. Motivated by that issue, we explore to what extent more aggressive schemes can improve the delay performance. Our main finding is that aggressive activation rules induce a lingering effect, where individual nodes retain possession of a shared resource for excessive lengths of time even while a majority of other nodes idle. Using central limit theorem type arguments, we prove that the idleness induced by the lingering effect may cause the delays to grow with \(1/(1{-}\rho )\) at a quadratic rate. To the best of our knowledge, these are the first mathematical results illuminating the lingering effect and quantifying the performance impact. In addition extensive simulation experiments are conducted to illustrate and validate the various analytical results.
delay performance distributed scheduling algorithms heavy traffic scaling wireless networks 68m20 90b18 90b22