Bound Retries with a Stated Backoff Budget

Supplied materials

• Paper and pencil; answers may also be spoken or typed.
• All cases, labels, numbers and rules are supplied on this page. No real account, private information or purchase is needed.

Learn the idea

A retry policy specifies when to retry, maximum attempts and delay scheduling. Bounded retries avoid indefinite repeated work. Our model has fixed listed delays and assumes no request-processing time; adding them gives waiting time only. Mutating operations still require safe repeated-effect semantics.

Add the listed retry delays and respect the maximum attempt rule. Retrying every failure indefinitely is not a reliability plan.

Use this supplied case: Policy allows three retry delays of 1,2,4 seconds after the initial request. Total delay budget, excluding request time? The task is to connect the given information to the computing idea. Write a short evidence trail so another learner can reproduce your choice. The simplified case describes the stated model, not every real system.

1. Represent the supplied worked case with a labeled drawing, table or short trace.
2. Add the listed retry delays and respect the maximum attempt rule.
3. Explain why the worked answer fits and why one alternative does not.
4. Try the new check and practice cases; revisit the stated rule if your evidence does not match.

Check your reasoning

Your answer is temporary and is not saved to an account. Download your current answer before leaving or reloading. Written work on paper or in another app stays in your own file.

Take it further

New retry delays 2, 5, 10 seconds total 17 seconds excluding processing. A maximum-attempt rule prevents unbounded repeated work.

Nothing here is saved to an account or sent to a teacher. The answer download includes your current choice and any checked feedback. It does not include choices from the separate More practice section. Download that section separately.