Exponential Backoff
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
In networking and distributed systems, exponential backoff delays a retry by a base interval multiplied by an increasing power after each failure, typically one second, then two, then four, until the attempt succeeds or a cap is reached. Randomized jitter is usually added so that many clients do not retry at the same instant. The strategy reduces congestion, avoids livelock, and is the standard congestion-friendly retry policy used in TCP retransmission and API clients.
SCAFFOLDING EFFECT
Reduce cognitive load
- Retreat gracefully: after a rejection, lengthen the interval before the next attempt instead of retrying at once. - Add jitter: randomize the delay so parallel attempts do not collide at the same moment. - Cap the wait: set a maximum interval and attempt count so backoff never starves the request.
Anchor fast decisions
Retrying immediately after a failure adds load exactly when the system is already saturated, which deepens the congestion and raises the failure rate. Increasing the delay after each failure gives the system time to recover and reduces total attempts during the overload. Jitter decorrelates many independent clients, so their retries spread across time instead of arriving in a synchronized burst.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Exponential_backoffverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS