Compact formulation of Network Entropy Maximization
Dahai Xu · 2012
Any min-cost multi-commodity flow can be realized with a link-state routing protocol, PEFT, using uneven traffic splitting. PEFT was derived from a new convex optimization problem, Network Entropy Maximization (NEM), which involves an infinite number of variables. In this paper, we present the compact and equivalent formulation of the NEM problem.