Controlled payload
Both link models carry the identical byte count.
Unit Converters
Compare the same payload on two independently specified links without confusing advertised line rate with effective payload performance.
Controlled link comparison
Send the same payload through two independently declared link models. Each model combines nominal bit rate, payload efficiency, and one startup latency before comparing completion time and time saved.
| Comparison factor | Link A | Link B | Interpretation |
|---|
How to use
Send the same payload through two independently declared link models. Each model combines nominal bit rate, payload efficiency, and one startup latency before comparing completion time and time saved.
Both link models carry the identical byte count.
Nominal rate multiplied by payload efficiency.
One fixed delay added before payload duration.
Startup plus payload bits divided by effective rate.
Absolute difference between modeled completion times.
Result interpretation
The faster link is the one with lower modeled completion time for this payload. A higher nominal rate can still lose if its efficiency is poor or startup penalty matters. The comparison is workload specific.
Calculation method
Normalize payload to bytes. For each link, normalize nominal rate to bit/s, multiply by its efficiency, divide payload bits by effective rate, and add that link’s startup milliseconds once. Compare the two totals.
Evidence controls
Rates and startup delays must refer to equivalent endpoints and timing events.
Do not give one link measured goodput and the other a marketing efficiency guess.
Startup dominates small transfers; steady rate dominates large transfers.
Upload and download paths, VPN routes, and server locations can differ.
One-flow efficiency may not represent multi-stream or multi-user operation.
Wireless, shared access, cloud throttling, and Internet routing require distributions, not one constant.
Time savings do not include service cost, reliability, security, quotas, or operational effort.
Visual explanation
Each lane separates orange startup delay from colored payload transmission. The common horizontal scale makes completion difference and the controlling component visible.
Detailed calculation process
te = Lstartup + 8B/(Rη); Δt = |tA − tB|
| Symbol | Meaning | Required unit |
|---|---|---|
| B | common payload size | bytes |
| R | link nominal rate | bit/s |
| η | payload efficiency | 0 to 1 |
| Lstartup | fixed startup latency | s |
| te | modeled completion time | s |
| Δt | absolute time saved | s |
Reconciliation:Waiting for current inputs.
Defaults and assumptions
Defaults compare a 20 GB payload on 300 Mbit/s at 88% efficiency and 40 ms startup versus 500 Mbit/s at 70% and 120 ms startup.
| Check | Current value A | Current value B | Decision role |
|---|
Decision analysis
Use the result to compare a defined transfer, then sensitivity-test payload size and evidence ranges. For procurement or architecture, add reliability, cost, quotas, concurrency, and measured distributions.
Check whether startup latency includes connection setup, authentication, queueing, or only round-trip latency. For large payloads it may be negligible; for many small transfers it must be applied per object, not once to the whole batch. Efficiency should be derived from the same payload definition for both links. A single observed speed test may be optimistic, geographically irrelevant, or storage-limited. Record uncertainty or percentiles when the decision is sensitive.
Verification workflow
Use the identical payload bytes, direction, endpoints, application boundary, protocol purpose, and verification requirement for both alternatives. Compare nominal rates defined at the same layer and efficiencies derived from equally credible evidence. A provider’s advertised access speed is not comparable to measured application goodput without normalization. Record whether capacity is dedicated, shared, burstable, shaped, metered, or subject to quotas and whether upload differs from download.
Define startup as the fixed time from the chosen start event to sustained payload transfer or completion of setup. It may include DNS, connection, TLS, authentication, queueing, server preparation, storage open, or protocol ramp. Measure the same events for both links. For one large object, startup is added once; for thousands of independent objects it can recur and dominate. Do not substitute round-trip latency alone unless it represents the authorized startup model.
Efficiency depends on payload size, path, protocol, loss, latency, concurrency, encryption, CPU, storage, and service state. Derive A and B from representative measurements at the same payload boundary. Report percentiles or scenarios when either service varies. A link with lower advertised capacity can deliver higher useful rate through better path quality or endpoint behavior, while a high-capacity link can remain underfilled by one flow or storage bottleneck.
Evaluate small and large payloads to locate when fixed startup stops controlling and steady rate dominates. Test plausible low and high efficiency values and relevant service throttles. If completion times are close relative to performance variability, report no robust winner rather than relying on excessive displayed digits. Include parallel-user load and peak periods when the architecture must serve a fleet, because one controlled flow does not establish aggregate capacity or fairness.
Completion time is only one criterion. Compare availability, failure recovery, security, data residency, operational support, quotas, transfer charges, egress fees, equipment, energy, monitoring, and contractual service levels. Document which factor controls the decision and retain the calculation as one evidence item. Pilot the chosen path with exact-byte and timing reconciliation, and preserve results from both alternatives instead of discarding the slower test that explains operational risk.
Evidence and data lineage
Retain exact payload bytes, nominal service definitions, rate direction, efficiency measurement data, startup timing boundary, endpoints, route, protocol, concurrency, storage and CPU state, timestamps, service limits, and cost assumptions.
Limits and exclusions
The model excludes variability distributions, packet loss dynamics, TCP ramp, per-object setup, parallelism, retries, storage, compression, encryption, quotas, availability, reliability, security, and price.
Reference framework
IETF RFC 6349 offers a primary framework for throughput measurement and shows why bandwidth, round-trip time, loss, host behavior, and test configuration must be considered together. Nominal service descriptions and interface standards define capacity, but observed application payload performance must be measured at a named boundary. This calculator compares two simplified models with independent efficiency and one startup term. Use provider contracts, service telemetry, protocol documentation, and controlled test results for the actual decision. Preserve equivalent endpoint, direction, payload, and time definitions; otherwise the apparent winner can reflect mismatched evidence rather than a better link. If service behavior is asymmetric, repeat the comparison in both directions and at the relevant time periods. A link selected from one download trial may be unsuitable for backup uploads, replication, or recovery when upstream capacity, shaping, or routing differs.
Worked decision cases
Effective bulk rate dominates and startup difference is negligible.
Startup and protocol behavior can dominate, so a one-payload bulk comparison is insufficient.
Important note
Compare like with like: the same payload, direction, boundary, evidence quality, and operational conditions.
It can have better payload efficiency or lower startup delay for the selected payload.
No. This model adds one fixed startup latency.
Yes for a defined evidence set, but record variability and endpoints.
Use measured goodput divided by comparable nominal rate for the workload and boundary.
Only if efficiency evidence incorporates them consistently.
Fixed startup is important for small payloads, while steady rate controls large payloads.
Yes. Each rate is normalized independently to bit/s.
The unrounded modeled completion times are equal.
No. Add service and operational costs separately.
No. Reliability is outside the model.