What are Retry Algorithms?

A retry algorithm determines how long to wait between repeated attempts to perform an action that has failed. Different strategies offer various trade-offs between aggressive retries and avoiding system overload.

Available Strategies

• Linear Retry: Increases wait time by a fixed amount each retry
• Exponential Backoff: Doubles (or multiplies) wait time each retry
• Capped Exponential: Like exponential but with a maximum delay

Jitter

Adding randomness to retry delays helps prevent thundering herd problems when multiple clients are retrying simultaneously.