Knowledge Guide
Home › System Design › Microservices Patterns

Retry Pattern An Example

To solidify these concepts, let’s examine a simple Java implementation of the Retry pattern without using any external frameworks. We’ll implement a utility that retries a given operation with a configurable policy. The code will illustrate a basic retry loop with options for constant vs. exponential backoff and jitter.

import java.util.concurrent.Callable;
import java.util.Random;

public class RetryUtil {

    /**
     * Retries the given task according to the specified parameters.
     *
     * @param task            The operation to perform (as a Callable returning a result of type T).
     * @param maxAttempts     Maximum number of attempts (initial try + retries).
     * @param baseDelayMillis Base delay in milliseconds before the first retry.
     * @param backoffFactor   Multiplicative factor for exponential backoff (e.g. 2.0 for doubling).
     * @param useJitter       Whether to randomize delays to avoid synchronized retries.
     * @return the result of the task if successful within the allowed attempts.
     * @throws Exception if the task fails in all attempts (the last encountered exception is thrown).
     */
    public static <T> T executeWithRetry(Callable<T> task, int maxAttempts,
                                         long baseDelayMillis, double backoffFactor, boolean useJitter) throws Exception {
        int attempt = 1;
        Exception lastException = null;
        Random random = new Random();
        
        while (attempt <= maxAttempts) {
            try {
                // Try to execute the task
                return task.call();
            } catch (Exception e) {
                lastException = e;  // Capture the exception for potential rethrow
                
                if (attempt == maxAttempts) {
                    // No retries left, break out to throw the exception
                    break;
                }
                
                // Calculate the delay before the next retry
                long delay = baseDelayMillis;
                if (backoffFactor > 1.0) {
                    // Exponential backoff: increase delay by backoff factor^(attempt-1)
                    delay = (long) (baseDelayMillis * Math.pow(backoffFactor, attempt - 1));
                }
                if (useJitter) {
                    // Add jitter: randomize the delay a bit to avoid herd effect
                    long jitter = (long) (random.nextDouble() * delay);
                    // Example: use "full jitter" strategy – random between 0 and the calculated delay
                    delay = jitter;
                }
                
                // Optionally, could cap the delay to a maximum value here to avoid excessively long waits.
                
                // Wait for the computed delay before retrying
                try {
                    Thread.sleep(delay);
                } catch (InterruptedException ie) {
                    // If sleep is interrupted, restore interrupt status and break (stop retrying)
                    Thread.currentThread().interrupt();
                    break;
                }
                
                // Increment attempt counter and loop to try again
                attempt++;
            }
        }
        // All attempts exhausted, throw the last caught exception to the caller
        throw lastException;
    }
}

In the code above, executeWithRetry is a generic utility that takes a Callable<T> (allowing any operation that returns a result of type T or throws an exception). The parameters maxAttempts, baseDelayMillis, backoffFactor, and useJitter define the retry policy:

Inside the loop, the logic is straightforward: call the task and catch any exception. If the call succeeds (task.call() returns), we return the result immediately. If an exception is thrown, we record it and check if we have retries left. If not (attempt == maxAttempts), we break out and later throw the exception. If yes, we calculate how long to sleep before the next attempt. We then use Thread.sleep to wait for that duration (handling InterruptedException properly by breaking out if interrupted). Then increment the attempt counter and loop again for the retry. If all attempts fail, we throw the last caught exception to the caller, so the caller knows the operation ultimately did not succeed.

Design Choices Explained: This basic implementation makes a few important design choices:

With this code in place, using the Retry Pattern in a microservice becomes as easy as wrapping calls through this utility. For example, if fetchData() is a function that calls an external API and might throw a TimeoutException, you could do:

String result = RetryUtil.executeWithRetry(
    () -> fetchData(url),
    3,            // try up to 3 times
    1000,         // start with 1 second delay
    2.0,          // exponential backoff factor (2x)
    true          // use jitter to avoid synchronized retries
);

This would attempt to fetch the data, and on failure, retry up to 2 more times, waiting 1s before the first retry and 2s before the second (with some randomness in those waits). If all attempts fail, it throws the exception after about 3 seconds of total wait. In many cases, that one retry might be all that’s needed to ride out a transient glitch and succeed on the second try, improving the robustness of the service.

🤖 Don't fully get this? Learn it with Claude

Stuck on Retry Pattern An Example? Open Claude, copy a block below, and it'll teach you this exact concept — visually and interactively.

🎨 Explain it visually

Build the mental picture, not memorization.

I just read a lesson on **Retry Pattern An Example** (System Design) and want to truly understand it. Explain Retry Pattern An Example from first principles using ONE vivid real-world analogy and a visual mental model — draw it as ASCII art or a clear step-by-step diagram — with a concrete example using real numbers. Then ask me one question to check I got the mental picture, and wait for my reply. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🤔 Walk me through it (interactive)

Socratic — adapts to where you're stuck.

Teach me **Retry Pattern An Example** interactively. Ask me ONE guiding question at a time, wait for my answer, and adapt to my confusion — build the idea with me step by step instead of explaining it all at once. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🧪 Quiz me & fix my gaps

Active recall exposes what you missed.

Quiz me on **Retry Pattern An Example** with 5 questions, easy to tricky, ONE at a time. Tell me if each answer is right; at the end, explain clearly what I got wrong and why. If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.
🧠 Make it stick

Intuition + hook + flashcards for long-term memory.

Help me remember **Retry Pattern An Example** for the long term: give the one-sentence intuition, a memorable hook/mnemonic, a tiny worked example, and 3 active-recall flashcards (Q -> A). If you're unsure or a claim isn't standard, say so and reason from first principles instead of guessing.

📝 My notes

← The Architecture of the Retry PattPerformance Implications →