Draining time based scheduling algorithm
Subramanian, Vijay G. and Leith, Douglas J. (2008) Draining time based scheduling algorithm. Conference on Decision and Control, 2007 46th IEEE .
Distributed scheduling and routing policies that perform well are increasingly being sought for multi-hop wireless infrastructure networks. The state-of-the-art max-pressure algorithms have provably optimal stability properties but in networks with cycles and loops the delay performance can be quite poor at rates that are not very close to the capacity region boundary. We propose a new scheduling and routing policy to try to address this that results in serving the longest queue but routing packets along (dynamic) shortest-path routes. For a two-node relay we prove stability for our policy using fluid limits.
Repository Staff Only: item control page