mufassall

Communication / 2 / 6

Message queues

A shop sends an order email through a provider that takes 100 messages a second, and a sale brings 600 orders a second. How a queue absorbs the spike, and what you must set on it: leases, acks, backoff, a dead-letter queue and backpressure.

  • 14 min
  • Intermediate
  • 12 steps
Order p95
950 ms
Backlog
0
Email delay
1 s
Lost emails
0 /h
Open in Lab

30%
  • request
  • reply
  • redelivery
  • duplicate
  • lost
  • call: the reply returns on the same line

Numbers are a model scenario, not measurements

The real request

Shop API → Mail provider

Request

POST /v1/send HTTP/1.1
Host: mail.example.com
Authorization1: hidden

{
  "to": "u_42@example.com",
  "template": 2"order_paid",
  "order_id": "ord_5521"
}

Response

HTTP/1.1 202 Accepted
X-Response-Time3: 820 ms
  1. Authorization · hidden — The shop's API key at the provider. Hidden here.
  2. template — Which email to send. The provider fills it with the order data.
  3. X-Response-Time — 820 ms of every order request is spent waiting for someone else.

What happens if…?

Put in your own numbers: the result and the formula update at once.

Jobs per second put into the queue.

Workers taking jobs from the queue in parallel.

How long one worker needs to send one email.

Result

Utilisation ρ
0.80
Chance to wait
80%
Mean wait in queue
80ms
Total (wait + work)
100ms
Mean jobs waiting
3.2

Working

μ = 1000 / 20 ms = 50.0/s
ρ = λ / (c × μ) = 40 / (1 × 50.0) = 0.80
P(wait) = ErlangC(c = 1, λ/μ = 0.80) = 0.800
Wq = P(wait) / (c × μ − λ) = 0.800 / 10.0 = 80.0 ms

A simplified teaching model: it shows direction and scale, not a benchmark.

Build it yourselfCheat sheetCompare lessons

Course: 74 lessons
  1. 01 Foundations

    1. The life of a request
    2. Latency and throughput
    3. Napkin math
  2. 02 Scaling

    1. Scaling up vs scaling out
    2. Load balancing
    3. Stateless servers
    4. Caching
    5. Cache invalidation
    6. CDN and edge caching
  3. 03 Data & storage

    1. SQL and NoSQL
    2. Database indexes
    3. Geo search: who is nearby
    4. Full-text search
    5. Vector search
    6. Storage engines: B-tree and LSM
    7. Bloom filters
    8. Database replication
    9. Sharding
    10. Consistent hashing
    11. Unique IDs
    12. CAP: when the link breaks
    13. Consensus and leader election
    14. Transactions
    15. File uploads
  4. 04 Communication

    1. API styles
    2. Message queues
    3. Pub/sub and event logs
    4. Real-time updates
    5. Reliable callbacks
    6. Sending webhooks reliably
  5. 05 Reliability

    1. Redundancy and failover
    2. Rate limiting
    3. Timeouts and retries
    4. Observability
    5. SLOs and error budgets
    6. Backpressure
  6. 06 Architecture

    1. Microservices
    2. Service discovery
    3. Sagas and the outbox
    4. Change data capture (CDC)
    5. Transactional outbox
    6. Distributed locks
    7. Batch vs stream
    8. Multi-tenancy
    9. Event sourcing
  7. 07 Security

    1. Authentication
    2. Authorization
    3. Encryption and secrets
    4. Secrets management
  8. 08 Shipping

    1. Testing
    2. CI/CD: from commit to production
    3. Zero-downtime migrations
    4. Feature flags
  9. 09 Whole systems

    1. From requirements to design
    2. Design a URL shortener
    3. Design a news feed
    4. Design a chat
    5. Design a video streaming site
    6. Design search autocomplete
    7. Design a job scheduler
  10. 10 Business processes

    1. Payment gateway
    2. Money and rounding
    3. Double-entry ledger
    4. Payment reconciliation
    5. Subscription billing
    6. Electronic digital signature
    7. Document lifecycle
    8. Audit log
    9. Notification delivery
    10. Bulk import
    11. Refunds and chargebacks
    12. Gapless document numbering
  11. 11 Case studies

    1. Case: how Discord stores messages
    2. Case: Figma multiplayer editing