Asynchronous Incremental Stochastic Dual Descent Algorithm for Network Resource Allocation
arXiv:1702.08290 · doi:10.1109/TSP.2018.2807423
Abstract
Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as energy and bandwidth are divided among nodes to satisfy certain long-term objectives. This paper proposes an asynchronous incremental dual decent resource allocation algorithm that utilizes delayed stochastic {gradients} for carrying out its updates. The proposed algorithm is well-suited to heterogeneous networks as it allows the computationally-challenged or energy-starved nodes to, at times, postpone the updates. The asymptotic analysis of the proposed algorithm is carried out, establishing dual convergence under both, constant and diminishing step sizes. It is also shown that with constant step size, the proposed resource allocation policy is asymptotically near-optimal. An application involving multi-cell coordinated beamforming is detailed, demonstrating the usefulness of the proposed algorithm.
References in corpus (12)
- Smart Grid Communications: Overview of Research Challenges, Solutions, and Standardization Activities
- D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
- Asynchronous Distributed ADMM for Large-Scale Optimization- Part I: Algorithm and Convergence Analysis
- Distributed Delayed Stochastic Optimization
- Proximity Without Consensus in Online Multi-Agent Optimization
- Stochastic Averaging for Constrained Optimization with Application to Online Resource Allocation
- Cross-Layer Designs in Coded Wireless Fading Networks with Multicast
- Asynchronous stochastic convex optimization
- AdaDelay: Delay Adaptive Distributed Stochastic Convex Optimization
- Decentralized Consensus Algorithm with Delayed and Stochastic Gradients
- Asynchronous adaptive networks
- Asynchronous Decentralized Stochastic Optimization in Heterogeneous Networks
Cited by in corpus (6)
- Model-Free Learning of Optimal Ergodic Policies in Wireless Systems
- Privacy-Preserving Push-Pull Method for Decentralized Optimization via State Decomposition
- Unsupervised Learning for Asynchronous Resource Allocation in Ad-hoc Wireless Networks
- Asynchronous Decentralized Stochastic Optimization in Heterogeneous Networks
- Straggler-Robust Distributed Optimization in Parameter-Server Networks
- Practical Precoding via Asynchronous Stochastic Successive Convex Approximation