The Bandwidth-Budget Equations

Ada checks the bandwidth-budget equations — byte rate, reduction ratio, and queue stability

ADA · CALCULATION AUDIT

Foundations · optional mathematics and physics

The Bandwidth-Budget Equations

This chapter frames bandwidth as conservation of bytes over time — production, reduction, upload, and storage must share one unit before a gateway claim is accepted, starting from a 5-minute (300 s) review window. Because the text gives no fixed payload sizes or link rates, the audit keeps its terms symbolic instead of inventing values. This audit lays out the bandwidth-budget equations — byte rate, reduction ratio, and queue stability — as reusable checks.

Companion to the chapter Bandwidth Optimization at the Edge — every number here comes from that chapter.

Byte rate, reduction ratio, and queue stability, no invented constants

Bandwidth math is conservation of bytes over time: production, reduction, upload, and storage must use the same units before a gateway claim is accepted.

The working

1. Convert the chapter's review window first. The text gives a five-minute summary example but no fixed payload sizes or link rates, so this audit keeps payload and capacity terms symbolic instead of inventing values.

T_window = 5 min x 60 s/min = 300 s

2. Count raw and reduced traffic in bytes per second. If a gateway receives N samples of S_raw bytes during the same window, the raw production rate is:

R_raw = (N x S_raw) / T_window

Review question	Formula to verify	Audit result
Window conversion	5 min x 60 s/min	300 s. The time unit is explicit before any byte-rate calculation. arithmetic verified
Reduction ratio	reduction = 1 - (B_reduced / B_raw)	Both byte totals describe the same window, so the ratio is dimensionless and can be reported as a percentage with 100 x reduction.
Stable uplink	R_reduced + R_urgent <= C_uplink	Reduced routine traffic and urgent traffic must be compared with link capacity in the same bytes-per-second unit.
Backpressure growth	Q_growth = R_in - R_out	When incoming bytes per second exceed outgoing bytes per second, the queue grows; when the value is zero or negative, it is stable.
Outage storage	Q_needed = Q_start + max(0, Q_growth) x T_outage	The storage claim is valid only if the retained queue budget is at least the starting backlog plus positive growth over the outage time.

3. The physics check is unit consistency. A bandwidth design cannot compare samples per window, bytes per message, and cellular capacity until they are converted into compatible byte totals or byte rates. That is why the accepted record must name the window, payloads, urgent bypass, queue limit, expiry rule, and loss marker.

4. The design decision follows the sign of the queue balance. If R_reduced + R_urgent fits under C_uplink, the link can carry the accepted traffic mix under the stated conditions. If it does not, the review must change the reduction rule, priority policy, retention limit, or tier placement. No payload-size or link-rate number is claimed here because the chapter does not supply one.

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