Distance-Vector Routing Lab: Metrics Climbing After a Link Failure (2D)
Routers drawn on a graph with the cost to the destination written on each one and the next hop shown as an arrow. Fail a link and step through the rounds of plain, split-horizon or path-vector routing, with live curves of metric against round. Same shared model as the 3D scene.
Cut a link in a small router network and watch distance-vector routing react round by round. Plain Bellman-Ford routers bounce the lost destination between each other and count up to infinity; split horizon with poison reverse and a path-vector loop check stop it. Choose topology, failed link, destination and the value of infinity and compare rounds to converge. Blender-built routers and cables, with numerical checks against Dijkstra and a closed form built in.
Routers drawn on a graph with the cost to the destination written on each one and the next hop shown as an arrow. Fail a link and step through the rounds of plain, split-horizon or path-vector routing, with live curves of metric against round. Same shared model as the 3D scene.
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install