http://quantumagvxei55qyvhlj3zljkjryzzvvgckynsfr4r7tqgmiufj75qd.onion
That simply wouldn’t do. Instead, I thought to myself: what if I had a bunch of WireGuard tunnels between
the different locations I had, and then have something intelligent select an
optimal path between nodes? Open Shortest Path First (OSPF) seemed like
the perfect option, allowing optimal routes to be selected based on the lowest
possible cost (typically latency) based on Dijkstra’s algorithm ,
while routing around any failed links.