◇ Documentation
Welcome to Kendall
A queueing-theory simulator for distributed systems. Design a topology on an isometric 3D canvas, simulate it under load, and find the bottleneck before production does.
These docs are split in two. The Introduction sections cover the product itself: how to sign in, what every piece of the canvas does, the keyboard shortcuts, and the questions people most often ask. The Math reference explains the queueing theory the simulator is built on — each formula has a worked example with realistic service parameters.
Sections
Introduction
- WelcomeWhat Kendall is and how this documentation is organised.
- Getting startedSign in, create a project, drop services on the canvas.
- Core conceptsDesigns, services, VPC containers, annotations, simulations, recommendations.
- Keyboard shortcutsEvery shortcut available on the canvas.
- FAQCommon questions about accuracy, scope, and data.
Math reference
- OverviewWhy queueing theory belongs in a system-design tool.
- Kendall notationA/S/c/K/N/D — the standard taxonomy for queueing systems.
- Little's Law & stabilityL = λ · W, the ρ < 1 stability condition, and why 95% utilisation isn't 5% headroom.
- M/M/1 and M/M/cSingle- and multi-server queues, Erlang C, and the square-root staffing rule.
- M/G/1 — Pollaczek–KhinchineWhy service-time variance dominates tail latency, with a worked example.
- M/M/c/K bounded queuesRate-limited endpoints, fixed-size pools, and blocking probability.
- Jackson networksComposing M/M/c stations into networks, latency composition, what's not modelled.