The Response-Budget Equations

Ada checks the response-budget equations — segment sum, slack, and tail spread

ADA · CALCULATION AUDIT

Foundations · optional mathematics and physics

The Response-Budget Equations

This chapter breaks an end-to-end response into named delays — sensing, network, queue, processing, command, and actuation — that sum on one event-to-response clock, with slack measured against the deadline. Because the chapter supplies no fixed millisecond trace, the audit stays symbolic rather than inventing values. This audit sets out the response-budget equations and the placement rule that follows the sign of the slack.

Companion to the chapter Latency Budgets for Tier Choice — every number here comes from that chapter.

Segment sum, slack, and tail spread, no invented constants

A latency budget is a physics timer: start at the physical event, add every measured delay on the path, then compare the sum with the response deadline the system must meet.

The working

1. Add only measured time segments. The chapter does not give a fixed millisecond trace, so this audit keeps the calculation symbolic instead of inventing values. Every term below is a time interval measured from the same event-to-response path.

T_response = T_sense + T_network + T_queue + T_process + T_command + T_actuate

Review question	Formula to verify	Why it is valid
End-to-end response	T_response = sum(path segments)	All terms are delays on the same physical-event clock, so the total response is their sum. formula verified
Remaining slack	S = D - T_response	The deadline D and response total use the same time unit; positive slack means the measured path fits the budget.
Tail spread	J_tail = T_tail - T_median	Subtracting the median path time from the accepted tail path time exposes jitter that an average can hide.
Placement gate	T_tail <= D	The tier can own the immediate response only when the accepted tail path still meets the deadline under the stated load.

2. The arithmetic rule is dimensional consistency. Do not mix a gateway queue measured in milliseconds with a cloud worker trace measured in seconds until both are converted to the same unit. The equation is valid only because each segment is a time interval and every boundary is counted once.

3. The placement decision follows the sign of slack. If S is positive under the accepted tail condition, the path has measurable room. If S is negative, the response owner must move closer to the device, simplify the path, or define a fallback action. No extra numeric margin is claimed here because the chapter has no fixed trace values to reuse.

Every term above is taken from the chapter's own response-budget example and re-derived step by step.