Python starts when you choose Run.
When a Longer Space Route Is Faster
An explicit satellite chain shows when faster propagation compensates for the climb to orbit, with Earth-clearance checks for every space link.
Synthetic overhead-satellite chord-chain propagation arithmetic with Earth-clearance checks; no contemporary constellation model, moving-orbit routing graph, or network measurement.
The code uses Python 3 and the standard library. Saved output is from the checked CPU run.
altitude=550km arc_crossover=2882.1km ground=1000km hops=1 space=7.289ms fiber=4.897ms ground=3000km hops=3 space=14.529ms fiber=14.690ms ground=6000km hops=6 space=25.389ms fiber=29.380ms altitude=1150km arc_crossover=8000.2km ground=1000km hops=1 space=11.606ms fiber=4.897ms ground=3000km hops=3 space=19.473ms fiber=14.690ms ground=6000km hops=6 space=31.274ms fiber=29.380ms Earth-clearance and chord-length checks: passed
Sources
- Delay is Not an Option — accepted primary manuscript: https://discovery.ucl.ac.uk/id/eprint/10062262/7/Handley_hotnets.pdf
- Delay is Not an Option: Low Latency Routing in Space: https://discovery.ucl.ac.uk/id/eprint/10062262/
Python runs locally in this page. Saved results and figures are visible before execution.