Title :
Compact formulation of Network Entropy Maximization
Author_Institution :
AT&T Labs. - Res., Florham Park, NJ, USA
Abstract :
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.
Keywords :
convex programming; maximum entropy methods; routing protocols; PEFT; compact formulation; convex optimization problem; link-state routing protocol; min-cost multicommodity flow; network entropy maximization; uneven traffic splitting; Equations; Protocols; Interior gateway protocol; PEFT; network entropy maximization; routing;
Conference_Titel :
Information Sciences and Systems (CISS), 2012 46th Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4673-3139-5
Electronic_ISBN :
978-1-4673-3138-8
DOI :
10.1109/CISS.2012.6310762
