Instability of backoff protocols with arbitrary arrival rates

TL;DR

This paper proves that no stable backoff protocols exist for any positive arrival rate of processors, confirming a long-standing conjecture, by introducing a new domination technique to handle message dependencies.

Contribution

It establishes the instability of all backoff protocols for positive arrival rates, except for a specific constrained case, advancing understanding of contention resolution.

Findings

Proves Aldous' conjecture for all but a special case

Introduces a new domination technique for analyzing dependencies

Shows instability at any positive arrival rate

Abstract

In contention resolution, multiple processors are trying to coordinate to send discrete messages through a shared channel with limited communication. If two processors send at the same time, the messages collide and are not transmitted successfully. Queue-free backoff protocols are an important special case - for example, Google Drive and AWS instruct their users to implement binary exponential backoff to handle busy periods. It is a long-standing conjecture of Aldous (IEEE Trans. Inf. Theory 1987) that no stable backoff protocols exist for any positive arrival rate of processors. This foundational question remains open; instability is only known in general when the arrival rate of processors is at least 0.42 (Goldberg et al. SICOMP 2004). We prove Aldous' conjecture for all backoff protocols outside of a tightly-constrained special case using a new domination technique to get around the main difficulty, which is the strong dependencies between messages.