Network optimization under uncertainty

Network optimization problems are often solved by dual gradient descent algorithms which can be implemented in a distributed manner but are known to have slow convergence rates. The accelerated dual descent (ADD) method improves this convergence rate by distributed computation of approximate Newton steps. This paper shows that a stochastic version of ADD can be used to solve network optimization problems with uncertainty in the constraints as is typical of communication networks. We prove almost sure convergence to an error neighborhood when the mean square error of the uncertainty is bounded and give a more restrictive sufficient condition for exact almost sure convergence to the optimal point. Numerical experiments show that stochastic ADD converges in two orders of magnitude fewer iterations than stochastic gradient descent.

[1]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Asuman E. Ozdaglar,et al.  A distributed Newton method for Network Utility Maximization , 2010, 49th IEEE Conference on Decision and Control (CDC).

[3]  Alejandro Ribeiro,et al.  Distributed Network Optimization With Heuristic Rational Agents , 2012, IEEE Transactions on Signal Processing.

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[5]  Michael J. Neely.  Energy Optimal Control for Time-Varying Wireless Networks , 2006, IEEE Trans. Inf. Theory.

[6]  John G. Klincewicz,et al.  A Newton method for convex separable network flow problems , 1983, Networks.

[7]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[8]  Alejandro Ribeiro,et al.  Separation Principles in Wireless Networking , 2010, IEEE Transactions on Information Theory.

[9]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

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

[11]  Alejandro Ribeiro,et al.  Accelerated Dual Descent for Network Flow Optimization , 2014, IEEE Transactions on Automatic Control.

[12]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[13]  Xuan Kong,et al.  Adaptive Signal Processing Algorithms: Stability and Performance , 1994 .

[14]  Asuman E. Ozdaglar,et al.  A distributed newton method for network optimization , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[15]  Steven H. Low,et al.  Convergence of Asynchronous Optimization Flow Control , 1999, Broadband Communications.

[16]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[17]  Alejandro Ribeiro,et al.  Ergodic Stochastic Optimization Algorithms for Wireless Communication and Networking , 2010, IEEE Transactions on Signal Processing.

[18]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

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

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

[22]  Alejandro Ribeiro,et al.  Accelerated dual descent for network optimization , 2011, Proceedings of the 2011 American Control Conference.