Online Tool Store
Retry & Backoff Calculator
Plan retry timing for flaky network calls - set base delay, multiplier, max retries, jitter, and a cap - and see every attempt delay plus total worst-case wait time. Runs entirely in your browser.
🔒 This tool runs entirely in your browser. Your files are never uploaded to a server.
Worst-case total wait
Last attempt delay (no jitter)
Attempt delays
| Attempt | Base delay | With jitter (example) |
|---|
How it works
- Set a base delay, growth multiplier, retry count, and an optional delay cap.
- Each attempt's delay is calculated as base × multiplier^(attempt − 1), clamped to the cap.
- Toggle full jitter to see a randomized example delay alongside the deterministic value.
- Read the worst-case total wait time to size timeouts and user-facing loading states.
FAQ
What is exponential backoff?
A retry strategy where each failed attempt waits longer than the last, typically by multiplying the previous delay by a fixed factor, up to a maximum cap. It reduces load on a struggling service instead of hammering it with immediate retries.
Why add jitter?
If many clients retry on the exact same schedule, they can all hit the server at the same moment ("thundering herd"). Adding randomness (jitter) to each delay spreads retries out over time.
How is the delay cap used?
Once the calculated delay would exceed the cap, it is clamped to the cap value. This keeps retries from growing unbounded on later attempts.
Does this calculator make real network calls?
No — it only computes delay timing based on the numbers you enter. Nothing is sent anywhere.
How we compare
| Feature | Online Tool Store | Writing it by hand |
|---|---|---|
| See the whole retry schedule instantly | ✓ | ✗ |
| Compare jittered vs. deterministic delays | ✓ | Requires a script |
Tuning retry parameters by trial and error in production is risky. This calculator lets you preview the full delay schedule and worst-case wait before wiring it into your code.