Free cookie consent management tool by TermsFeed Generator

Posts with tag "control-theory"

See all tags
12 posts in total

The Barrier the Scaler Cannot Hold

During the provisioning delay an autoscaler has ordered capacity and controls nothing. This post prices the three ways to survive that interval: run colder, make clients retry less, or refuse work at the door. Under heavy-tailed demand the third bounds the backlog and moves its tail into rejected requests. Time can be bought, and buying it is what shrinks the excess. A limit can only move it.

•

Demand Is Not Debt

A service with capacity at twice its demand can still serve almost nothing. Timeouts and retries leave work that no client is waiting for, and that debt needs capacity the demand figure never mentions. This post states when the failed state, once entered, becomes permanent, and shows that an autoscaler fed a clean demand signal can hold a service exactly there. With two retries, any target of a third or more is enough.

•

The Delay a Window Demands

Scale a consumer on its backlog with the default five-minute stabilization window, and it can swing between a handful of pods and its ceiling while demand stays flat. This post follows a queue through KEDA into the Kubernetes autoscaler and finds the condition for rest: a standing delay of about one provisioning dead time. At the Kafka default of ten messages per pod, a consumer handling ten messages a second carries one second of it.

•

One Bit per Dead Time

A CPU metric cannot report more load than the pods can carry, so a twofold overload and a thirtyfold one draw the same first request for capacity. This post reads the Kubernetes autoscaler's source to see what it computes, then derives what follows: it sizes an overload at most one multiplication per provisioning delay. At a 50% target that is one bit per dead time. At the API's default of 80%, a thirtyfold overload takes fifteen rounds.

•

The Trigger to Stop Simulating

When does more simulation stop paying, and building the fix become overdue? This post treats the decision as a bounded premium paid once for the right to survive an open-ended, heavy-tailed cost, and derives the threshold. At the base discount rate every tail weight the series has priced clears it, though the lightest tail's margin depends on that rate in a way the heavier tails' margins do not.

•

The Meta-Constraint This Series Never Priced

Five posts have priced, over and over, what it costs to guess wrong about a distribution that won't hold still: borrowing five of the Constraint Sequence Framework's six named components along the way, without ever turning the sixth, Meta-Constraint Awareness, on the machinery doing the pricing. This post runs that test on its own series: a real, three-times-computed numerator with a fourth entry named but never priced, a denominator no post has ever measured, and a Return on Investment whose sign comes out genuinely undetermined, not favorably assumed. The formula's own algebra still yields a real bound on how cheap that machinery has to be, and formal metareasoning research, cited directly, explains why the missing stopping criterion isn't an oversight: it's the same unsolvable regress that research already proved exists and resolved by capping it, not computing it. Then it points the same unpriced test at the next post's own proposal (centralizing the machinery itself) before that proposal gets to claim an advantage nobody has costed either.

•

Optimal Stopping at the Edge of a Limit Cycle

Post 3 cited a paper this series can't quietly set aside: threshold-based eviction, proven dynamically unstable under saturated demand, a worst-case limit cycle that costs up to half of throughput. This post takes on the population Blood Oath was built to exclude from that result (tasks that can actually be evicted) and asks the two questions Post 3 left open: is a single eviction worth its cost, and is running that rule as a policy, at scale, safe from the instability Post 3 only watched from the outside. It also checks a third: would a fleet-wide coordinator make a better call than the local rule this post proves optimal on its own terms: and the answer splits in two, one physical reason coordination can't help the ranking decision itself, and one real, unpriced reason it still might help pace evictions across nodes sharing the same fabric.

•

The Phase MAPE-K Usually Skips

No algorithm can save a Blood Oath workload: Post 1 proved that formally. What's left is physical, not algorithmic: a redline that watches real headroom and its derivative instead of trusting a number, an honest accounting of when autoscaling actually helps, and a buffer sized by the same critical-fractile logic that opened the series. None of it adapts on its own; that only starts once MAPE-K's own most commonly skipped phase, Knowledge, actually closes the loop the other four were never built to close by themselves.

•

Self-Healing Without Connectivity

Detection is the easy part — acting without making things worse is harder. This article works through the MAPE-K autonomic loop adapted for edge conditions: stability conditions, confidence-gated action thresholds, dependency-ordered recovery to prevent cascades, and a self-throttling law that keeps the loop from consuming the very resources it's trying to protect.

•