Routing loops
CCNA 2 Chapter 4
30-Apr-12
Routing loops
A problem that can occur with distance vector routing protocols It happens when systems are slow to converge so that routers have inconsistent routing tables Packets can be forwarded in the wrong direction Packets can be forwarded endlessly round loops
30-Apr-12 2
Convergence
The system is converged when all routers have consistent information about the network Suppose a link goes down the adjoining routers know about it but the others dont The system is not converged again until all routers know about the link going down This can be slow each router has to update its routing table and pass it to its neighbors
30-Apr-12 3
Converged
All routers have a route to A
30-Apr-12
Link down not converged
30-Apr-12
Link down not converged
30-Apr-12
Link down not converged
30-Apr-12
Link down not converged
30-Apr-12
Link down - converged
30-Apr-12
Alternative routes
If there is more than one possible route to a network then a routing loop could develop This can happen when there is a change in the network and routers are slow to find out about the change (system is slow to converge)
30-Apr-12
10
a. Routing loop beginning
To 1 via A 2 hops
Network 1 goes down. Router E knows. To 1 via E 1 hop
To 1 via B 3 hops To 1 via D 3 hops To 1 via A 2 hops
30-Apr-12
No route to 1
11
b. Routing loop develops
E sends update to A
To 1 via A 2 hops
No route to 1
To 1 via B 3 hops To 1 via D 3 hops To 1 via A 2 hops
30-Apr-12
No route to 1
12
c. Routing loop develops
A sends updates
No route to 1
No route to 1
To 1 via B 3 hops To 1 via D 3 hops No route to 1
30-Apr-12
No route to 1
13
d. Routing loop develops
To 1 via C 4 hops
To 1 via B 3 hops To 1 via D 3 hops C still thinks it has routes it sends updates No route to 1 No route to 1
To 1 via C 4 hops
30-Apr-12 14
e. Routing loop develops
To 1 via C 4 hops B and D think they have new routes To 1 via B 5 hops To 1 via D 5 hops
To 1 via B 3 hops To 1 via D 3 hops To 1 via C 4 hops
30-Apr-12
No route to 1
15
f. Routing loop develops
To 1 via C 4 hops A updates E about its new route to 1 To 1 via B 5 hops To 1 via D 5 hops
To 1 via B 3 hops To 1 via D 3 hops To 1 via C 4 hops
30-Apr-12
To 1 via A 6 hops
Packets for network 1 are passed round until they 16 time out
Count to infinity
Packet could loop for ever but routing protocol specifies a limit RIP regards 16 hops as infinity discard packet
30-Apr-12
17
Split horizon rule
Router B learns about a route from router C Router B does not include this route in its updates to router C This rule reduces the likelihood of routing loops
30-Apr-12
18
Routing loop does not develop
A sends updates
No route to 1
No route to 1
To 1 via B 3 hops To 1 via D 3 hops No route to 1
30-Apr-12
No route to 1
19
Routing loop does not develop
Updates do NOT include routes to 1 To 1 via B 3 hops To 1 via D 3 hops
No route to 1
No route to 1 No route to 1
No route to 1
30-Apr-12 20
Routing loop does not develop
B and D do inform C about 1
No route to 1
No route to 1 No route to 1
No route to 1
No route to 1
30-Apr-12 21
Split horizon rule in action
Router C originally learned the routes to network 1 from B and D It therefore does not include information about network 1 in its updates to B and D No routing loop develops
30-Apr-12
22
The End
30-Apr-12
23
