Home▸Space & Astronomy▸Inter-Satellite Link Mesh Routing

Inter-Satellite Link Mesh Routing

Route a packet across a moving LEO satellite shell: compare direct sky-to-sky inter-satellite link (ISL) mesh routing against old-style bent-pipe relaying that must bounce every hop back down to a ground gateway. Live shortest-path latency for both.

Space & Astronomy3DAdvanced60 FPS📱 Mobile-adapted
Inter-Satellite Link Mesh Routing ↗ Open standalone

A shell of LEO satellites orbits above a rotating Earth while a packet needs to travel from a ground station in New York to one in Tokyo. Every frame the simulation rebuilds a live graph of which satellites can see each other (within the ISL range slider and not blocked by the planet) and which satellites are visible from each ground station, then runs Dijkstra's shortest-path algorithm twice: once allowing direct satellite-to-satellite links (the modern inter-satellite-link mesh), and once forcing every hop back down through a ground gateway and terrestrial fiber backhaul (the older bent-pipe transponder architecture). Compare hop counts and real propagation-delay latency for both live as the constellation moves.

⚙ Under the hood

Route a packet across a moving LEO satellite shell from New York to Tokyo. Live shortest-path (Dijkstra) routing compares direct sky-to-sky inter-satellite link (ISL) mesh hops against old-style bent-pipe relaying that must bounce every hop back down through a ground gateway and fiber backhaul, with real propagation-delay latency for both.

inter-satellite linkISL meshLEO mega-constellationbent-pipe routingDijkstra shortest pathground gatewaysatellite networkingpropagation delay

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)