Distance-Vector Routing Lab: Link Failure, Count to Infinity, Split Horizon and Path Vector
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.
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.
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.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install