Stability and probability 1 convergence for queueing networks via Lyapunov optimization

Lyapunov drift is a powerful tool for optimizing stochastic queueing networks subject to stability. however,the most convenient drift conditions often provide results in terms of a time average expectation,rather than a pure time average. this paper provides an extended drift-plus-penalty result that ensures stability with desired time averages with probability 1. the analysis uses the law of large numbers for martingale differences. this is applied to quadratic and subquadratic lyapunov methods for minimizing the time average of a network penalty function subject to stability and to additional time average constraints. similar to known results for time average expectations,this paper shows that pure time average penalties can be pushed arbitrarily close to optimality,with a corresponding tradeoff in average queue size. further,in the special case of quadratic lyapunov functions,the basic drift condition is shown to imply all major forms of queue stability. copyright © 2012 michael j. neely.