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,11 @@
|
||||
5
|
||||
1
|
||||
-1
|
||||
-1
|
||||
-1
|
||||
1
|
||||
-1
|
||||
-1
|
||||
1
|
||||
-1
|
||||
1
|
||||
@@ -0,0 +1,6 @@
|
||||
# A - B - C - D - E in a line, every link cost 1.
|
||||
5
|
||||
1 -1 -1 -1
|
||||
1 -1 -1
|
||||
1 -1
|
||||
1
|
||||
@@ -0,0 +1,5 @@
|
||||
# A - B - C in a line, every link cost 1, then the B-C link breaks.
|
||||
3
|
||||
1 -1 # A-B A-C
|
||||
1 # B-C
|
||||
fail B C
|
||||
@@ -0,0 +1,6 @@
|
||||
# Five routers, the 2015 post's example: A-B=5 A-C=2 A-D=3 B-C=4 B-E=3 C-E=4
|
||||
5
|
||||
5 2 3 -1 # A-B A-C A-D A-E
|
||||
4 -1 3 # B-C B-D B-E
|
||||
-1 4 # C-D C-E
|
||||
-1 # D-E
|
||||
@@ -0,0 +1,7 @@
|
||||
4
|
||||
1
|
||||
-1
|
||||
4
|
||||
2
|
||||
-1
|
||||
3
|
||||
@@ -0,0 +1,5 @@
|
||||
# Four routers. Links: A-B=1, A-D=4, B-C=2, C-D=3 (the example from the earlier post)
|
||||
4
|
||||
1 -1 4 # A-B A-C A-D
|
||||
2 -1 # B-C B-D
|
||||
3 # C-D
|
||||
@@ -0,0 +1,6 @@
|
||||
# A - B - C - D in a line; the middle link B-C breaks and the network splits in two.
|
||||
4
|
||||
1 -1 -1
|
||||
1 -1
|
||||
1
|
||||
fail B C
|
||||
Reference in New Issue
Block a user