Files
cs-lab-programs/cn/dvr/output/03-count-to-infinity.txt
T

67 lines
1.4 KiB
Plaintext

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 -