A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
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 routingdoi:10.1109/cdc.2007.4434661 dblp:conf/cdc/SubramanianL07 fatcat:fndh43tkn5eqnd4p4uk5shsyxq