# A New Backpressure Algorithm for Joint Rate Control and Routing with Vanishing Utility Optimality Gaps and Finite Queue Lengths

## TL;DR

This paper introduces a novel backpressure algorithm that achieves near-optimal utility with finite queue lengths, overcoming the traditional utility-delay tradeoff in multi-hop networks.

## Contribution

It proposes a new backpressure algorithm that guarantees vanishing utility gaps while maintaining bounded queue lengths, a significant improvement over existing methods.

## Key findings

- Utility gap approaches zero as the algorithm runs
- Queue lengths remain bounded by a finite constant
- The method uses a new convex programming approach

## Abstract

The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter $V$ in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon is known as the fundamental utility-delay tradeoff. The best known utility-delay tradeoff for general networks is $[O(1/V), O(V)]$ and is attained by a backpressure algorithm based on a drift-plus-penalty technique. This may suggest that to achieve an arbitrarily small utility optimality gap, the existing backpressure algorithms necessarily yield an arbitrarily large queue length. However, this paper proposes a new backpressure algorithm that has a vanishing utility optimality gap, so utility converges to exact optimality as the algorithm keeps running, while queue lengths are bounded throughout by a finite constant. The technique uses backpressure and drift concepts with a new method for convex programming.