Routing
Workloads are dispatched across the topology by adaptive routing protocols. Each simulation locates the cheapest path between origin and the next available compute node, forming a continuously rebalancing graph.
simulai.net
distributed simulation network
TOPOLOGY
Carrier
Edges in the graph are links — fiber, wave, or virtual circuit. Each carries packets of state between nodes that are agreeing on the next step of a simulation. Latency is the only currency.
ROUTING
RATE
— Gb/s
PEAK
— Gb/s
FLOW
stable
Throughput
Across the carrier mesh, simulation steps move as discrete packets — each one a fragment of physics waiting to be applied. The aggregate is throughput: the felt pulse of distributed work.
THROUGHPUT
Convergence
Every node arrives at the same answer at the same instant. The network folds inward; the graph collapses to a luminous point. The simulation has agreed with itself.
CONVERGENCE