Stability and delay of distributed scheduling algorithms for networks of conflicting queues
This paper explains recent results on distributed algorithms for networks of conflicting queues. At any given time, only specific subsets of queues can be served simultaneously. The challenge is to select the subsets in a distributed way to stabilize the queues whenever the arrival rates are feasible.
scheduling wireless networks carrier sense multiple access markov chain lyapunov analysis optimization 68m12 68m20