Ticket Booking - Concert & Event Reservations

Interview-Ready Approach

1) Clarify Scope and SLOs

• •Problem statement: Design a Ticketmaster-like platform handling 500 k users competing for seats in a 50 k-capacity venue.
• •Design for a peak load target around 75,000 RPS (including burst headroom).
• •Concurrent users at sale: ~500,000
• •Venue capacity: 50,000 seats
• •Seat hold timeout: 5 minutes
• •Checkout confirmation: < 3 seconds
• •Double-booking tolerance: Zero

2) Capacity Planning Method

• •Convert traffic and growth constraints into request rate, storage growth, and concurrency budgets.
• •Keep at least 2-3x safety margin per tier (ingress, compute, storage, async workers).
• •Reserve explicit latency budgets per hop so p95 can be defended in review.

3) Architecture Decisions

• •Databases: Define a clear system-of-record and design read/write paths separately before adding optimizations.
• •Caching: Put cache on hot read paths first and pick cache-aside or write-through explicitly.
• •Rate Limiting: Enforce token/sliding-window limits at ingress and for sensitive internal APIs.
• •Message Queues: Move non-blocking and retry-heavy work to async consumers with explicit retry and DLQ policies.
• •Consistency: Classify operations by consistency requirement: strong for money/inventory, eventual for feeds/analytics.

4) Reliability and Failure Strategy

• •Use strong write constraints (transactions or conditional writes) and explicit backup/restore strategy.
• •Bound staleness with TTL + invalidation hooks for critical entities.
• •Return deterministic 429 behavior with clear retry headers.
• •Guarantee idempotent consumers and trace every message with correlation IDs.
• •Use idempotency keys and conflict-resolution rules on retried/distributed writes.

5) Validation Plan

• •Run one peak-load test, one dependency-degradation test, and one failover test.
• •Verify idempotency for all retried writes and async consumers.
• •Track user-facing SLOs first: p95 latency, error rate, and successful throughput.

6) Trade-offs to Call Out in Interviews

• •Databases: SQL gives stronger transactional guarantees; NoSQL often gives better write scaling and flexibility.
• •Caching: Higher hit rate cuts latency/cost, but stale data and invalidation bugs become primary risks.
• •Rate Limiting: Aggressive limits protect the system but can hurt legitimate burst traffic.
• •Message Queues: Async pipelines absorb spikes well, but increase eventual-consistency complexity.
• •Consistency: Stronger consistency improves correctness, but often increases latency and coordination costs.

Practical Notes

• •Use pessimistic locking (SELECT FOR UPDATE) or Redis atomic operations to prevent double-booking of seats.
• •A virtual waiting room (queue) with token-based admission controls the thundering herd problem.
• •Seat holds can use Redis keys with TTL - automatic release after 5 minutes if not purchased.

Why This Solution Works

Request path: The solution keeps ingress, service logic, and stateful dependencies separated so each layer can scale independently.

Reference flow: Web Clients -> Load Balancer -> API Gateway -> Rate Limiter -> API Service -> Primary SQL DB -> Read Model DB -> Redis Cache

Design strengths

• •Cache sits on the read path to absorb repeated queries and keep DB pressure stable.
• •Async queue/event bus isolates bursty workloads and supports retries without blocking synchronous requests.
• •Security controls are enforced at ingress to protect downstream capacity.

Interview defense

• •This design makes bottlenecks explicit (ingress, core compute, persistence, async workers).
• •It supports progressive scaling without re-architecting the core request path.
• •It keeps correctness-sensitive state changes in durable systems while offloading background work asynchronously.