Add cn/dvr: Distance Vector Routing simulator with count-to-infinity demos and captured output

Co-Authored-By: Claude Sonnet 5.5 <[email protected]>
Claude-Session: https://claude.ai/code/session_017ic4b6V3xQR5XUmTbjaYAK
This commit is contained in:
Claude
2026-11-12 20:56:48 +05:30
parent abaf3840f2
commit f784f9b6ee
23 changed files with 1436 additions and 0 deletions
+66
View File
@@ -0,0 +1,66 @@
routers: 4, infinity = 16, poison reverse = off
links: A-B=1 A-D=4 B-C=2 C-D=3
== initial convergence ==
-- round 0 (direct links only) --
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C INF -
D 4 D
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 2 C
D INF -
C Routing Table
Dest Dist Next hop
A INF -
B 2 B
C 0 -
D 3 D
D Routing Table
Dest Dist Next hop
A 4 A
B INF -
C 3 C
D 0 -
-- after round 1 --
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 3 B
D 4 D
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 2 C
D 5 A
C Routing Table
Dest Dist Next hop
A 3 B
B 2 B
C 0 -
D 3 D
D Routing Table
Dest Dist Next hop
A 4 A
B 5 A
C 3 C
D 0 -
converged: round 2 changed nothing
rounds that changed something: 1
check vs Floyd-Warshall: match
+131
View File
@@ -0,0 +1,131 @@
routers: 5, infinity = 16, poison reverse = off
links: A-B=5 A-C=2 A-D=3 B-C=4 B-E=3 C-E=4
== initial convergence ==
-- round 0 (direct links only) --
A Routing Table
Dest Dist Next hop
A 0 -
B 5 B
C 2 C
D 3 D
E INF -
B Routing Table
Dest Dist Next hop
A 5 A
B 0 -
C 4 C
D INF -
E 3 E
C Routing Table
Dest Dist Next hop
A 2 A
B 4 B
C 0 -
D INF -
E 4 E
D Routing Table
Dest Dist Next hop
A 3 A
B INF -
C INF -
D 0 -
E INF -
E Routing Table
Dest Dist Next hop
A INF -
B 3 B
C 4 C
D INF -
E 0 -
-- after round 1 --
A Routing Table
Dest Dist Next hop
A 0 -
B 5 B
C 2 C
D 3 D
E 6 C
B Routing Table
Dest Dist Next hop
A 5 A
B 0 -
C 4 C
D 8 A
E 3 E
C Routing Table
Dest Dist Next hop
A 2 A
B 4 B
C 0 -
D 5 A
E 4 E
D Routing Table
Dest Dist Next hop
A 3 A
B 8 A
C 5 A
D 0 -
E INF -
E Routing Table
Dest Dist Next hop
A 6 C
B 3 B
C 4 C
D INF -
E 0 -
-- after round 2 --
A Routing Table
Dest Dist Next hop
A 0 -
B 5 B
C 2 C
D 3 D
E 6 C
B Routing Table
Dest Dist Next hop
A 5 A
B 0 -
C 4 C
D 8 A
E 3 E
C Routing Table
Dest Dist Next hop
A 2 A
B 4 B
C 0 -
D 5 A
E 4 E
D Routing Table
Dest Dist Next hop
A 3 A
B 8 A
C 5 A
D 0 -
E 9 A
E Routing Table
Dest Dist Next hop
A 6 C
B 3 B
C 4 C
D 9 C
E 0 -
converged: round 3 changed nothing
rounds that changed something: 2
check vs Floyd-Warshall: match
+66
View File
@@ -0,0 +1,66 @@
routers: 3, infinity = 16, poison reverse = off
links: A-B=1 B-C=1
== initial convergence ==
round 0 | to C: A=INF B=1(C)
round 1 | to C: A=2(B) B=1(C)
converged: round 2 changed nothing
rounds that changed something: 1
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 2 B
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 1 C
C Routing Table
Dest Dist Next hop
A 2 B
B 1 B
C 0 -
== link B-C fails ==
round 0 | to C: A=2(B) B=1(C)
round 1 | to C: A=2(B) B=3(A)
round 2 | to C: A=4(B) B=3(A)
round 3 | to C: A=4(B) B=5(A)
round 4 | to C: A=6(B) B=5(A)
round 5 | to C: A=6(B) B=7(A)
round 6 | to C: A=8(B) B=7(A)
round 7 | to C: A=8(B) B=9(A)
round 8 | to C: A=10(B) B=9(A)
round 9 | to C: A=10(B) B=11(A)
round 10 | to C: A=12(B) B=11(A)
round 11 | to C: A=12(B) B=13(A)
round 12 | to C: A=14(B) B=13(A)
round 13 | to C: A=14(B) B=15(A)
round 14 | to C: A=INF B=15(A)
round 15 | to C: A=INF B=INF
converged: round 16 changed nothing
rounds that changed something: 15
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C INF -
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C INF -
C Routing Table
Dest Dist Next hop
A INF -
B INF -
C 0 -
+53
View File
@@ -0,0 +1,53 @@
routers: 3, infinity = 16, poison reverse = on
links: A-B=1 B-C=1
== initial convergence ==
round 0 | to C: A=INF B=1(C)
round 1 | to C: A=2(B) B=1(C)
converged: round 2 changed nothing
rounds that changed something: 1
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 2 B
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 1 C
C Routing Table
Dest Dist Next hop
A 2 B
B 1 B
C 0 -
== link B-C fails ==
round 0 | to C: A=2(B) B=1(C)
round 1 | to C: A=2(B) B=INF
round 2 | to C: A=INF B=INF
converged: round 3 changed nothing
rounds that changed something: 2
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C INF -
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C INF -
C Routing Table
Dest Dist Next hop
A INF -
B INF -
C 0 -
+74
View File
@@ -0,0 +1,74 @@
routers: 4, infinity = 16, poison reverse = on
links: A-B=1 B-C=1 C-D=1
== initial convergence ==
round 0 | to D: A=INF B=INF C=1(D)
round 1 | to D: A=INF B=2(C) C=1(D)
round 2 | to D: A=3(B) B=2(C) C=1(D)
converged: round 3 changed nothing
rounds that changed something: 2
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 2 B
D 3 B
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 1 C
D 2 C
C Routing Table
Dest Dist Next hop
A 2 B
B 1 B
C 0 -
D 1 D
D Routing Table
Dest Dist Next hop
A 3 C
B 2 C
C 1 C
D 0 -
== link B-C fails ==
round 0 | to D: A=3(B) B=2(C) C=1(D)
round 1 | to D: A=3(B) B=INF C=1(D)
round 2 | to D: A=INF B=INF C=1(D)
converged: round 3 changed nothing
rounds that changed something: 2
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C INF -
D INF -
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C INF -
D INF -
C Routing Table
Dest Dist Next hop
A INF -
B INF -
C 0 -
D 1 D
D Routing Table
Dest Dist Next hop
A INF -
B INF -
C 1 C
D 0 -
+87
View File
@@ -0,0 +1,87 @@
routers: 4, infinity = 16, poison reverse = off
links: A-B=1 B-C=1 C-D=1
== initial convergence ==
round 0 | to D: A=INF B=INF C=1(D)
round 1 | to D: A=INF B=2(C) C=1(D)
round 2 | to D: A=3(B) B=2(C) C=1(D)
converged: round 3 changed nothing
rounds that changed something: 2
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 2 B
D 3 B
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 1 C
D 2 C
C Routing Table
Dest Dist Next hop
A 2 B
B 1 B
C 0 -
D 1 D
D Routing Table
Dest Dist Next hop
A 3 C
B 2 C
C 1 C
D 0 -
== link B-C fails ==
round 0 | to D: A=3(B) B=2(C) C=1(D)
round 1 | to D: A=3(B) B=4(A) C=1(D)
round 2 | to D: A=5(B) B=4(A) C=1(D)
round 3 | to D: A=5(B) B=6(A) C=1(D)
round 4 | to D: A=7(B) B=6(A) C=1(D)
round 5 | to D: A=7(B) B=8(A) C=1(D)
round 6 | to D: A=9(B) B=8(A) C=1(D)
round 7 | to D: A=9(B) B=10(A) C=1(D)
round 8 | to D: A=11(B) B=10(A) C=1(D)
round 9 | to D: A=11(B) B=12(A) C=1(D)
round 10 | to D: A=13(B) B=12(A) C=1(D)
round 11 | to D: A=13(B) B=14(A) C=1(D)
round 12 | to D: A=15(B) B=14(A) C=1(D)
round 13 | to D: A=15(B) B=INF C=1(D)
round 14 | to D: A=INF B=INF C=1(D)
round 15 | to D: A=INF B=INF C=1(D)
converged: round 16 changed nothing
rounds that changed something: 15
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C INF -
D INF -
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C INF -
D INF -
C Routing Table
Dest Dist Next hop
A INF -
B INF -
C 0 -
D 1 D
D Routing Table
Dest Dist Next hop
A INF -
B INF -
C 1 C
D 0 -
+47
View File
@@ -0,0 +1,47 @@
routers: 5, infinity = 16, poison reverse = off
links: A-B=1 B-C=1 C-D=1 D-E=1
== initial convergence ==
converged: round 4 changed nothing
rounds that changed something: 3
check vs Floyd-Warshall: match
A Routing Table
Dest Dist Next hop
A 0 -
B 1 B
C 2 B
D 3 B
E 4 B
B Routing Table
Dest Dist Next hop
A 1 A
B 0 -
C 1 C
D 2 C
E 3 C
C Routing Table
Dest Dist Next hop
A 2 B
B 1 B
C 0 -
D 1 D
E 2 D
D Routing Table
Dest Dist Next hop
A 3 C
B 2 C
C 1 C
D 0 -
E 1 E
E Routing Table
Dest Dist Next hop
A 4 D
B 3 D
C 2 D
D 1 D
E 0 -
@@ -0,0 +1,41 @@
After Convergence:
A Routing Table
Node Dist Via
A 0 -
B 1 -
C 2 -
D 3 -
E 4 -
B Routing Table
Node Dist Via
A 1 -
B 0 -
C 1 -
D 2 -
E 3 -
C Routing Table
Node Dist Via
A 2 -
B 1 -
C 0 -
D 1 -
E 2 -
D Routing Table
Node Dist Via
A 3 -
B 2 -
C 1 -
D 0 -
E 1 -
E Routing Table
Node Dist Via
A 4 -
B 3 -
C 2 -
D 1 -
E 0 -
@@ -0,0 +1,4 @@
legacy/old_dvr_2015_turbocpp.cpp:1:9: fatal error: iostream.h: No such file or directory
1 | #include<iostream.h>
| ^~~~~~~~~~~~
compilation terminated.
@@ -0,0 +1,29 @@
After Convergence:
A Routing Table
Node Dist Via
A 0 -
B 1 -
C 3 -
D 4 -
B Routing Table
Node Dist Via
A 1 -
B 0 -
C 2 -
D 5 -
C Routing Table
Node Dist Via
A 3 -
B 2 -
C 0 -
D 3 -
D Routing Table
Node Dist Via
A 4 -
B 5 -
C 3 -
D 0 -