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:
@@ -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 -
|
||||
Reference in New Issue
Block a user