Electronic Books

Router A still
believes it can access 10.4.0.0 through Router B. The routing table of Router A still re?¬‚ects a path
to network 10.4.0.0 with a distance of 2.
Because the routing table of Router B indicates a path to network 10.4.0.0, Router C believes it
has a viable path to network 10.4.0.0 through Router B. Router C updates its routing table to re?¬‚ect
a path to network 10.4.0.0 with a hop count of 2, as illustrated in Figure 3-10.
Figure 3-10 Inconsistent Path Information Between Routers
Router B receives a new update from Router C (3 hops). Router A receives the new routing table
from Router B, detects the modi?¬?ed distance vector to network 10.4.0.0, and recalculates its own
distance vector to 10.4.0.0 as 4, as shown in Figure 3-11.
A C B E0
S0
S0
10.1.0.0 10.4.0.0 10.2.0.0
S0
S1 E0
10.3.0.0
Routing Table
10.1.0.0
10.2.0.0
10.3.0.0
10.4.0.0
E0
S0
S0
S0
0
0
1
2
Routing Table
10.2.0.0
10.3.0.0
10.4.0.0
10.1.0.0
S0
S1
S1
S0
0
0
1
1
Routing Table
10.3.0.0
10.4.0.0
10.2.0.0
10.1.0.0
S0
E0
S0
S0
0
Down
1
2
X
A C B E0
S0
S0
10.1.0.0 10.4.0.0 10.2.0.0
S0
S1 E0
10.3.0.0
Routing Table
10.1.


Pages:
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177