Asynchronous subgradient methods with unbounded delays for communication networks

Dual decomposition coupled with the subgradient method has found application to optimal resource management in communication networks, as it can lead to distributed and scalable algorithms. Network entities-nodes or functional layers-exchange Lagrange multipliers and primal minimizers of the Lagrangian function towards optimizing a network-wide performance metric. It is of interest to study the performance of the resultant algorithms when such exchanges are delayed or lost. This paper deals with such asynchronous dual subgradient methods in separable convex programming. In this scenario, the subgradient vector is a sum of components, each possibly corresponding to an outdated Lagrange multiplier, and not the current one. A number of network entities is allowed to prematurely stop updating their corresponding variables, thereby effecting infinite delay between the current iterate and the multipliers used for a number of subgradient components. Conditions for convergence of the algorithm are developed. Specific applications include multipath routing in wireline networks and cross-layer optimization in wireless networks. Numerical tests for multipath routing in the Abilene network topology are presented.

[1]  Asuman E. Ozdaglar,et al.  Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..

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

[3]  Michael Patriksson,et al.  On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems , 2003, Eur. J. Oper. Res..

[4]  Krzysztof C. Kiwiel,et al.  Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization , 2003, SIAM J. Optim..

[5]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.

[6]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[7]  Steven H. Low,et al.  Optimization flow control with on-line measurement or multiple paths , 1999 .

[8]  K. Kiwiel,et al.  Parallel Subgradient Methods for Convex Optimization , 2001 .

[9]  Michael Patriksson,et al.  Ergodic, primal convergence in dual subgradient schemes for convex programming , 1999, Mathematical programming.

[10]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[11]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[12]  Georgios B. Giannakis,et al.  Cross-Layer Designs in Coded Wireless Fading Networks With Multicast , 2010, IEEE/ACM Transactions on Networking.

[13]  Georgios B. Giannakis,et al.  Residential Load Control: Distributed Scheduling and Convergence With Lost AMI Messages , 2012, IEEE Transactions on Smart Grid.