What does Collapsing Idea-to-Delivery Latency conclude, in numbers, about “Queues: Why Full Utilisation Is Not Efficiency”?
Answer: Chapter 3 shows that at utilisation 0.90 the queueing wait is already 9.00 service times.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs; it offers general, not individual, business guidance, promises no launch date or income, and every production deployment is carried out only after a person confirms it. Chapter 2 splits latency into four drags, decision, start-up, feedback and hand-off, with an illustrative median of 99.9 hours and P90 of 199.8 hours, the tail driven mainly by feedback and decision.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.90, 9.00
| A. exact M/M/1, service time 1 day | |
| rho wait in queue time in system | |
| 0.50 | 1.00 2.00 |
| 0.70 | 2.33 3.33 |
| 0.80 | 4.00 5.00 |
| 0.85 | 5.67 6.67 |
| 0.90 | 9.00 10.00 |
| 0.95 | 19.00 20.00 |
| 0.98 | 49.00 50.00 |
| B. simulation and Little's law, L vs lambda * W | |
| rho W sim W exact L probe lambda*W | |
| 0.70 | 3.30 3.33 2.32 2.32 |
| 0.90 | 10.22 10.00 9.27 9.21 |
| C. rho 0.90 | 0.80: queue wait 9.00 -> 4.00 days, x0.44 |
| throughput given up | 0.111 of the busier level |
Show the full program
# Chapter 3. p31: utilisation against waiting in an M/M/1 queue.
# One maker (or one reviewer) serves ideas at rate mu = 1 per day;
# ideas arrive at rate lambda = rho. Exact: the mean wait in queue is
# rho / (1 - rho) service times, the mean time in system 1 / (1 - rho).
# Simulation: 200,000 ideas by the Lindley recursion with a fixed seed;
# L is measured independently at 20,000 random probe times as arrivals
# minus departures so far, then compared with lambda * W (Little 1961).
import bisect
import math
import random
import statistics
N = 200000
PROBES = 20000
def simulate(rho, rng):
t, wq, arr, dep, soj = 0.0, 0.0, [], [], []
prev_s = 0.0
for i in range(N):
a = rng.expovariate(rho)
t += a
if i:
wq = max(0.0, wq + prev_s - a)
s = rng.expovariate(1.0)
arr.append(t)
dep.append(t + wq + s)
soj.append(wq + s)
prev_s = s
dep_sorted = sorted(dep)
lo, hi = arr[N // 10], arr[-1] * 0.9
probe = random.Random(31002)
counts = []
for _ in range(PROBES):
x = probe.uniform(lo, hi)
counts.append(bisect.bisect_right(arr, x)
- bisect.bisect_right(dep_sorted, x))
lam = N / arr[-1]
return statistics.fmean(soj[N // 10:]), statistics.fmean(counts), lam
if __name__ == "__main__":
print("A. exact M/M/1, service time 1 day")
print(" rho wait in queue time in system")
for rho in (0.50, 0.70, 0.80, 0.85, 0.90, 0.95, 0.98):
print(" {:.2f} {:>8.2f} {:>8.2f}".format(
rho, rho / (1.0 - rho), 1.0 / (1.0 - rho)))
print("B. simulation and Little's law, L vs lambda * W")
print(" rho W sim W exact L probe lambda*W")
for rho, rng in ((0.70, random.Random(31001)),
(0.90, random.Random(31003))):
w, l, lam = simulate(rho, rng)
print(" {:.2f} {:>5.2f} {:>6.2f} {:>7.2f} {:>7.2f}".format(
rho, w, 1.0 / (1.0 - rho), l, lam * w))
w9, w8 = 0.9 / (1.0 - 0.9), 0.8 / (1.0 - 0.8)
print("C. rho 0.90 -> 0.80: queue wait {:.2f} -> {:.2f} days, x{:.2f}"
.format(w9, w8, w8 / w9))
print(" throughput given up: {:.3f} of the busier level"
.format(1.0 - 0.8 / 0.9))Single source and citation
Fan, Y. (2026). Collapsing Idea-to-Reality Latency: Feedback-Bandwidth Limits, Zero-Friction Toolchains and High-Velocity Execution Physics (Version 1.0.0), Chapter 3: Queues: Why Full Utilisation Is Not Efficiency. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-420 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026420,
author = {Fan, Yafu},
title = {Collapsing Idea-to-Reality Latency: Feedback-Bandwidth Limits, Zero-Friction Toolchains and High-Velocity Execution Physics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Loop Bandwidth: With the Delay Unchanged, More Gain Only Buys Oscillation
- Chapter 2 · Decomposing End-to-End Latency: Four Drags and the Slowest Tenth
- Chapter 4 · Batches and Rehearsal: the U-Shaped Cost and the Smith Predictor
- Chapter 5 · Hand-offs, Switching and Hesitation: Three Losses Along the Chain
- Chapter 6 · Toolchain Friction and Gates: Why Speed Never Skips a Gate
- Chapter 7 · Classical Sources East and West: Clumsy Speed, the Ant Hole and Maxwell on Governors
- Chapter 8 · Closing the Loop: the Latency Ledger, Field Tools and Checker Specifications