Advanced12 min read

Maglev Hashing

Precompute a lookup table so routing is O(1) and disruption is minimal — Google's hashing for software network load balancers.

Overview

What this concept solves

This concept's explanation is in progress. The prototype below works today — try it while the words catch up.

Mechanics

How it works

Content coming soon

This concept's full explanation is being written. The prototype below works today.

Interactive prototype

Run it. Break it. Tune it.

Sandboxed simulation embedded right in the page. No setup, no install.

Coming soon

Interactive simulation loads here

Each concept ships with a sandboxed, hands-on prototype. The author wires the HTML file once and it loads in this frame.

About this simulation

When this concept's prototype lands, it loads here as a sandboxed iframe.

Hands-on

Try these on your own

Open the prototype above, run each experiment, predict the answer, then verify.

try 01

Open the prototype

Run the simulation above and form a hypothesis about how it'll respond to a burst.

try 02

Try a burst

Most prototypes have a 'Burst' button. Click it and see if your prediction held.

try 03

Tune a parameter

Where you can, adjust capacity or rate. Note the trade-off you just discovered.

Reference

Code & further reading

A minimal reference implementation and pointers worth bookmarking.

reference.ts
// A reference implementation will land here with the real content.

Knowledge check

Did the prototype land?

Quick questions, answers revealed on submit. No scoring saved.

question 01 / 03

Which property best distinguishes a token bucket from a leaky bucket?

question 02 / 03

What is the typical trade-off when you raise the bucket capacity?

question 03 / 03

Where does a token bucket usually live in a real system?

0/3 answered

Was this concept helpful?

Tell us what worked, or what to improve. We read every note.