Accelerated Backpressure Algorithm

2013/02/06 by Michael Zargham, Alejandro Ribeiro, Zargham, Michael +3 · 1 citation
Business, Management and Accounting · Computer Science · Engineering · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #FOS: Mathematics #Network Traffic and Congestion Control #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1302.1475

openalex publication_date 2013/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

We develop an Accelerated Back Pressure (ABP) algorithm using Accelerated Dual Descent (ADD), a distributed approximate Newton-like algorithm that only uses local information. Our construction is based on writing the backpressure algorithm as the solution to a network feasibility problem solved via stochastic dual subgradient descent. We apply stochastic ADD in place of the stochastic gradient descent algorithm. We prove that the ABP algorithm guarantees stable queues. Our numerical experiments demonstrate a significant improvement in convergence rate, especially when the packet arrival statistics vary over time.

Citations

• Accelerated Dual Descent for Network Optimization

Cited by

• Network Newton-Part I: Algorithm and Convergence

Related

• Novel Architectures and Algorithms for Delay Reduction in Back-pressure\n Scheduling and Routing
• Enhancing the Delay Performance of Dynamic Backpressure Algorithms
• A New Backpressure Algorithm for Joint Rate Control and Routing with Vanishing Utility Optimality Gaps and Finite Queue Lengths
• Backpressure-based Packet-by-Packet Adaptive Routing in Communication\n Networks
• Multi-Agent Q-Learning Aided Backpressure Routing Algorithm for Delay Reduction