Capped Exponential Retry Budget Calculator

Method, formula and assumptions

There are attempts - 1 waits. Wait i = min(cap, initial x multiplier^i), starting at i = 0. Add all waits and all per-attempt timeouts for a worst-case serial budget.

Input definitions and supported units

• Initial backoff (seconds): Measured or assumed numerical value, from 0 to 10000; zero is supported where the stated method permits it.
• Backoff multiplier: Measured or assumed numerical value, from 1 to 10; must be positive.
• Maximum wait (seconds): Measured or assumed numerical value, from 0 to 100000; zero is supported where the stated method permits it.
• Total attempts including first: Whole-number count, from 1 to 100; must be positive.
• Timeout per attempt (seconds): Measured or assumed numerical value, from 0 to 10000; zero is supported where the stated method permits it.

Worked example with answer

Five attempts with 1-second initial wait, multiplier 2 and 10-second cap use waits of 1, 2, 4 and 8 seconds: 15 seconds total. Five 2-second timeouts add 10, giving 25 seconds worst case.

How to use the results

This includes the first attempt; a single attempt has no backoff. The last wait result shows whether the cap is active.

Results retain full precision internally and display up to four decimal places. Very small nonzero results use scientific notation rather than appearing as zero. Check the labels before comparing values across units.

Limitations and references

Excludes jitter, server Retry-After overrides, cancellation and overlapping attempts. Worst-case elapsed is not average latency, and retries must suit idempotency requirements.

The method is a self-contained arithmetic, geometric or explicitly stated mathematical model. There are no imported tariffs, empirical presets or equipment specifications; measured values and allowances must come from your own process.

Related planning tools

• Token Bucket Burst Drain Calculator
• Cache Hit Rate Backend Load Calculator

Browse all Digital Infrastructure calculators