Self-check: every origin, link cut/restore and AS down/up is converged and compared with an independent synchronous Gao-Rexford solver.
Each AS keeps the best route it has heard from every neighbor and re-announces only that one, prepending its own AS number. With real policy on, a customer-learned route always beats a peer route, which always beats a provider route (customers pay you, you pay providers) β AS-path length is only the tie-breaker. Customer routes are re-announced to everyone; peer/provider routes are re-announced only to customers, so traffic never transits for free. Click Withdraw or fail a node/link to watch a real re-convergence, including brief path exploration as ASes hunt for a new best route.
The science
Decision process (per AS, per prefix): 1) highest local preference, set by business relationship (customer over peer over provider); 2) shortest AS-path; 3) lowest neighbour AS number as a deterministic tie-break. The chosen route is re-announced with the AS prepended: path' = [own AS] + path.
Export rule (Gao-Rexford): routes learned from a customer (or self-originated) go to every neighbour; routes learned from a peer or provider go only to customers. This yields valley-free paths: relations along a path match up* peer? down*.
stable iff for every AS: best = argmin over exportable neighbour routes of (pref, |path|, neighbour)
Gao-Rexford conditions (acyclic customer-provider hierarchy) => convergence is guaranteed.
Checks. The button converges every scenario (10 origins x 2 policies x [initial + 15 link cuts and restores + 10 AS downs and ups + withdrawal]) and compares each AS with an independent synchronous fixed-point solver, plus: path endpoints, no loops, next-hop consistency, no dead links, valley-free.
Honest simplifications. A 10-AS toy with one prefix. A message delay of 0.55-0.90 sim-s (seeded, FIFO per session like TCP) stands in for propagation and processing. Real BGP also has MRAI timers (about 30 s), MED, communities, route reflectors, many prefixes, route-flap damping and per-prefix policy exceptions. With "Shortest path only" there is no policy, so valley paths and free transit become possible. "Path-exploration events" counts best-path changes since the last event.