Exactly-once processing challenges in HLD - System Design Guide

Problem Statement

When processing messages or events, duplicates or lost messages cause incorrect results or inconsistent state. Systems that retry operations to handle failures risk processing the same message multiple times, leading to data corruption or double charges.

Solution

Exactly-once processing ensures each message affects the system state only once, even with retries or failures. This is achieved by combining idempotent operations, deduplication, and transactional guarantees to track and commit processing atomically.

Architecture

Message Queue

(with unique

→Processing

↓

Deduplication Cache

Deduplication Cache

This diagram shows a message queue delivering uniquely identified messages to a processing component that performs idempotent operations. The state store uses transactions and deduplication cache to ensure each message updates state exactly once.

Trade-offs

✓ Pros

→

Prevents data corruption and inconsistent state caused by duplicate processing.

→

Improves reliability by safely allowing retries without side effects.

→

Supports strong correctness guarantees critical for financial and inventory systems.

✗ Cons

→

Adds complexity in tracking message IDs and managing deduplication state.

→

May increase latency due to transactional overhead and coordination.

→

Requires careful design to handle state store failures and cache eviction.

Use when processing critical data where duplicates cause severe errors, such as payments, inventory updates, or user account changes, especially at scale above thousands of messages per second.

Avoid when processing is naturally idempotent or duplicates have no harmful effects, or when system scale is low (under hundreds of messages per second) and complexity outweighs benefits.

Real World Examples

Uber

Uber uses exactly-once processing in their trip billing system to avoid double charging riders despite retries and network failures.

Stripe

Stripe ensures exactly-once payment processing to prevent duplicate charges during network retries or system crashes.

LinkedIn

LinkedIn applies exactly-once semantics in their messaging platform to avoid duplicate notifications and maintain consistent user state.

Alternatives

At-least-once processing

Processes messages one or more times, risking duplicates but simpler to implement.

Use when: When occasional duplicates are acceptable and system simplicity or throughput is prioritized.

At-most-once processing

Processes messages zero or one time, risking message loss but no duplicates.

Use when: When losing some messages is acceptable but duplicates must be avoided.

Summary

Exactly-once processing prevents duplicate effects from retries or failures in message processing.

It combines idempotent operations, deduplication, and transactional state updates to ensure correctness.

This pattern is essential for critical systems like payments but adds complexity and overhead.

Practice

1. What is the main goal of exactly-once processing in distributed systems?

easy

A. To ensure each message or transaction is processed only once without duplicates or losses

B. To process messages as fast as possible without caring about duplicates

C. To allow multiple processing attempts for fault tolerance

D. To ignore message ordering for simplicity

Solution

1. Step 1: Understand exactly-once processing definition

   Exactly-once processing means each message or transaction is handled one time only, avoiding duplicates or losses.

2. Step 2: Compare options with definition

   To ensure each message or transaction is processed only once without duplicates or losses matches the definition exactly. Other options either ignore duplicates, allow multiple processing, or ignore ordering, which are not goals of exactly-once.

3. Final Answer:

   To ensure each message or transaction is processed only once without duplicates or losses -> Option A

4. Quick Check:

   Exactly-once = no duplicates or losses [OK]

Hint: Exactly-once means no duplicates, no losses [OK]

Common Mistakes:

• Confusing exactly-once with at-least-once or at-most-once
• Ignoring message loss scenarios
• Assuming speed over correctness

2. Which of the following is a key technique to achieve exactly-once processing?

easy

A. Processing messages in any order without tracking

B. Using unique message IDs and idempotent operations

C. Ignoring message duplicates and retrying indefinitely

D. Dropping messages after first failure

Solution

1. Step 1: Identify techniques for exactly-once

   Exactly-once requires unique IDs to detect duplicates and idempotent operations to safely retry without side effects.

2. Step 2: Evaluate options

   Using unique message IDs and idempotent operations correctly lists these techniques. Options A, B, and D either ignore tracking or order, ignore duplicates, or drop messages, which break exactly-once guarantees.

3. Final Answer:

   Using unique message IDs and idempotent operations -> Option B

4. Quick Check:

   Unique IDs + idempotency = exactly-once [OK]

Hint: Unique IDs + idempotent ops ensure exactly-once [OK]

Common Mistakes:

• Assuming retries alone guarantee exactly-once
• Ignoring idempotency importance
• Not using unique identifiers

3. Consider a system where a message with ID 123 is processed twice due to a retry. The processing function is idempotent. What is the expected outcome?

medium

A. The second processing has no additional effect, preserving exactly-once semantics

B. The message is processed twice causing duplicate side effects

C. The system crashes due to duplicate message ID

D. The message is ignored completely

Solution

1. Step 1: Understand idempotent processing

   Idempotent means running the same operation multiple times has the same effect as running it once.

2. Step 2: Analyze retry with same message ID

   Since the function is idempotent, the second processing does not cause duplicate side effects, preserving exactly-once behavior.

3. Final Answer:

   The second processing has no additional effect, preserving exactly-once semantics -> Option A

4. Quick Check:

   Idempotent retry = no duplicate effect [OK]

Hint: Idempotent means retry won't duplicate effects [OK]

Common Mistakes:

• Assuming retries always cause duplicates
• Confusing idempotency with no retries
• Thinking system crashes on duplicate IDs

4. A system designed for exactly-once processing is dropping some messages after retries fail. What is the likely cause?

medium

A. Using unique IDs for messages

B. Retrying messages indefinitely

C. Implementing idempotent operations

D. Lack of transactional guarantees causing message loss

Solution

1. Step 1: Identify cause of message drops

   Dropping messages after retries usually means the system lacks transactional guarantees to ensure messages are not lost.

2. Step 2: Evaluate options

   Lack of transactional guarantees causing message loss correctly identifies this cause. Options A and C help prevent duplicates, and D would avoid drops by retrying indefinitely.

3. Final Answer:

   Lack of transactional guarantees causing message loss -> Option D

4. Quick Check:

   Missing transactions = message loss [OK]

Hint: No transactions cause message loss on failure [OK]

Common Mistakes:

• Confusing idempotency with message loss prevention
• Assuming retries always prevent drops
• Ignoring transactional role

5. You are designing a payment processing system that must guarantee exactly-once processing despite network failures. Which combination of strategies best ensures this?

hard

A. Drop duplicate payments and rely on manual reconciliation

B. Retry payments without tracking IDs and ignore failures

C. Use unique transaction IDs, idempotent payment operations, and a transactional message queue

D. Process payments asynchronously without acknowledgments

Solution

1. Step 1: Identify requirements for exactly-once in payments

   Payments must not be duplicated or lost, even with network failures.

2. Step 2: Evaluate strategies

   Unique transaction IDs detect duplicates, idempotent operations prevent repeated side effects, and transactional queues ensure atomic message delivery.

3. Step 3: Compare options

   Use unique transaction IDs, idempotent payment operations, and a transactional message queue combines all needed strategies. Options A, B, and C risk duplicates, losses, or manual errors.

4. Final Answer:

   Use unique transaction IDs, idempotent payment operations, and a transactional message queue -> Option C

5. Quick Check:

   IDs + idempotency + transactions = exactly-once [OK]

Hint: Combine IDs, idempotency, and transactions for exactly-once [OK]

Common Mistakes:

• Ignoring transactional guarantees
• Not using unique IDs
• Relying on manual fixes