  This paper introduces a novel control approach for network scheduling and
routing that is predictive and reliable in its nature, yet builds upon a linear
program, making it fast in execution. First, we describe the canonical system
model and how we expand it to be able to predict the success of transmissions.
Furthermore, we define a notion of reliability and then explain the algorithm.
With extended simulations, we demonstrate the gains in performance over the
well known MaxWeight policy.
