Feature Summary
Introduce a new FibonacciRetryPolicy to the Typhoon library. This policy calculates wait intervals between retries based on the Fibonacci sequence $$F_n=F_{n-1}+F_{n-2}$$, providing a natural progression for backoff timing.
Motivation
Currently, most retry libraries offer fixed or exponential backoff. While exponential backoff is powerful, it can sometimes grow too rapidly for certain distributed systems. A Fibonacci sequence offers a "middle ground" that increases delay more gradually than powers of 2, often aligning better with how systems recover from transient failures.
Feature Summary
Introduce a new$$F_n=F_{n-1}+F_{n-2}$$ , providing a natural progression for backoff timing.
FibonacciRetryPolicyto the Typhoon library. This policy calculates wait intervals between retries based on the Fibonacci sequenceMotivation
Currently, most retry libraries offer fixed or exponential backoff. While exponential backoff is powerful, it can sometimes grow too rapidly for certain distributed systems. A Fibonacci sequence offers a "middle ground" that increases delay more gradually than powers of 2, often aligning better with how systems recover from transient failures.