Bounded Retry
A retry strategy that sets a maximum number of retry attempts and uses an exponential backoff algorithm, such as 1s, 2s, 4s, 8s, to control retry intervals. Once the limit is reached, it gives up and returns a definite result. It suits interactive scenarios by ensuring requests do not hang indefinitely.
Timeline (last 90 days)
In circuit breaker design, exponential backoff addresses not crushing the provider yourself, while bounded retries address not letting one user action turn into thousands of billed calls, and both must exist simultaneously.
The bounded retry strategy uses exponential backoff within a bounded number of attempts (such as 1 second, 2 seconds, 4 seconds, 8 seconds...), ensuring the request eventually returns a definite result rather than hanging indefinitely; the infinite wait mode sets no cap on the number of attempts, trading uncertainty for a higher eventual success rate.
All Facts (2)
In circuit breaker design, exponential backoff addresses not crushing the provider yourself, while bounded retries address not letting one user action turn into thousands of billed calls, and both must exist simultaneously.
50%UnverifiedThe bounded retry strategy uses exponential backoff within a bounded number of attempts (such as 1 second, 2 seconds, 4 seconds, 8 seconds...), ensuring the request eventually returns a definite result rather than hanging indefinitely; the infinite wait mode sets no cap on the number of attempts, trading uncertainty for a higher eventual success rate.
50%