This article describes Lyapunov optimization for dynamical systems. It gives an example application to optimal control in queueing networks.
Article
This article describes Lyapunov optimization for dynamical systems. It gives an example application to optimal control in queueing networks.
Contents
Introduction
Lyapunov optimization refers to the use of a Lyapunov function to optimally control a dynamic system. Lyapunov functions are used extensively in control theory to ensure different forms of system stability. The state of a system at a particular time is often described by a multi-dimensional vector. A Lyapunov function is a nonnegative scalar measure of this multi-dimensional state. Typically, the function is defined to grow large when the system moves towards undesirable states. System stability is achieved by taking control actions that make the Lyapunov function drift in the negative direction towards zero.
Lyapunov drift is central to the study of optimal control in queueing networks. A typical goal is to stabilize all network queues while optimizing some performance objective, such as minimizing average energy or maximizing average throughput. Minimizing the drift of a quadratic Lyapunov function leads to the
backpressure routing algorithm for network stability, also called the max-weight algorithm.
Adding a weighted penalty term to the Lyapunov drift and minimizing the sum leads to the drift-plus-penalty algorithm for joint network stability and penalty minimization. The drift-plus-penalty procedure can also be used to compute solutions to convex programs and linear programs.
Lyapunov drift for queueing networks
Consider a queueing network that evolves in discrete time with normalized time slots
t
∈
{
0
,
1
,
2
,
…
}
.
{\displaystyle t\in \{0,1,2,\ldots \}.}
Suppose there are
N
{\displaystyle N}
queues in the network, and define the vector of queue backlogs at time
This function is a scalar measure of the total queue backlog in the network. It is called quadratic Lyapunov function on the queue state. Define the Lyapunov drift as the change in this function from one slot to the next:
Δ
L
(
t
)
=
L
(
Bounding the Lyapunov drift
Suppose the queue backlogs change over time according to the following equation:
In many cases, the network can be controlled so that the difference between arrivals and service at each queue satisfies the following property for some real number
then (Eq. 2) reduces to the drift condition used in the following Lyapunov drift theorem. The theorem below can be viewed as a variation on Foster's theorem for Markov chains. However, it does not require a Markov chain structure.
Theorem (Lyapunov Drift). Suppose there are constants
is non-negative and rearranging the terms in the above expression proves the result.
t
)
,
{\displaystyle r(t),}
the penalty can be defined
p
(
t
)
=
−
r
(
t
)
.
{\displaystyle p(t)=-r(t).}
This is useful for maximizing network throughout utility subject to stability.
To stabilize the network while minimizing the time average of the penalty
p
(
t
)
,
{\displaystyle p(t),}
network algorithms can be designed to make control actions that greedily minimize a bound on the following drift-plus-penalty expression on each slot
t
{\displaystyle t}
:
Δ
L
(
t
)
+
V
p
(
t
)
{\displaystyle \Delta L(t)+Vp(t)}
where
V
{\displaystyle V}
is a non-negative weight that is chosen as desired to affect a performance tradeoff. A key feature of this approach is that it typically does not require knowledge of the probabilities of the random network events (such as random job arrivals or channel realizations). Choosing
V
=
0
{\displaystyle V=0}
reduces to minimizing a bound on the drift every slot and, for routing in multi-hop queueing networks, reduces to the backpressure routing algorithm developed by Tassiulas and Ephremides. Using
V
>
0
{\displaystyle V>0}
and defining
p
(
t
)
{\displaystyle p(t)}
as the network power use on slot
t
{\displaystyle t}
leads to the drift-plus-penalty algorithm for minimizing average power subject to network stability developed by Neely. Using
V
>
0
{\displaystyle V>0}
and using
p
(
t
)
{\displaystyle p(t)}
as the negative of an admission control utility metric leads to the drift-plus-penalty algorithm for joint flow control and network routing developed by Neely, Modiano, and Li.
A generalization of the Lyapunov drift theorem of the previous section is important in this context. For simplicity of exposition, assume
represent a desired target for the time average of
p
(
t
)
.
{\displaystyle p(t).}
Let
V
{\displaystyle V}
be a parameter used to weight the importance of meeting the target. The following theorem shows that if a drift-plus-penalty condition is met, then the time average penalty is at most O(1/V) above the desired target, while average queue size is O(V). The
V
{\displaystyle V}
parameter can be tuned to make time average penalty as close to (or below) the target as desired, with a corresponding queue size tradeoff.
Theorem (Lyapunov Optimization). Suppose there are constants
