Dynamic Network Utility Maximization with Delivery Contracts

We consider a multi-period variation on the network utility maximization problem that includes delivery constraints. We allow the flow utilities, link capacities and routing matrices to vary over time, and we introduce the concept of delivery contracts, which couple the flow rates across time. We describe a distributed algorithm, based on dual decomposition, that solves this problem when all data is known ahead of time. We briefly describe a heuristic, based on model predictive control, for approximately solving a variation on the problem, in which the data are not known ahead of time. The formulation and algorithms are illustrated with numerical examples.

[1]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[2]  N. Shor.  Nondifferentiable Optimization and Polynomial Problems , 1998 .

[3]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[4]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Rakesh V. Vohra,et al.  Mathematics of the Internet , 2001 .

[6]  Angelia NediÄ,et al.  Subgradient methods for convex minimization , 2002 .

[7]  Marko Bacic,et al.  Model predictive control , 2003 .

[8]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[9]  Dimitri P. Bertsekas,et al.  Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..

[10]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[11]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[12]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[13]  Dimitri P. Bertsekas,et al.  Stochastic optimal control : the discrete time case , 2007 .

[14]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[15]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[16]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[17]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[18]  Angelia Nedic,et al.  On the rate of convergence of distributed subgradient methods for multi-agent optimization , 2007, 2007 46th IEEE Conference on Decision and Control.

[19]  G. Cho.  A NEW PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR OPTIMIZATION , 2009 .

[20]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[21]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[22]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[23]  O. Nelles,et al.  An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.

[24]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[25]  Angelia Nedic,et al.  Subgradient methods for convex minimization , 2002 .

[26]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[27]  Jan M. Maciejowski,et al.  Predictive control : with constraints , 2002 .